光OFDM系统中一种联合改进的低复杂度PTS峰均比抑制技术

光正交频分复用系统(O-OFDM)的缺点之一是存在高的峰值平均功率比(PAPR),部分传输序列(PTS)技术能够有效降低高PAPR出现的概率,但其计算复杂度较高。针对该问题,提出一种可降低计算复杂度的二阶PTS和削波(Clipping)联合改进的PAPR抑制方案。该方案首先将初始的输入信号进行d级逆快速傅里叶变换(IFFT)运算,再进行子块划分,然后进行剩下的n-d级IFFT运算。仿真结果表明,该方案大大降低了计算复杂度,并且在峰均比抑制效果和系统误码率(BER)方面都得到了较好的改善,具有较高的实际应用价值。     

PAPR reduction of OFDM signals using partial transmit sequence: an optimal approach using sphere decoding

Partial transmit sequence (PTS) is a promising technique for peak-to-average-power ratio (PAPR) reduction in orthogonal frequency division multiplexing (OFDM) systems. Computation of optimal PTS weight factors via exhaustive search requires exponential complexity in the number of subblocks; consequently, many suboptimal strategies have been developed to date. In this letter, we introduce an efficient algorithm for computing the optimal PTS weights that has lower complexity than exhaustive search.     

Sub-optimum PTS for PAPR reduction of OFDM signals

As an attractive technique for peak-to-average power ratio (PAPR) reduction, partial transmit sequences (PTS) provides good PAPR reduction performance for orthogonal frequency division multiplexing (OFDM) signals. However, optimum PTS (OPTS) requires an exhaustive search over all combinations of allowed phase factors, resulting in the high complexity. Proposed is a sub-optimum partial transmit sequences (sub-OPTS) for PAPR reduction of OFDM signals. In sub-OPTS, both the alternate optimisation and the linear property of inverse discrete Fourier transform are employed. Simulation results show that sub-OPTS can reduce the computational complexity dramatically and achieve almost the same PAPR reduction performance compared to OPTS.     

光OFDM系统中基于PTS算法对峰均比抑制技术的分析

针对光正交频分复用(OFDM)系统中峰值平均功率比(PAPR)较高的缺点,重点研究了基于部分序列传输法(PTS)的峰均比抑制技术,提出一种改进的加强迭代PTS搜索技术(EIA-PTS),该技术能够降低原PTS的计算复杂度.仿真表明:原PTS方法随着相应参数的增加,迭代次数呈指数型增长,而EIA-PTS技术的迭代次数基本保持平稳且低于原PTS方法.在此基础上,又将EIA-PTS与削波(Clipping)技术相结合,提出了峰均比EIA-PTS-Clipping联合抑制技术.与EIA-PTS技术相比,该技术进一步提升了系统PAPR的抑制性能,能在系统误码率(BER)性能与PAPR抑制效果之间取得更好的折衷,具有较高的利用价值.     

PAPR reduction of an OFDM signal by use of PTS with low computational complexity

One of the major drawbacks of orthogonal frequency division multiplexing (OFDM) is the high peak-to-average power ratio (PAPR) of the transmitted OFDM signal. Partial transmit sequence (PTS) technique can improve the PAPR statistics of an OFDM signal. However optimum PTS (OPTS) technique requires an exhaustive search over all combinations of allowed phase factors, the search complexity increases exponentially with the number of sub-blocks. By combining sub-optimal PTS with a preset threshold, a novel reduced complexity PTS (RC-PTS) technique is presented to decrease the computational complexity. Numerical results show that the proposed approach can achieve better performance with lower computational complexity when compared to that of other PTS approaches.     

Novel Low-Complexity Partial Transmit Sequences Scheme for PAPR Reduction in OFDM Systems Using Adaptive Differential Evolution Algorithm

A low-complexity partial transmit sequence (PTS) technique for reducing the peak-to-average power ratio (PAPR) of an orthogonal frequency division multiplexing signal is presented. However, the conventional PTS scheme requires an exhaustive searching over all combinations of allowed phase factors. Consequently, the computational complexity increases exponentially with the number of the subblocks. This paper presents a novel approach to the PAPR problem to reduce computational complexity based on the relationship between phase weighing factors and transmitted bit vectors. In this paper, we aim to obtain the desirable PAPR reduction with the low computational complexity. Since the process of searching the optimal phase factors can be categorized as combinatorial optimization with some variables and constraints, we propose a novel scheme, which is based on a stochastic optimization technique called modified differential evolution, to search the optimal combination of phase factors with low complexity. To validate the analytical results, extensive simulations have been conducted, showing that the proposed schemes can achieve significant reduction in computational complexity while keeping good PAPR reduction.     

