Back to Search
Start Over
Bounds on the PMEPR of Translates of Binary Codes.
- Source :
- IEEE Communications Letters; 11/01/2010, Vol. 14 Issue 11, p1059-1061, 0p
- Publication Year :
- 2010
-
Abstract
- The use of error-correcting codes for tight control of the peak-to-mean envelope power ratio (PMEPR) in orthogonal frequency-division multiplexing (OFDM) transmission is considered. A well-known approach for the construction of such codes is to take a code that is good in the classical coding-theoretic sense and to choose a translate of this code that minimizes the PMEPR. A fundamental problem is to determine the minimum PMEPR over all translates of a given code. Motivated by a recent lower bound for this minimum, an existence result is presented here. Roughly speaking, given a code C of sufficiently large length n, there exists a translate of C with PMEPR at most k\log(|C|n^1+ε) for all ε>0 and for some k independent of n. This result is then used to show that for n ≥ 32 there is a translate of the lengthened dual of a binary primitive t-error-correcting BCH code with PMEPR at most 8(t+2)\log n. [ABSTRACT FROM PUBLISHER]
Details
- Language :
- English
- ISSN :
- 10897798
- Volume :
- 14
- Issue :
- 11
- Database :
- Complementary Index
- Journal :
- IEEE Communications Letters
- Publication Type :
- Academic Journal
- Accession number :
- 55090040
- Full Text :
- https://doi.org/10.1109/LCOMM.2010.100410.101341