降低PTS方法复杂度的原理及应用

传统的降低OFDM信号峰均比值的部分传输序列(PTS)方法需计算全部相位旋转因子序列所对应的峰均比值,因而计算复杂度很大.该文分析了OFDM信号峰值出现的规律,提出了搜索合乎需求的相位旋转因子序列的一般性原则,并在此基础上提出了一种全新的降低PTS方法复杂度的方案.理论分析和仿真结果表明,该方法在大幅降低系统复杂度的同时,性能损失较少.     

基于多层循环搜索的部分传输序列算法

高峰均功率比是OFDM(Orthogonal Frequency Division Multiplexing)信号的主要缺点之一,峰均比过高会加重OFDM系统的非线性失真.部分传输序列算法(Partial Transmit Sequences,PTS)是有效降低OFDM信号峰均功率比的传统算法.该算法由于采用穷尽式搜索方式搜索最优相位因子组合,因此具有较高的计算复杂度,并且随着子数据块分组数的增加部分传输序列算法计算量呈指数形式上升,很难在实际的通信系统中得到应用.本文提出了一种具有较低计算复杂度的多层循环部分传输序列算法( Multi-Loop PTS),该算法通过对相位因子进行多层循环计算比较,舍去了部分冗余计算,且避免了相位因子搜索陷入局部最优点,在保证算法性能的同时降低了算法复杂度.并且通过仿真分析证明了本文提出的MLPTS算法能够较好的权衡PAPR性能和计算复杂度之间的关系.     

一种基于PTS技术降低OFDM系统峰均比的改进算法

该文在研究部分传输序列(PTS)技术降低OFDM系统峰均功率比(PAPR)的基础上,提出了多级寻优的改进PTS方法。该方法通过增加寻优的级数,而减少每级优化所预设的相位集合中的元素个数来寻找最优相位旋转因子,从而改变传统PTS技术中的计算量随分割子序列数和待选相位集合元素的个数的增加而呈指数增长的趋势,并使该方法与次优搜索方法相结合。通过计算复杂度的分析和仿真结果表明,同传统的方法相比,该方法不仅能较大地降低计算复杂度,且能改善降低峰均功率比的性能。     

OFDM系统中峰均比降低的次优化循环移位序列方法

部分传输序列（PTS）方法需遍历所有的可选相位因子,这样的计算量随分割子序列数按指数增长。本文在对循环移位PTS方法 (PTS/CSS) 和次优PTS方法 (sub-OPTS) 进行研究的基础上,提出了一种减少计算复杂度的次优化时域循环移位序列方法（sub-OPTS/CSS）。该方法用快速傅立叶变换（FFT）的时域循环移位特性增加更多备选信号;且仅对变换后的部分备选信号进行相位优化。同时,将其与已有的一些方法的备选信号、冗余比特数、运算量进行了分析和比较。理论分析和仿真结果表明,当使用相同的分割子序列数和相位旋转因子时,sub-OPTS/CSS方法降低PAPR的性能稍次于PTS/CSS方法,但搜索最佳相位时的计算量减少了一半;sub-OPTS/CSS方法降低PAPR的性能要优于sub-OPTS方法。      

滤波器组多载波系统中基于双层优化的峰均比抑制算法

针对部分传输序列(PTS)算法在交错正交幅度调制的滤波器组多载波(FBMC-OQAM)系统中受符号重叠的影响,造成峰值再生,从而导致系统峰值功率比(PAPR)较高、计算复杂度较大等问题,该文提出一种基于双层优化的PTS算法(DO-PTS).该算法对信号数据块进行两层相位因子搜索以获得更好的PAPR抑制性能,第1层充分考虑重叠特性,结合前面重叠数据块进行初步优化,第2层对数据块进行分组,在每组选择对峰值影响最大的数据块进行优化,来减少进行相位因子搜索的数据块数量,并且在第1层优化中缩小相位因子的搜索范围,以降低系统的计算复杂度.通过对计算复杂度和仿真结果的分析表明,同其它主流PTS优化算法相比,所提算法不仅能取得很好的PAPR抑制性能,还具有较低的计算复杂度,同时也保证了系统的传输数据率.     

滤波器组多载波系统中基于双层优化的峰均比抑制算法

针对部分传输序列(PTS)算法在交错正交幅度调制的滤波器组多载波(FBMC-OQAM)系统中受符号重叠的影响,造成峰值再生,从而导致系统峰值功率比(PAPR)较高、计算复杂度较大等问题,该文提出一种基于双层优化的PTS算法(DO-PTS)。该算法对信号数据块进行两层相位因子搜索以获得更好的PAPR抑制性能,第1层充分考虑重叠特性,结合前面重叠数据块进行初步优化,第2层对数据块进行分组,在每组选择对峰值影响最大的数据块进行优化,来减少进行相位因子搜索的数据块数量,并且在第1层优化中缩小相位因子的搜索范围,以降低系统的计算复杂度。通过对计算复杂度和仿真结果的分析表明,同其它主流PTS优化算法相比,所提算法不仅能取得很好的 PAPR抑制性能,还具有较低的计算复杂度,同时也保证了系统的传输数据率。     

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

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

降低OFDM系统峰均功率比的低计算复杂度PTS方法

针对传统PTS方法计算复杂度大的缺点,提出了一种新的低计算复杂度PTS(LCC-PTS)方法.该方法利用相位加权序列之间的关系,简化了产生部分候选序列的运算过程,从而达到降低计算复杂度的目的.性能分析结果表明,与传统PTS方法相比,LCC-PTS方法在太大降低计算复杂度的同时,系统的PAPR性能完全没有损失.     

基于PTS抑制OFDM系统PAPR低复杂度算法

为降低基于部分传输序列法(PTS)的峰均功率比(PAPR)抑制技术的复杂度,文中研究了OFDM时域信号最大峰值点的位置与采用部分传输序列法后最大峰值点位置之间的关联性,提出了一种寻找最优相位因子序列的简化算法,该算法用抽样序列代替原始序列进行搜索。由于新算法采用的样点数目少于原始样点数目,因此可以大幅降低PTS处理过程的计算复杂度。仿真结果表明,新算法采用的数据量只有原始数据的50%,而性能仅仅损失0.2~1 dB。     

抑制OFDM信号峰均比的PTS算法分析与优化

部分传输序列（PTS）方法作为降低高峰均功率比（PAPR）信号的有效方法,因具有较高的计算复杂度而限制了其应用,也因此演化出许多的改进PTS算法。文中对包括IPTS、滑动窗搜索PTS、子块联合分割PTS、Had-amard-PTS、m序列-PTS和pso-PTS等在内的多种PTS演化算法作了研究与仿真,分析比较各种方法...     

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.     

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.     

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.     

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.     

基于随机分割的PTS改进算法研究

正交频分复用（OFDM）系统的一个主要缺点是信号的峰均功率比（PAPR）很高。提出了一种将随机分割方法与迭代移位搜索加权因子相结合的改进PTS算法。仿真结果表明,改进后的算法在改善PAPR性能和计算的复杂度之间取得了较好的折衷。     

Improved phase factor computation for the PAR reduction of an OFDMsignal using PTS

The peak-to-average power ratio (PAR) of an orthogonal frequency-division multiplexing (OFDM) signal can be substantially larger than that of a single carrier system. Partial transmit sequence (PTS) combining can improve the PAR statistics of an OFDM signal. As PTS requires an exhaustive search over all combinations of allowed phase factors, the search complexity increases exponentially with the number of subblocks. In this letter, we present a new algorithm for computing the phase factors that achieves better performance than the exhaustive search approach     

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.