Par reduction in OFDM through convex programming

• Published in: 2008 IEEE International Conference on Acoustics, Speech and Signal Processing pp. 3597 - 3600
• Main Authors: Chao Wang, Shu Hung Leung
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.03.2008
• Subjects: Bit error rate; Chaos; Computational complexity; Constraint optimization; Frequency domain analysis; Iterative algorithms; iterative methods; Newton method; OFDM modulation; optimization methods; Peak to average power ratio; power control; Power engineering and energy; Transmitters
• ISBN: 9781424414833; 1424414830
• ISSN: 1520-6149
• DOI: 10.1109/ICASSP.2008.4518430

The high peak-to-average power ratio (PAR) encountered in OFDM system has been a major obstacle in the implementation of power efficient transmitter. In this paper, we present a new active constellation extension (ACE) based convex optimization algorithm which reduces PAR through convex programming. In comparison with previous convex programming method, our method greatly reduces the complexity and keeps the bit-error-rate (BER) performance. Moreover, our method can be combined with other clipping based ACE algorithms to further reduce the complexity with a slight performance degradation. Simulation results are given in this paper which show our method outperforms other ACE-based algorithms.