On the peak-to-mean envelope power ratio of phase-shifted binary codes
Author:
- 1 November 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 56 (11) , 1816-1823
Abstract
The peak-to-mean envelope power ratio (PMEPR) of a code employed in orthogonal frequency-division multiplexing (OFDM) systems can be reduced by permuting its coordinates and by rotating each coordinate by a fixed phase shift. Motivated by some previous designs of phase shifts using suboptimal methods, the following question is considered in this paper. For a given binary code, how much PMEPR reduction can be achieved when the phase shifts are taken from a 2h-ary phase-shift keying (2h-PSK) constellation? A lower bound on the achievable PMEPR is established, which is related to the covering radius of the binary code. Generally speaking, the achievable region of the PMEPR shrinks as the covering radius of the binary code decreases. The bound is then applied to some well understood codes, including nonredundant BPSK signaling, BCH codes and their duals, Reed-Muller codes, and convolutional codes. It is demonstrated that most (presumably not optimal) phase-shift designs from the literature attain or approach our bound.Keywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Combined coding for error control and increased robustness to system nonlinearities in OFDM2002
- Covering properties of convolutional codes and associated latticesIEEE Transactions on Information Theory, 1995
- Block coding schemefor reduction of peak to mean envelope power ratioof multicarrier transmission schemesElectronics Letters, 1994
- An upper bound on the covering radius as a function of the dual distanceIEEE Transactions on Information Theory, 1990
- Some new upper bounds on the covering radius of binary linear codesIEEE Transactions on Information Theory, 1989
- The complexity of computing the covering radius of a codeIEEE Transactions on Information Theory, 1984
- The covering radius of the (128,8) Reed-Muller code is 56 (Corresp.)IEEE Transactions on Information Theory, 1980
- On the covering radius of binary codes (Corresp.)IEEE Transactions on Information Theory, 1978
- All binary 3-error-correcting BCH codes of length2^m-ihave covering radius 5 (Corresp.)IEEE Transactions on Information Theory, 1978
- Two-error correcting Bose-Chaudhuri codes are quasi-perfectInformation and Control, 1960