Paper Info
Title
A New Peak-to-Average Power-Ratio Reduction Algorithm for OFDM Systems via Constellation Extension
Abstract
Peak-to-average power-ratio (PAPR) reduction for OFDM systems is investigated in a probabilistic framework. A new constellation extension technique is developed whereby the data for each subcarrier are represented either by points in the original constellation or by extended points. An optimal representation of the OFDM signal is achieved by using a de-randomization algorithm where the conditional probability involved is handled by using the Chernoff bound and the evaluation of the many hyperbolic cosine functions involved is replaced by a tight upper bound for these functions. The proposed algorithm can be used by itself or be combined with a selective rotation technique described in the paper and with other known algorithms such as the coordinate descent optimization and selective mapping algorithms to achieve further performance enhancements at the cost of a slight increase in the computational complexity. When compared with other existing PAPR-reduction algorithms, the enhanced algorithm offers improved PAPR-reduction performance and improved computational complexity although, the transmit power is increased somewhat
Year
DOI
Venue
2007
10.1109/TWC.2007.360384
IEEE Transactions on Wireless Communications
Keywords
Field
DocType
chernoff bound,interference,computational complexity,transmitters,fading,nonlinear distortion,ofdm,ofdm modulation,randomized algorithm,conditional probability,degradation,probability
Subcarrier,Transmitter power output,Conditional probability,Upper and lower bounds,Algorithm,Probabilistic analysis of algorithms,Coordinate descent,Mathematics,Chernoff bound,Computational complexity theory
Journal
Volume
Issue
ISSN
6
5
1536-1276
ISBN
Citations 
PageRank 
0-7803-9195-0
38
2.26
References 
Authors
19
3
Name
Order
Citations
PageRank
Yajun Kou1393.00
Wu-Sheng Lu229624.90
Andreas Antoniou310114.77