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

A recursive algorithm for the exact BER computation of generalized hierarchical QAM 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
$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)
Vitthaladevuni, P.K. ; Dept. of Electr. & Comput. Eng., Univ. of Minnesota, Minneapolis, MN, USA ; Alouini, M.-S.

Hierarchical constellations offer a different degree of protection to the transmitted messages according to their relative importance. As such, they find interesting application in digital video broadcasting systems as well as wireless multimedia services. Although a great deal of attention has been devoted in the literature to the study of the bit error rate (BER) performance of uniform quadrature amplitude modulation (QAM) constellations, very few results were published on the BER performance of hierarchical QAM constellations. We obtain exact and generic expressions in M for the BER of the generalized hierarchical M-PAM (pulse amplitude modulation) constellations over additive white Gaussian noise (AWGN) and fading channels. We also show how these expressions can be extended to generalized hierarchical M-QAM constellations (square and rectangular). For the AWGN case, these expressions are in the form of a weighted sum of complementary error functions and are solely dependent on the constellation size M, the carrier-to-noise ratio, and a constellation parameter which controls the relative message importance. Because of their generic nature, these new expressions readily allow numerical evaluation for various cases of practical interest.

Published in:

Information Theory, IEEE Transactions on  (Volume:49 ,  Issue: 1 )

Date of Publication:

Jan 2003

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.