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

Computing upper bounds to error probability of coded modulation schemes

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

3 Author(s)
Biglieri, E. ; Dipartimento di Elettronica, Politecnico di Torino, Italy ; Sandri, A. ; Spalvieri, A.

To evaluate an upper bound on error probabilities of signal constellations used for transmission over the additive white Gaussian noise (AWGN) channel, enumeration of all the constellation intradistances is required. These may be infinite in number, for example, when convolutional codes are used and the constellations are lattices. Truncation of the series does not necessarily provide a bound anymore, and must be done with care. Yet the union bound is very simple, as it does not require any further knowledge about the signal constellation than the distance enumerator. In this paper, we describe some methods that can be used to evaluate error probabilities of infinite signal constellations, and that require only a finite number of terms. These methods are applicable, for example, to convolutional codes decoded with a finite-depth Viterbi algorithm and to signal constellations carved from lattices. Coded modulations based on lattices and convolutional or block codes can also be dealt with. As an example of application, we analyze a variable-rate 3-stage coded modulation encoder/decoder, which has been built and is based on a combination of convolutional codes with a single-parity-check block code

Published in:

Communications, IEEE Transactions on  (Volume:44 ,  Issue: 7 )

Date of Publication:

Jul 1996

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.