Cart (Loading....) | Create Account
Close category search window
 

On multicarrier signals where the PMEPR of a random codeword is asymptotically logn

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sharif, M. ; Dept. of Electr. Eng., California Inst. of Technol., Pasadena, CA, USA ; Hassibi, B.

Multicarrier signals exhibit a large peak-to-mean envelope power ratio (PMEPR). In this correspondence, without using a Gaussian assumption, we derive lower and upper probability bounds for the PMEPR distribution when the number of subcarriers n is large. Even though the worst case PMEPR is of the order of n, the main result is that the PMEPR of a random codeword C=(c1,...,cn) is logn with probability approaching one asymptotically, for the following three general cases: i) ci's are independent and identically distributed (i.i.d.) chosen from a complex quadrature amplitude modulation (QAM) constellation in which the real and imaginary part of ci each has i.i.d. and even distribution (not necessarily uniform), ii) ci's are i.i.d. chosen from a phase-shift keying (PSK) constellation where the distribution over the constellation points is invariant under π/2 rotation, and iii) C is chosen uniformly from a complex sphere of dimension n. Based on this result, it is proved that asymptotically, the Varshamov-Gilbert (VG) bound remains the same for codes with PMEPR of less than logn chosen from QAM/PSK constellations.

Published in:

Information Theory, IEEE Transactions on  (Volume:50 ,  Issue: 5 )

Date of Publication:

May 2004

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.