Computing upper bounds to error probability of coded modulation schemes

We describe some methods for evaluating error probabilities of infinite signal constellations, requiring 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 is being built and is based on a combination of convolutional codes with a single-parity-check block code