Efficient performance computations for trellis-coded modulation

Author

Rajab, Hassan Abou ; Yücel, Melek D.

Author_Institution

Dept. of Electr. & Electron. Eng., Eastern Mediterranean Univ., Mersin, Turkey

Volume

47

Issue

6

fYear

1999

fDate

6/1/1999 12:00:00 AM

Firstpage

796

Lastpage

798

Abstract

The algorithm given by Rouanne and Costello (1989) for the computation of the distance spectrum is improved for trellis-coded modulation schemes having uncoded bits, i.e., for trellis diagrams having parallel paths. It is shown that, when through a trellis corresponding to such kind of codes, all parallel transitions (labeled by signal selectors) between states are considered as a single branch labeled by a subset, then defining subset selector distance polynomials makes the computational complexity of the distance spectrum dependent on the number of states as compared to the complexity of Rouanne and Costello algorithm which depends on the number of paths to be extended

Keywords

computational complexity; polynomials; trellis coded modulation; algorithm; computational complexity; distance spectrum; parallel paths; parallel transitions; performance computations; signal selectors; states number; subset selector distance polynomials; trellis diagrams; trellis-coded modulation; uncoded bits; AWGN; Additive white noise; Computational complexity; Concurrent computing; Convolution; Convolutional codes; Fading; Intersymbol interference; Partitioning algorithms; Polynomials;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.771329

Filename

771329