A Low-Complexity Architecture for PAPR Reduction in OFDM Systems With Near-Optimal Performance
A Low-Complexity Architecture for PAPR Reduction in OFDM Systems With Near-Optimal Performance
复制标题
DOI：
10.1109/tvt.2015.2395818
复制
发表时间：
2016
影响因子：
6.8
通讯作者：
Sen-Hung Wang;Kuan-Chou Lee;Chih-Peng Li
中科院分区：
文献类型：
--
作者：
Sen-Hung Wang;Kuan-Chou Lee;Chih-Peng Li
Selected mapping (SLM) schemes are widely used to reduce the peak-to-average power ratio (PAPR) in orthogonal frequency-division multiplexing (OFDM) systems. Various time-domain approaches have been proposed for reducing the number of inverse fast Fourier transform (IFFT) operations required to generate the candidate signals in traditional SLM schemes. However, the resulting time-domain-generated signals are somewhat correlated, and thus, the PAPR reduction performance is seriously degraded. Accordingly, this paper proposes a novel PAPR reduction method in which frequency-domain phase rotation, cyclic shifting, complex conjugate, and subcarrier reversal operations are all employed to increase the diversity of the candidate signals. Furthermore, to circumvent the multiple-IFFT problem, all of the frequency-domain operations are converted into time-domain equivalents. It is shown that the subcarrier partitioning and reassembling processes are key to realizing low-complexity time-domain equivalent operations. Moreover, it is shown theoretically and numerically that the computational complexity of the proposed scheme is significantly lower than that of the traditional SLM method and that the PAPR reduction performance is within 0.001 dB of that of SLM. Overall, the results indicate that among all of the low-complexity architectures proposed in the literature, the method proposed in this paper most closely approximates the PAPR reduction performance of the traditional SLM scheme.
