On the Equivalence of TCM Encoders
Paper i proceeding, 2012

Optimal trellis-coded modulation (TCM) schemes are obtained by jointly designing the convolutional encoder and the binary labeling of the constellation. Unfortunately this approach is infeasible for large encoder memories or constellation sizes. Traditional TCM designs circumvent this problem by using a labeling that follows the set-partitioning principle and by performing an exhaustive search over the encoders. Therefore, traditional TCM schemes are not necessarily optimal. In this paper, we study binary labelings for TCM and show how they can be grouped into classes, which considerably reduces the search space in a joint design. For the particular case of 8-ary modulation the search space is reduced from 40320 to 240. Using this classification, we formally prove that for any channel it is always possible to design a TCM system based on the binary-reflected Gray code with identical performance to the one proposed by Ungerboeck in 1982. Moreover, the classification is used to tabulate asymptotically optimal TCM schemes.

Convolutional encoders

Exhaustive search

Joint designs

Constellation sizes

Asymptotically optimal

Labelings

Ungerboeck

Trellis coded modulation

Search spaces

Gray codes

Författare

Alex Alvarado

University of Cambridge

Alexandre Graell i Amat

Signaler och system, Kommunikationssystem, informationsteori och antenner, Kommunikationssystem

Fredrik Brännström

Signaler och system, Kommunikationssystem, informationsteori och antenner, Kommunikationssystem

Erik Agrell

Signaler och system, Kommunikationssystem, informationsteori och antenner, Kommunikationssystem

2012 IEEE International Symposium on Information Theory, ISIT 2012. Cambridge, MA, 1 - 6 July 2012

2401-2405 6283945

Styrkeområden

Informations- och kommunikationsteknik

Ämneskategorier

Telekommunikation

DOI

10.1109/ISIT.2012.6283945

ISBN

978-146732579-0