Low-Complexity PAPR Reduction Schemes for OFDM Systems

• Main Authors: Chen, Chih-Ning, 陳至寧
• Other Authors: Su, Yu T.
• Format: Others
• Language: en_US
• Published: 2011
• Online Access: http://ndltd.ncl.edu.tw/handle/10391881673371289185

碩士 === 國立交通大學 === 電信工程研究所 === 100 === One major problem with an orthogonal frequency division multiplexing (OFDM)system is high peak-to-average power ratio (PAPR) of the transmitter's output signals. To deal with it, several reduction scheme have been proposed and selective mapping (SLM) and partial transmit sequence (PTS) are two of them. Nevertheless, both two schemes incur high computational complexity and simplification is required. Although there are several works are devoted to the simplification, we find that most of them are designed without considering the structure of fast Fourier transform (FFT). It motives us to jointly design the PAPR reduction scheme and FFT. In this thesis, we propose a concept to achieve this goal and several existed PAPR reduction schemes can be simplified with this concept. Here, two variant PAPR reduction schemes are considered and we will show that either the computational complexity can be reduced or we can get lower PAPR compared to the conventional schemes. In addition, a early stopping criterion is proposed to further reduce the computational complexity.