Title :
A new decoding algorithm for trellis codes over groups
Author :
Benedetto, Sergio ; Montorsi, Guido
Author_Institution :
Dipartimento di Elettronica, Politecnico di Torino, Italy
fDate :
27 Jun-1 Jul 1994
Abstract :
A new decoding algorithm for geometrically uniform TCM schemes is proposed, based on the group properties of code sequences and trellis states, Its complexity is almost independent from the number of states of the trellis, and, for a given code, a trade-off between complexity and performance of the algorithm can be chosen
Keywords :
computational complexity; error statistics; sequential decoding; trellis coded modulation; code sequences; complexity; decoding algorithm; error probability; geometrically uniform TCM schemes; groups; performance; trellis codes; trellis states; Adaptive algorithm; Convolutional codes; Error probability; Euclidean distance; Hamming distance; Maximum likelihood decoding; Maximum likelihood estimation; Noise reduction; Read only memory; Viterbi algorithm;
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
DOI :
10.1109/ISIT.1994.395101
