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

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

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.     

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系统峰平比降低技术

对于无线通信系统而言,OFDM是一种非常有吸引力的传输技术,但是OFDM信号具有较高的峰平比特性.为了减小信号峰平比,本文利用部分传输序列PTS技术,提出了一种适用于基于频域导频OFDM系统的峰平比降低实现方案,给出了其实现算法及系统控制策略;并利用计算机仿真对该系统的峰平比和误码率性能进行了分析,仿真结果表明:PTS技术可以有效地改善OFDM信号的高峰平比特性.本方案采用FPGA实现其相应的硬件电路,经过实际的OFDM系统样机传输测试,证明了所提方法的实用性及其良好的性能.     

OFDM系统中一种新的分块迭代的部分传输序列算法

该文提出了一种新的基于分块迭代(BI)和自适应分块迭代(ABI)的部分传输序列算法,能够有效地降低正交频分复用(OFDM)系统的峰均功率比(PAPR),与原始部分传输序列(OPTS)和Iterative Flipping(IF)算法相比,该算法能够获取更好的性能与复杂度的折衷,并且该算法可以看作OPTS和IF算法的一般化形式。     

SFBC MIMO-OFDM peak-to-average power ratio reduction by polyphase interleaving and inversion

Many PAPR reduction schemes have been proposed for OFDM systems. Among these, the signal scrambling methods such as the partial transmit sequences (PTS) (S. H. Muller, et al., 1997) and selective mapping (SLM) (R. W. Bauml, et al., 1996) are attractive as they obtain better PAPR property by modifying OFDM signals without distortion. These schemes can also be applied to a SFBC MIMO-OFDM system, which is advantageous for dispersive channels, in a straightforward way by performing signal scrambling on data sequence before it is distributed to the transmit antennas according to employed encoding scheme. Note however that in the case of PTS PAPR reduction in the time domain is not possible, which leads to prohibitively large complexity of such scheme. In this letter, we introduce more effective approach, the polyphase interleaving and inversion (PII) PAPR scheme and its reduced complexity version (RC-PII), which is designed to suppress peaks in SFBC-OFDM, transmit diversity.     

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.     

一种基于OPTS的降低OFDM峰均比的低复杂度算法

正交频分技术最主要缺点之一就是传输信号的高峰均值功率比,部分传输序列法是解决高峰均值功率比的最有效方法之一。虽然最优部分传输序列方法性能很好,但其计算复杂度非常大,搜索复杂度随着子块数指数增加,这样降低搜索复杂度显得尤为重要。本文改进TOPTS搜索过程中计算时域矢量的计算方法,使其计算复杂度大大降低,但系统性能不受影响。     

A novel subblock partition scheme for partial transmit sequenceOFDM

In general, there has been a trade-off between performance of peak-to-average power ratio (PAPR) reduction and computational complexity in partial transmit sequence (PTS) orthogonal frequency division multiplexing (OFDM). In this paper, a novel subblock partition scheme (SPS) for PTS OFDM is proposed and analyzed. In this scheme, signals assigned randomly in partial subbands are duplicated and concatenated repetitively to generate each subblock. The proposed scheme, therefore, has a form of concatenation of pseudo-random and interleaved SPS. As results of simulations, the proposed scheme shows almost same PAPR reduction performance as compared to the conventional pseudo-random SPS which has been known to have the best performance. However, computational complexity can be reduced extensively. Hence, the proposed scheme may be considered to be more suitable than the conventional ones for application in high speed transmission systems such as digital terrestrial broadcasting     

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

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

PTS with Non-Uniform Phase Factors for PAPR Reduction in OFDM Systems

Partial transmit sequence (PTS) is one of the effective and uncomplicated PAPR reduction methods for OFDM systems. The phase factors applied in the weighting sequences are assumed to be uniformly distributed within [0, 2pi). By carefully investigating the phase distribution of OFDM signals, we proposed a modified PTS scheme outperforming the conventional PTS scheme in PAPR reduction performance. The process of the proposed scheme is the same as the conventional PTS, except for applying the new non-uniform phase factors. The required side information is the same as the conventional PTS applying uniform phase factors.     