A novel search method to reduce PAPR of an OFDM signal using partial transmit sequences

One of the main drawbacks of orthogonal frequency division multiplexing (OFDM) is the high peak‐to‐average power ratio (PAPR) of the transmitted OFDM signal. Partial transmit sequence (PTS) technique can improve the PAPR statistics of an OFDM signal. As ordinary PTS technique requires an exhaustive search over all combinations of allowed phase factors, the search complexity increases exponentially with the number of sub‐blocks. In this paper, we propose a novel PTS technique with reduced complexity that each level inverts twice of phase factor bits from previous level. Then we also use initial random phase sequence to find the better search way of PAPR reduction. Numerical results show that the proposed method can achieve significant reduction in search complexity with little performance degradation. Copyright © 2006 John Wiley & Sons, Ltd.     

A Computationally Efficient Tree-PTS Technique for PAPR Reduction of OFDM Signals

The high peak-to-average power ratio (PAPR) of time domain signals has been a major problem in orthogonal frequency division multiplexing (OFDM) systems, and thus various PAPR reduction algorithms have been introduced. Partial transmit sequence (PTS) is one of the most attractive solutions because of its good performance without distortion. However, it is considered as an impractical solution for the realization of high-speed data transmission systems due to its high computational complexity. In this paper, a novel PAPR reduction algorithm based on a tree-structured searching technique is proposed to reduce the PAPR with low complexity. In the proposed scheme, the computational complexity of searching process is decreased by adjusting the size of tree with two parameters, width and depth, while preserving good performance. The simulation results show that proposed scheme provides similar performance with optimum case with remarkably reduced computational complexity.     

PAPR Reduction in VLC-OFDM System Using a Combination of Shuffled Frog Leaping Algorithm and Hill-Climbing Algorithm

Orthogonal frequency division multiplexing (OFDM) technique has been widely used in visible light communications (VLC) system (VLC-OFDM). To minimize the performance degradation of VLC-OFDM system caused by high peak-to-average power ratio (PAPR), we propose a SFLAHC-PTS technique to reduce the PAPR of signal in this paper. The proposed SFLAHC-PTS is an improved PTS technique which takes advantages of shuffled frog leaping algorithm and hill-climbing algorithm to optimize conventional PTS technique, reducing the computational complexity of conventional PTS technique. We compare SFLAHC-PTS technique with other PTS techniques on the CCDF performance, as well as computational amount to analyze the superiority of SFLAHC-PTS technique. The results show that the proposed technique can greatly reduce the computational load of conventional PTS technique and has better performance in reducing PAPR than GA-PTS, SFLA-PTS technique.

     

Optimization of Peak to Average Power Reduction in OFDM

Orthogonal frequency division multiplexing (OFDM) a multicarrier system [1, 2] provides base for all advanced wireless communication system. The performance of OFDM is degraded by peak-to-averagepower ratio (PAPR). High PAPR requires high power amplifiers (HPAs). The nonlinearity of the HPA exhibits amplitude and section distortions, that cause loss of orthogonality among the subcarriers, and hence, intercarrier interference (ICI) is introduced inside the transmitted signal. Not only that, high PAPR put together lands up in in-band distortion and out-of-band radiation. Rather than using HPA’s, the only way to improve performance of OFDM system is to reduce PAPR. The PAPR reduction of OFDM system gives fair reduction in PAPR under partial transmits sequence (PTS) and DCT-SLM techniques. Here in this paper we proposed a combination of PTS and DCT-SLM and an algorithm to cut back the PAPR. This hybrid combined technique reduces PAPR effectively and minimizes the complexity of PTS technique.     

A new PTS OFDM scheme with low complexity for PAPR reduction

In this paper, we introduce a new partial transmit sequence (PTS) orthogonal frequency division multiplexing (OFDM) scheme with low computational complexity. In the proposed scheme, 2/sup n/-point inverse fast Fourier transform (IFFT) is divided into two parts. An input symbol sequence is partially transformed using the first l stages of IFFT into an intermediate signal sequence and the intermediate signal sequence is partitioned into a number of intermediate signal subsequences. Then, the remaining n-l stages of IFFT are applied to each of the intermediate signal subsequences and the resulting signal subsequences are summed after being multiplied by each member of a set of W rotating vectors to yield W distinct OFDM signal sequences. The one with the lowest peak to average power ratio (PAPR) among these OFDM signal sequences is selected for transmission. The new PTS OFDM scheme reduces the computational complexity while it shows almost the same performance of PAPR reduction as that of the conventional PTS OFDM scheme.     

An efficient sphere decoding approach for PTS assisted PAPR reduction of OFDM signals

