Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Generalized bounds on the crest-factor distribution of OFDM signals with applications to code design

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)
Litsyn, S. ; Dept. Electr. Eng.-Syst., Tel-Aviv Univ. ; Wunder, G.

In this paper generalized bounds on the crest-factor (CF) distribution in orthogonal frequency-division multiplexing (OFDM) transmission for both independent and dependent subcarriers are derived. Here, the latter situation represents the coded case. For independent subcarriers, a general path for bounding practical constellations is provided. Moreover, a complete characterization of their asymptotic behavior is devised and discussed. The results are shown to carry over to the spherical constellations improving on recent results. For dependent subcarriers, the focus is mainly on binary codes where bounds on the CF distribution are obtained in terms of the distance distributions and their duals. The asymptotic behavior of codes is analyzed and it is shown that the upper bound on the effective crest-factor of a large class of Bose-Chaudhuri-Hocquenghem (BCH) codes behaves asymptotically as radiclogN. Finally, two applications of the results to code design are presented: first, fixed phase shifts on the subcarriers for all codewords are used and an algorithm to calculate the phase shifts is designed. That way, it is proved that the effective CF of any binary code can be scaled to be of order radiclogN for large N without sacrificing on rate. Furthermore, the same approach is applied to calculation of the phases of redundant subcarriers for each codeword. It is shown by simulations that the values can be effectively chosen so that the CF is significantly reduced with nonexponential complexity

Published in:

Information Theory, IEEE Transactions on  (Volume:52 ,  Issue: 3 )