一种降低OFDM信号峰均比的低复杂度双层搜索算法

在OFDM峰均比抑制技术中,采用传统的PTS算法得到的相位旋转因子随着长度的增加,存在搜索代价过高的问题,从而影响了系统的性能。为有效降低系统的峰均比,同时避免过多的搜索代价,设计了一种新的峰均比抑制算法。与传统算法相比较,该算法将汉明距离的概念应用到传统双层搜索算法中,针对不同的相位旋转因子长度,在每一层进行不同策略的搜索,得到不同的改进方案。仿真结果表明,在搜索次数相近的情况下,该算法相较传统算法能将峰均比在原有基础上再降低0.1 dB左右,而且随着相位旋转因子长度的增加,效果更加明显。同时,该算法在系统性能与搜索次数上的平衡相对传统算法也更为灵活。     

A Low-Complexity PTS-Based Radix FFT Method for PAPR Reduction in OFDM Systems

A low-complexity partial transmit sequence (PTS) technique for reducing the peak-to-average power ratio (PAPR) of an orthogonal frequency division multiplexing (OFDM) signal is presented. Signals at the middle stages of an -point radix FFT using decimation in frequency (DIF) or decimation in time (DIT) are considered for PTS subblocking. We show that DIF has a lower multiplicative complexity than DIT for similar PAPR reduction. A higher radix based FFT achieves better PAPR reduction per stage with less multiplicative complexity compared with a lower radix FFT. We further reduce the computational complexity by proposing a new technique, called decomposition PTS (D-PTS) subblocking, where subblocks are assigned through different stages of the transform. This new technique reduces the multiplicative complexity, while providing PAPR reduction similar to other techniques such as original PTS (O-PTS). Moreover, it has lower additive complexity.     

有效传输边带信息的低计算复杂度PTS方法

在传统的PTS方法中,计算复杂度高,需要传送边带信息,而直接将边带信息插入到优化后的OFDM符号中会再次提高PAPR。针对传统PTS方法的这些缺点,提出新的PTS方法。在新的PTS方法中,边带信息根据采样点相位进行取值,能够降低计算复杂度,每一帧的最后一个子载波用来传输前一帧的边带信息,从而达到不增加OFDM信号PAPR的目的。仿真分析表明,相对于传统PTS方法,既能够降低计算复杂度,又能够在不增加PAPR的前提下传输边带信息。     

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

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

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.     

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

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

OFDM系统中降低峰均功率比算法的研究

正交频分复用(Orthogonal Frequency Division Multiplexing,OFDM)系统中,峰均功率比(Peak to AveragePower Ratio,PAPR)过高会导致收发器的非线性失真,严重影响系统的性能。传统的部分传输序列(Partial TransmitSequence,PTS)算法能够有效地降低PAPR,然而其计算复杂度随着分块数目增长呈指数增加。在研究PTS的基础上提出了双重迭代PTS算法,该算法利用增加迭代次数,并且每次迭代时选择不同的相位旋转因子集合来优化OFDM系统的峰均比性能。该算法在峰均比性能上优于常规OFDM系统以及普通迭代PTS算法,在降低峰均比性能和计算复杂度之间取得了较好的折衷。     

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.     

降低OFDM系统峰平比的改进PTS技术研究

正交频分复用(OFDM)技术被认为是第四代移动通信系统的核心技术之一,但是该系统中的高峰平比(PAPR)问题一直是将该技术实用化的一大障碍。本文研究了利用信号扰码技术降低OFDM系统峰平比的一种典型算法:部分传输序列法(PTS),指出其适用的场合,提出了一种将随机分割子序列与迭代移位搜索加权因子相结合的改进PTS算法。仿真结果表明:改进后的算法在改善PAPR性能和计算的复杂度之间取得了很好的折衷。