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

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

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.     

光OFDM系统中一种改进的SLM峰均比抑制方案

针对光正交频分复用(O-OFDM)系统中峰值平均功 率比(PAPR)较高的缺点,对PAPR抑制技术的选择性 映射法(SLM) 进行了深入研究。基于低复杂度SLM方案的深入研究,提出了一种改进的次PAP R选择的思 想与低复杂度SLM相结合的PAPR抑制方案。改 进的SLM方案能够成倍降低传统SLM方案的计算复杂 度。仿真分析表明,改进的SLM方案在载波数为256的O-OFDM系统中,计算复杂度能降低50%以上,并 且随着子载波数的增加,其复杂度降低程度更为高效;同时,该改进的SLM方案又能使其PAPR抑制性能优于传统的SLM方案,从而进一步提升了低复杂度SLM 方案的实用价值。     

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     

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.     

Performance Analysis of the Clipping Scheme with SLM Technique for PAPR Reduction of OFDM Signals in Fading Channels

Since one of major problems of OFDM-based systems is high peak-to-average-power ratio (PAPR) of its transmitted signal, many PAPR reduction techniques and combined schemes with individual techniques have recently been developed. Among various techniques, the clipping technique has been widely used as a practical scheme owing to its low computational complexity and simplicity in implementation, while the selected mapping (SLM) technique is known to provide good PAPR reduction performance without signal distortion. Generally, the combined scheme of two PAPR reduction techniques, which are the clipping and the SLM, is expected to provide the enhanced performance of PAPR reduction, because the clipping noise of combined scheme would be less than that of single clipping technique, when the SLM technique is employed before clipping. However, the performance of clipping scheme with SLM technique has not been evaluated for practical systems over fading channels. In this paper, the performance of the clipping scheme with the SLM technique is theoretically analyzed and compared with simulation results over fading channels. The performance of combined scheme is analyzed with various clipping ratios, phase sets for SLM, and modulation schemes over flat and frequency selective fading channels. In addition, the effects of the clipping at the receiver and the oversampling on the BER performance are discussed. Based on the results of analysis, therefore, one can design the effective clipping scheme with the SLM technique for the PAPR reduction of OFDM-based systems.     

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

Adaptive multiple stage K-best successive interference cancellation algorithm for MIMO detection

In this study, we propose a novel meta-heuristic optimization algorithm for joint peak-to-average power ratio (PAPR) reduction in orthogonal frequency division multiplexing (OFDM) systems. High PAPR not only complicates a distortion of a signal at the nonlinear high-power amplifier of a transmitter the design, but also in significant performance degradation. Tone injection (TI) scheme is a well-known PAPR reduction technique for OFDM systems. The key idea of the proposed method is a distortionless technique that can reduce PAPR significantly without data rate loss and does not require the extra side information. But unfortunately, in optimal TI-based OFDM systems, the PAPR reduction performance mainly requires an exhaustive search over all possible constellations, which is a hard optimization problem and potential problem for practical applications. To address this problem, an efficient scheme based on firefly algorithm is introduced to search over all combinations of possible permutations of the expanded constellation with low complexity and fast convergence. The simulation results reveal that our system can achieve good tradeoff between PAPR reduction performance and low computational complexity.     

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.     

Variable Interleaver Allocation for Downlink OFDM-IDMA

In this letter, a variable interleaver allocation scheme is proposed to alleviate the high peak-to-average power ratio (PAPR) of downlink OFDM-IDMA (orthogonal frequency division multiplexing-interleave division multiple access). The basic idea is to allocate multiple interleaving patterns for each user, so as to decide the best pattern with the lowest peak value. Furthermore, a variable interleaver design scheme is combined to generate multiple patterns from an original one. It is shown that the proposed scheme can achieve the theoretical bound of PAPR reduction performance, while making a good tradeoff among PAPR reduction, system performance and computational complexity.     

一种低复杂度的降低MIMO—OFDM峰平比的CARI方法

天线旋转取反算法(CARI)是降低MIMO-OFDM系统峰平功率比(PAPR)的一种性能较优的算法,不足之处是其迭代次数很大。CARI的次最优算法逐次次最优天线旋转取反(SS-CARI)算法虽然可以减小迭代次数,但性能损失又比较大。针对这一问题,提出了一种用滑动窗搜索旋转取反组合的次最优CARI方法,利用滑动窗搜索局部最优的旋转取反组合,既可以避免整体的遍历搜索大大减小CARI算法的计算复杂度,又可以改善SS-CARI的PAPR减小性能。仿真结果表明,该方法能够在系统复杂度与PAPR降低性能上取得很好的折衷。     

A computationally efficient selected mapping technique for reducing PAPR of OFDM

