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

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

基于DHT和PTS的光OFDM系统PAPR抑制算法

提出了一种基于离散哈特利变换(DHT)和部分传送序列(PTS)的PAPR抑制算法。在每个子块中,通过利用快速哈特利逆变换(IFHT)代替传统的快速傅里叶逆变换(IFFT),并结合非对称限幅技术,对子载波信号进行调制。该方法 PAPR抑制效果好,且不需要Hermitian对称,运算复杂度低。     

正交频分复用随钻无线传输系统及其SLM算法

目前随钻测井信号无法实现高速传输,现有的井下泥浆脉冲传输技术传输速率较慢.本文提出了一种正交频分复用(OFDM)随钻无线传输系统可以实现高效的井下数据传输.但该系统存在其发射信号中固有的高峰均功率比(PAPR)问题.本文基于OFDM随钻无线传输系统,提出了一种分级的基-4 IFFT改进SLM算法降低其PAPR.该算法将N=4n点的基-4 IFFT运算 分为前k级和后n-k级的蝶形运算,信号在两级IFFT之间乘以相位序列.理论分析表明:该法较传统SLM算法IFFT复杂度可降低近60%.     

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

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

光OFDM系统中一种联合改进的LC-SLM峰均比抑制技术

由于光正交频分复用(O-OFDM)系统中的峰值平均功率比(PAPR)较高,针对传统的选择性映射(C-SLM)方案计算复杂度较高,而一些低复杂度SLM(LC-SLM)方案的峰均比抑制性能不佳的问题,为了在降低计算复杂度的同时兼顾PAPR的抑制性能,提出一种基于LC-SLM方案和Clipping技术联合改进的PAPR抑制方案。在低复杂度方案中,O-OFDM信号的实部和虚部被分开处理以期获得更多的备选信号,再结合Clipping技术把信号限定在门限值范围内,最后再选择PAPR最小的一路信号从而得到最优的PAPR抑制性能。仿真结果表明该方案具有较好的优越性以及较高的利用价值。     

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

针对部分传输序列(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抑制性能,还具有较低的计算复杂度,同时也保证了系统的传输数据率。     

用后置IFFT幅度随机选择器降低OFDM的PAPR

OFDM和DMT多载波传输系统固有的高峰均功率比(PAPR)能导致功率传输效率的严重退化,特别是用电池作为电源的终端更为严重.目前文献中最常用的PAPR减少技术是选择性映射(SLM)序列技术,它已经达到能把PAPR减少几dB的程度.尽管SLM技术对减少PAPR表现得不错,但是实际上,每个OFDM数据串进行传输的时候,它都需要进行多次的IFFT(快速傅里叶变换)运算,这就增加了的系统的复杂性.因此SLM方法有较长的计算时间和较高的功率消耗.建议了一种低复杂度的前置IFFT的PAPR减少方法,它在PAPR减少方面能比SLM方法做得更好,与此同时它的计算复杂度比SLM有较大的减小.     

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抑制性能.仿真结果验证了该方案的有效性.     

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

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

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.     

A Low Complexity Selected Mapping Scheme by Use of Time Domain Sequence Superposition Technique for PAPR Reduction in OFDM System

By using the time domain sequence superposition (TDSS) technique, in this paper, we propose a low complexity selected mapping (LC-SLM) scheme for the peak-to-average power ratio (PAPR) reduction of the orthogonal frequency division multiplexing (OFDM) system. Unlike the conventional selected mapping (SLM) scheme which needs several inverse fast Fourier transform (IFFT) operations for an OFDM signal, the proposed scheme requires to implement two IFFT operations only. Thus, it can remarkably reduce the computational complexity. Simulation results show that the proposed scheme can achieve similar PAPR performance as the conventional SLM scheme.      

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 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.     

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     

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.     

Low-complexity PAPR reduction technique for OFDM systems using modified widely linear SLM scheme

In this paper, a modified widely linear selective mapping (MWL-SLM) scheme is proposed to reduce the peak-to-average power ratio (PAPR) of the orthogonal frequency-division multiplexing (OFDM) systems. In the proposed MWL-SLM scheme, through partition one complex signals into two real signals and combining the linear properties of the Fourier Transform, at most 4M² candidate signals can be obtained but only require M inverse fast Fourier transform (IFFT) operations. As a result, the proposed SLM scheme has the ability to generate more candidates when compared with conventional SLM (C-SLM) and widely linear SLM (WL-SLM). Therefore, MWL-SLM outperforms C-SLM and WL-SLM for the same computational cost of IFFT operations. Alternatively, for a given number of candidates, MWL-SLM has slightly inferior PAPR reduction performance to C-SLM and WL-SLM but requires less IFFT operations to be implemented, thus resulting in a lower computational complexity. Simulation results demonstrate the effectiveness of the proposed scheme.     

Low-complexity selected mapping schemes for peak-to-average power ratio reduction in OFDM systems

Orthogonal frequency-division multiplexing (OFDM) is an attractive transmission technique for high-bit-rate communication systems. One major drawback of OFDM is the high peak-to-average power ratio (PAPR) of the transmitter's output signal. The selected mapping (SLM) approach provides good performance for PAPR reduction, but it requires a bank of inverse fast Fourier transforms (IFFTs) to generate a set of candidate transmission signals, and this requirement usually results in high computational complexity. In this paper, we propose a kind of low-complexity conversions to replace the IFFT blocks in the conventional SLM method. Based on the proposed conversions, we develop two novel SLM schemes with much lower complexity than the conventional one; the first method uses only one IFFT block to generate the set of candidate signals, while the second one uses two IFFT blocks. Computer simulation results show that, as compared to the conventional SLM scheme, the first proposed approach has slightly worse PAPR reduction performance and the second proposed one reaches almost the same PAPR reduction performance.