Information Theory and Reliable Communication
Information Theory and Reliable Communication
Convex Optimization
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Optimality Condition for Selected Mapping in OFDM
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
An overview of peak-to-average power ratio reduction techniques for multicarrier transmission
IEEE Wireless Communications
SLM and PTS peak-power reduction of OFDM signals without side information
IEEE Transactions on Wireless Communications
On the existence and construction of good codes with low peak-to-average power ratios
IEEE Transactions on Information Theory
Upper bounds on the statistical distribution of the crest-factor in OFDM transmission
IEEE Transactions on Information Theory
Generalized bounds on the crest-factor distribution of OFDM signals with applications to code design
IEEE Transactions on Information Theory
| Hi-index | 35.68 |
One major drawback of orthogonal frequency-division multiplexing (OFDM) systems is the high peak-to-average power ratio (PAR) of the transmit signal. In order to overcome this problem, selected mapping (SLM) is a well known method for PAR reduction. In this paper, asymptotic performance analysis of SLM is carried out and a bound on the maximum tolerable PAR values is derived. Starting with the analysis of Gaussian signalling at Nyquist rate, it is also shown that these theoretic results can be applied for QAM signalling at any oversampling rate. Based on the idea to distinguish between tolerable and nontolerable PAR values a novel variant of SLM is derived, namely successive SLM (SSLM). With this approach it is possible to significantly decrease the average number of assessed signal candidates and the average number of required side-information bits per OFDM frame as long as the threshold of tolerable PAR values is larger than the critical PAR (log(D) for Nyquist sampled signals). As a rule of thumb, less than 2.71 (Euler's number) candidates and less than 2.57 bits of side-information are required on average.