DocumentCode :
3420119
Title :
Par reduction in OFDM through convex programming
Author :
Wang, Chao ; Leung, Shu Hung
Author_Institution :
Dept. of Electron. Eng., Hong Kong City Univ., Hong Kong
fYear :
2008
fDate :
March 31 2008-April 4 2008
Firstpage :
3597
Lastpage :
3600
Abstract :
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.
Keywords :
OFDM modulation; computational complexity; convex programming; error statistics; BER; OFDM; PAR reduction; active constellation extension; bit-error-rate; convex programming; high peak-to-average power ratio; power efficient transmitter; Bit error rate; Chaos; Computational complexity; Constraint optimization; Frequency domain analysis; Iterative algorithms; OFDM modulation; Peak to average power ratio; Power engineering and energy; Transmitters; Newton method; iterative methods; optimization methods; power control;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Acoustics, Speech and Signal Processing, 2008. ICASSP 2008. IEEE International Conference on
Conference_Location :
Las Vegas, NV
ISSN :
1520-6149
Print_ISBN :
978-1-4244-1483-3
Electronic_ISBN :
1520-6149
Type :
conf
DOI :
10.1109/ICASSP.2008.4518430
Filename :
4518430
Link To Document :
بازگشت