A deterministic algorithm that achieves the PMEPR of c log n for multicarrier signals
- Creators
- Sharif, Masoud
- Hassibi, Babak
Abstract
Multicarrier signals often exhibit large peak to mean envelope power ratios (PMEPR) which can be problematic in practice. In this paper, we study adjusting the sign of each subcarrier in order to reduce the PMEPR of a multicarrier signal with n subcarriers. Considering that any randomly chosen codeword has PMEPR of log n with probability one and for large values of n [1], randomly choosing signs should lead to the PMEPR of log n in the probability sense. Based on the derandomization algorithm suggested in [2], we propose a deterministic and efficient algorithm to design signs such that the PMEPR of the resulting codeword is less than c log n for any n where c is a constant independent of n. By using a symmetric q-ary constellation, this algorithm in fact constructs a code with rate 1 - logq 2, PMEPR of c log n, and with simple encoding and decoding. We then present simulation results for our algorithm.
Additional Information
© 2003 IEEE. Reprinted with Permission. Publication Date: 6-10 April 2003. Posted online: 2003-06-05. This work was supported in part by the National Science Foundation under grant no. CCR-0133818, by the Office of Naval Research under grant no. N00014-02-1-0578, and by Caltech's Lee Center for Advanced Networking.Attached Files
Published - SHAicassp03.pdf
Files
Name | Size | Download all |
---|---|---|
md5:3f7414eeb2e42d332a92651e9d711670
|
274.6 kB | Preview Download |
Additional details
- Eprint ID
- 9744
- Resolver ID
- CaltechAUTHORS:SHAicassp03
- NSF
- CCR-0133818
- Office of Naval Research (ONR)
- N00014-02-1-0578
- Caltech Lee Center for Advanced Networking
- Created
-
2008-03-12Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field