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

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

FrFT-OFDM系统的低复杂度峰均功率比抑制技术研究

针对基于分数阶Fourier变换的OFDM系统(简称FrFT-OFDM系统)的高峰均功率比(PAPR)问题,该文提出一种低复杂度的峰均比抑制算法。通过对随机相位序列采用周期延拓至FrFT-OFDM符号长度,相位因子加权后与子载波调制前的数据相乘的方式,实现对高峰均比的有效抑制。该算法只需要一次逆离散分数阶Fourier变换(IDFrFT),所有备选信号直接通过时域chirp圆周移位的加权和得到。仿真结果表明,当备选信号个数相同时,该算法与选择映射(SeLecting Mapping, SLM)算法的PAPR抑制性能相当,比部分传输序列(Partial Transmit Sequence, PTS)算法具有更好的PAPR抑制性能,同时,该算法较SLM和PTS算法的运算量降低。     

一种OFDM系统峰均比的改良PTS算法

部分传输序列（PTS）方法通过选择合适的相位序列以降低信号峰值出现的概率，该方法不会使信号发生畸变。但是传统的PTS技术计算复杂度非常大，需遍历所有可选的相位因子，其计算量随分割子序列数按指数增长。本文提出了一种正倒二叉树多层相位序列方法，该方法通过对称的树形搜索，搜索出最优的相位序列。仿真结果表明，该方法大大降低系统的复杂度．同时PAPR得到更好地抑制。     

抑制OFDM系统PAPR的PTS算法改进

部分传输序列（PTS）是一种降低OFDM信号的峰值平均功率比（PAPR）的有效方法。PTS采用是在子序列中添加旋转相位因子[0，21π）。通过对OFDM信号相位分布情况进行研究，本文提出一种改进的PTS方法。改进点在其相位旋转因子的选择上，采用每个子块乘以非均匀分布的旋转因子。     

利用导频降低峰均值比算法的研究

在正交频分复用(OFDM)系统中,部分传输序列(PTS)方法是降低峰均功率比(PAPR)最有效的方法之一。与常规的部分传输序列(C-PTS)相比,导频序列的插入可以更好地降低PAPR。采用带有循环移位的导频信号,首先将导频信号和数据信号分别分割成子块,然后将导频子序列分别插入到数据子块中,通过反馈及循环移位产生更多的待选序列,更好的降低PAPR。仿真结果表明所提方法可以有效降低PAPR,且其误码率(BER)性能与C-PTS相当。     

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

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

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

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

次随机分块PTS-Clipping峰均比抑制算法

针对正交频分复用信号存在高峰均比问题,本文提出了一种基于次随机分块的部分传输序列(partial transmit se-quence,PTS)与传统限幅剪切联合处理的峰均比抑制算法.该算法在时域得到随机分块的子块序列,子块序列乘以相位旋转因子得到多个备选序列,从多个备选序列中寻找低峰值OFDM信号,最后利用频域滤波剪切算法限幅.仿真结果表明,所提算法在低复杂度下可以有效降低PAPR.     

一种降低OFDM信号PAPR的改进PTS方法

正交频分复用(OFDM)系统的一个主要缺点是信号的峰值功率与平均功率比(PAPR)很高。本文研究了利用信号扰码技术降低OFDM系统峰均比的一种典型算法:部分传输序列法(PTS),提出了一种将随机分割方法、交织分割方法与迭代移位搜索加权因子相结合的改进PTS算法。仿真结果表明,改进后的算法在改善PAPR性能和计算的复杂度之间取得了较好的折衷。     

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

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

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.     

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.     

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.     

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.     

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     

降低OFDM系统中PAPR的次优化PTS算法

正交频分复用(OFDM)系统的主要缺点是峰均功率比(PAPR)增大会严重地降低了发射机中高功率放大器(HPA)的效率.部分传输序列(PTS)算法能有效地降低OFDM信号的PAPR概率,但随着PTS中分割子块的增多也带来了高的计算复杂度.为此,文中提出一种新的PTS算法,该算法比传统的穷尽搜寻法具有更佳的性能.仿真结果表明,文中所提PTS算法在降低PAPR相似的情况下,具有更小的计算复杂度.     

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.     

Conjugate Interleaved Partitioning PTS Scheme for PAPR Reduction of OFDM Signals

The interleaved partitioning partial transmit sequence (IP-PTS) scheme is an attractive technique for peak-to-average power ratio (PAPR) reduction in orthogonal frequency division multiplexing (OFDM) systems. But the PAPR performance of IP-PTS is inferior to that of the adjacent partitioning PTS (AP-PTS) scheme because the candidates generated in IP-PTS are not fully independent. This paper analyzes the independence of candidates in IP-PTS in detail and finds the effective phase factor vectors. In order to improve the PAPR performance of IP-PTS, a conjugate IP-PTS (C-IP-PTS) scheme is proposed. By performing the conjugate operations on some sub-blocks, the number of candidates is increased. Because of the conjugate property of the discrete Fourier transform (DFT), the additional inverse DFT can be avoided. By optimizing the conjugate sequence, the complexity can be further lowered. Simulation results show that C-IP-PTS can obtain better PAPR performance compared with AP-PTS; moreover, the computational complexity of C-IP-PTS is not high.