It is well known that one of the main drawbacks of orthogonal frequency division multiplexing (OFDM) is the potentially high peak-to-average power ratio (PAPR) of the (OFDM) signal. Partial transmit sequence (PTS) is a widely accepted method in reducing PAPR of OFDM signal. As traditional optimal PTS (OPTS) technique requires an exhaustive search over all the combinations of the allowed phase factors the search complexity increases exponentially with the number of sub-blocks. In this paper, a new precalculated radius sphere decoding (PRSD) is presented. It can achieve the same PAPR performance but at lower computational complexity compared with OPTS and existing sphere decoding (SD) approach at zero decoding failure rate.     

Improving PAPR performance of filtered OFDM for 5G communications using PTS

The filtered orthogonal frequency division multiplexing (F-OFDM) system has been recommended as a waveform candidate for fifth-generation (5G) communications. The suppression of out-of-band emission (OOBE) and asynchronous transmission are the distinctive features of the filtering-based waveform frameworks. Meanwhile, the high peak-to-average power ratio (PAPR) is still a challenge for the new waveform candidates. Partial transmit sequence (PTS) is an effective technique for mitigating the trend of high PAPR in multicarrier systems. In this study, the PTS technique is employed to reduce the high PAPR value of an F-OFDM system. Then, this system is compared with the OFDM system. In addition, the other related parameters such as frequency localization, bit error rate (BER), and computational complexity are evaluated and analyzed for both systems with and without PTS. The simulation results indicate that the F-OFDM based on PTS achieves higher levels of PAPR, BER, and OOBE performances compared with OFDM. Moreover, the BER performance of F-OFDM is uninfluenced by the use of the PTS technique.     

OFDM系统中基于迭代和门限理论降低PAPR的改进PTS方法

传统的部分传输序列法（PTS）中,如果要得到最佳的相位旋转因子,需要遍历所有的可选相位,这样的计算量随分割的子序列数按指数增长。本文提出两种减少计算复杂度的改进PTS方法（经迭代的IPTS和经门限的IPTS）。这两种方法都利用快速傅立叶变换（FFT）的时域循环移位特性增加备选信号,改善PAPR降低的性能。首先提出了一种利用反复迭代移位的IPTS方法(经迭代的IPTS),该方法的计算量随子序列数按线性增长。接着提出了一种利用预先设定的门限值以降低计算复杂度的IPTS方法(经门限的IPTS)。最后理论分析、比较了PTS、PTS/CSS方法与本文方法的计算复杂度。Matlab软件仿真显示,当使用相同的分割子序列数和相位旋转因子时,两种IPTS方法能够以较小的运算量达到了PTS/CSS方法性能;两种IPTS方法降低PAPR的性能要优于PTS方法,但计算复杂度并没有增加。      

A hybrid technique for the PAPR reduction of NOMA waveform

Non-orthogonal multiple access (NOMA) is a great contender for future cellular modulation due to its desirable properties like massive connectivity, high data rate transmission, and high spectral efficiency. However, its peak-to-average power ratio (PAPR) is significant, which becomes a significant disadvantage for the efficient operability of the NOMA waveform compared to current techniques. Several PAPR reduction algorithms like selective mapping (SLM), partial transmission sequence (PTS), and companding techniques have been proposed to lower the PAPR of multicarrier waveforms (MCWs). PTS reduces the PAPR but has high complexity. On the other hand, SLM has a less complex framework, but its PAPR performance is not as efficient as PTS. Companding methods reduce the PAPR by compressing the signals at the transmitter, which unfortunately reduces the dynamic range of the signal. In this work, we propose a hybrid algorithm (SLM + PTS) with a companding method for the first time for the NOMA waveform, which efficiently reduces the PAPR with low computational complexity. Furthermore, we compare the performances of a host of candidate algorithms like SLM, PTS, hybrid (SLM + PTS), hybrid + A law (SLM–PTS–A law), and hybrid + Mu law (SLM–PTS–Mu law). The results of the experiments show that the hybrid + Mu law did a better job than the existing PAPR reduction algorithms.     

Dual symbol optimization‐based partial transmit sequence technique for PAPR reduction in WOLA‐OFDM waveform