In orthogonal frequency division multiplexing (OFDM) system, high value of peak-to-average power ratio (PAPR) is an operational problem that may cause non-linear distortion resulting in high bit error rate. Selected mapping (SLM) is a well known technique that shows good PAPR reduction capability but inflicts added computational overhead. In this paper, using Riemann sequence based SLM method, we applied reverse searching technique to find out low PAPR yielding phase sequences with significant reduction in computational complexity. Additionally, we explored side-information free transmission that achieves higher throughput but sacrifices PAPR reduction. Finally, to overcome this loss in PAPR reduction, we proposed application of Square-rooting companding technique over the output OFDM transmitted signal. Simulation results show that the proposed method is able to compensate the sacrifice in PAPR and achieved PAPR reduction of 8.9 dB with very low computational overhead.     

A Low-Complexity Compressive Sensing Algorithm for PAPR Reduction

One of the major challenges in orthogonal frequency division multiplexing system is its high peak-to-average-power ratio (PAPR). Among the existing PAPR reduction technologies, clipping is the most often used one due to its simplicity of implementation. But it induces signal distortion. In this paper, we propose a new PAPR reduction method which introduces compressive sensing theory to help the clipping and signal recovery processes. Our method has superior symbol-error-rate (SER) performance compared with traditional clipping, and at the same time has better PAPR reduction performance compared with traditional tone reservation based algorithms. What is more, different from the existing high-complexity compressive sensing based scheme which tries to solve an optimization problem, the proposed algorithm uses orthogonal matching pursuit scheme to recover the distorted signals, thereby it significantly reduces the computational complexity with the same PAPR reduction efficiency. Simulation results show that our proposed scheme can achieve dramatic PAPR reduction with only about \(10\,\%\) of the existing method, while still keeps good SER performance.     

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

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

新的低复杂度降低OFDM信号峰均功率比的压缩扩张技术

本文提出了一种新的降低OFDM信号峰均功率比的压缩扩张技术.文中通过与传统压缩扩张技术的对比,详细介绍了新压缩扩张技术的方法和计算复杂度、并从统计角度分析了对峰均功率比及其用于OFDM系统时对系统误比特率的改善等方面的性能.数值仿真说明,与传统压缩扩张技术相比较,新压缩扩张技术不仅具有更低的计算复杂度,而且可以获得更为高效的性能增益.     

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.     

A Robust Peak-to-Average Power Ratio Reduction Scheme by Inserting Dummy Signals with Enhanced Partial Transmit Sequence in OFDM Systems

Peak-to-average power ratio (PAPR) is one of the main drawbacks in orthogonal frequency division multiplexing (OFDM) systems. High PAPR forces the power amplifier to back off in order to operate in its linear region, which degrades the power efficiency of the system. Several PAPR reduction techniques have been developed, but most of them have not considered both complexity and PAPR reduction. In this paper, a novel PAPR reduction scheme based on the insertion of dummy sequences to an enhanced partial transmit sequence is proposed. By applying this scheme the PAPR performance is enhanced compared to the conventional methods while the complexity is significantly reduced. Numerical analysis is carried out with OFDM signal and QPSK modulation.     

An Adaptive Clipping and Filtering Technique for PAPR Reduction of OFDM Signals

In recent years, many peak-to-average power ratio (PAPR) reduction techniques have been proposed for orthogonal frequency division multiplexing (OFDM) signals. Among various techniques, the iterative clipping and filtering (ICAF) technique has been considered as a practical scheme, and widely used owing to its non-expansion of bandwidth, low computational complexity, and simplicity in implementation without receiver-side cooperation. However, the performance of conventional ICAF technique is degraded, because the same signals are iteratively clipped with a fixed clipping threshold (CT) in every clipping operation. In this paper, we analyze the performance of conventional ICAF technique, and then propose an adaptive ICAF scheme, which clips the signal with an adaptively modified CT in every clipping operation to achieve enhanced PAPR reduction of OFDM signals. Simulation results show that the proposed scheme significantly outperforms the conventional scheme, in PAPR reduction of OFDM signals at the same number of iterations.     

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

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

A low complexity peak-to-average power ratio reduction scheme based on selected mapping and radix-II IFFT in OFDM systems

Because of its lack of feedback process and the simplicity of its searching algorithm, conventional selected mapping (CSLM) is an efficient peak-to-average power ratio (PAPR) reduction technique in orthogonal frequency division multiplexing systems compared to the present techniques such as partial transmit sequence and active constellation extension. The requirement for large numbers of inverse fast Fourier transform (IFFT) blocks to provide desired PAPR reduction performance is introduced as the most significant drawback of the CSLM. This paper uses the special structure of an N-point radix-II IFFT in the CSLM and proposes a low complexity method to reduce the redundant calculations with almost the same PAPR reduction, bit-error rate, and power spectral density performances as those of the CSLM. The simulation results show that the computational complexity is reduced by at least 46.8% compared to that of the CSLM with approximately the same PAPR performance.