By Topic

On optimal shaping of multidimensional constellations

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
$33 $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

3 Author(s)
R. Laroia ; Dept. of Electr. Eng., Maryland Univ., College Park, MD, USA ; N. Farvardin ; S. A. Tretter

A scheme for the optimal shaping of multidimensional constellations is proposed. This scheme is motivated by a type of structured vector quantizer for memoryless sources, and results in N-sphere shaping of N-dimensional cubic lattice-based constellations. Because N-sphere shaping is optimal in N dimensions, shaping gains higher than those of N-dimensional Voronoi constellations can be realized. While optimal shaping for a large N can realize most of the 1.53 dB total shaping gain, it has the undesirable effect of increasing the size and the peak-to-average power ratio of the constituent 2D constellation. This limits its usefulness for many real world channels which have nonlinearities. The proposed scheme alleviates this problem by achieving optimal constellation shapes for a given limit on the constellation expansion ratio or the peak-to-average power ratio of the constituent 2D constellation. Results of Calderbank and Ozarow (1990) on nonequiprobable signaling are used to reduce the complexity of this scheme and make it independent of the data rate with essentially no effect on the shaping gain. Comparisons with Forney's (1989) trellis shaping scheme are also provided

Published in:

IEEE Transactions on Information Theory  (Volume:40 ,  Issue: 4 )