篇名 | A Low-Complexity Permutation-Based PTS Scheme for PAPR Reduction in OFDM Systems |
---|---|
卷期 | 4:2 |
作者 | Ku, Sheng-ju 、 Kuo, Chia-wei |
頁次 | 163-166 |
關鍵字 | inverse fast Fourier transform 、 orthogonal frequency division multiplexing 、 partial transmit sequences 、 peak-to-average power ratio |
出刊日期 | 201406 |
DOI | 10.6159/IJSE.2014.(4-2).40 |
The high peak-to-average power ratio (PAPR) of the transmitted signal is one of the main drawbacks of orthogonal frequency division multiplexing (OFDM) systems. Partial transmit sequences (PTS) is a non-distortion technique to reduce the PAPR of OFDM systems, where the input data block is partitioned into some disjoint subblocks and then combined optimally to form a low-PAPR output signal. The conventional PTS scheme has a good PAPR reduction performance, but it usually involves high computational complexity. In this paper, we propose a new permutationbased PTS (PB-PTS) scheme is for OFDM systems, where the nonzero elements of each subblock are permutated and weighted to form more candidate signals for selection. Also, we generate cost functions by adding the sample powers to select samples to estimate the peak power of candidate signals and use the shift property of inverse fast Fourier transform to further reduce the computational complexity of the PB-PTS scheme. Computer simulations show that the proposed PB-PTS scheme achieves a better PAPR reduction performance than the conventional PTS scheme, but has much lower computational complexity. 1