Weighted overlap and add‐orthogonal frequency division multiplexing (WOLA‐OFDM) is a new waveform proposed recently for meeting the requirements of fifth generation (5G) telecommunication standards. In spite of being a serious 5G waveform candidate, WOLA‐OFDM is exposed to the problem of high peak to average power ratio (PAPR) similar to the other waveforms in which multicarrier transmission strategy is employed. Due to the overlapping nature of WOLA‐OFDM waveform, where the extension of the current symbol is overlapped with the extension of the previous symbol, it will not be efficient to apply conventional PTS (C‐PTS) directly to the WOLA‐OFDM waveform. Therefore, in this paper, we propose dual symbol optimization‐based partial transmit sequence (DSO‐PTS) technique for PAPR reduction in WOLA‐OFDM waveform. In our proposed technique, two adjacent symbols are jointly considered when searching for the optimal data block with minimum PAPR unlike the C‐PTS where the adjacent symbols are optimized individually. In the simulations, our proposed DSO‐PTS technique, C‐PTS, and GreenOFDM that is developed recently by modifying the conventional selective mapping (SLM) method are compared with each other with regard to PAPR reduction performance for different search numbers (SNs). In addition, the effects of DSO‐PTS, C‐PTS, and GreenOFDM on the amount of out of band (OOB) radiation in the power spectral density (PSD) graph of WOLA‐OFDM employing solid state power amplifier (SSPA) is measured for different SNs and input back off (IBO) values. According to the simulation results, our proposed DSO‐PTS technique clearly demonstrates a superior PAPR reduction and PSD performance.     

PAPR Reduction of OFDM Signals Using Partial Transmit Sequences With Low Computational Complexity

Partial transmit sequences (PTS) is one of the attractive techniques to reduce the peak-to-average power ratio (PAPR) in orthogonal frequency division multiplexing (OFDM) system. As conventional PTS technique requires an exhaustive searching over all the combinations of the given phase factors, which results in the computational complexity increases exponentially with the number of the sub-blocks. In this paper, we aim to obtain the desirable PAPR reduction with the low computational complexity. Since the process of searching the optimal phase factors can be categorized as combinatorial optimization with some variables and constraints, we propose a novel scheme, which is based on a nonlinear optimization approach named as simulated annealing (SA), to search the optimal combination of phase factors with low complexity. To validate the analytical results, extensive simulations have been conducted, showing that the proposed schemes can achieve significant reduction in computational complexity while keeping good PAPR reduction.     

一种改进的PTS算法降低OFDM峰均比研究

部分传输序列(PTS)算法能够有效地降低OFDM通信系统的平均峰值功率比(PA-PR)。文中研究了哈达码矩阵及传统的μ率压缩算法,提出了一种新的能够有效的降低PAPR算法。提出的算法是基于传统的PTS算法,利用哈达码矩阵优化部分传输序列,结合μ率压缩算法进而降低OFDM系统的PAPR值。通过实验仿真证明,文中提出的算法能够降低OFDM系统的PAPR值,而且性能更加优越于单独的μ率压缩以及传统的PTS算法,具有良好的峰值平均功率比性能。     

OFDM系统中一种联合改进的低复杂度SLM峰均比抑制技术

高的峰值平均功率比(Peak-to-Average Power Ratio,PAPR)是光正交频分复用(Optical Orthogonal Frequency Division Multiplexing,O-OFDM)系统的一个主要缺点,选择性映射(Selective Mapping,SLM)法能有效降低高PAPR出现的概率,但它的计算复杂度较高.一些低复杂度的SLM方案能够有效地降低复杂度,但同时也降低了PAPR的抑制性能.为了平衡这两个因素,将低复杂度SLM方案与次优选择的思想相结合,文章提出了一种联合改进的PAPR抑制方案.在低复杂度方案中,通过将一个复频域信号分为两个实信号,再利用快速傅里叶变换(Fast Fourier Transform,FFT)的平移和反折性质将其重建成新的信号,以得到更多的备选信号,如此便能降低计算复杂度.然后,再结合次优选择的思想,选择PAPR最小的一路以得到最优的PAPR抑制性能.仿真结果验证了该方案的有效性.     

Reduction of the PAPR in OFDM Systems by Intelligently Applying Both PTS and SLM Algorithms

The orthogonal frequency division multiplex (OFDM) technique, which is used in the 4G communications, has a shortcoming of having a high peak to average power ratio (PAPR), and thus a lot of research has been conducted to reduce the PAPR in OFDM systems. The typical algorithms in this research area are the multi-time clipping algorithm, the \(\mu \)-law compression algorithm, SLM algorithm, PTS algorithm, and Golay complement sequence algorithm. It is found in this paper that the SLM and PTS algorithms have good performance in reducing the PAPR while having less information overhead than the Golay complement sequence algorithm, less distortion than the \({\mu }\)-law compression algorithm, and less BER than the clipping algorithm. Thus, a new PAPR reduction algorithm is proposed, which tries to intelligently apply both PTS and SLM algorithm, while utilizing their complementary advantages and avoiding their disadvantages. According to simulation results, the performance of the proposed algorithm has much better performance in reducing the PAPR than the SLM and PTS algorithms, with comparable computational complexity, BER performance, and information overhead.