Title :
A new decoding algorithm for geometrically uniform trellis codes
Author :
Benedetto, Sergio ; Montorsi, Guido
Author_Institution :
Dipartimento di Elettronica, Politecnico di Torino, Italy
fDate :
5/1/1996 12:00:00 AM
Abstract :
A new decoding algorithm for geometrically uniform trellis codes is presented. The group structure of the codes is exploited in order to improve the decoding process. Analytical bounds to the algorithm performance and to its computational complexity are derived. The algorithm complexity does not depend on the number of states of the trellis describing the code. Extensive simulations yield results on the algorithm performance and complexity, and permit a comparison with the Viterbi algorithm and the sequential Fano algorithm
Keywords :
computational complexity; decoding; geometric codes; trellis codes; TCM codes; Viterbi algorithm; algorithm performance; analytical bounds; computational complexity; decoding algorithm; geometrically uniform trellis codes; group codes; group structure; sequential Fano algorithm; simulations; trellis coded modulation; Algorithm design and analysis; Computational complexity; Computational modeling; Constellation diagram; Convolutional codes; Decoding; Modular construction; Modulation coding; Performance analysis; Viterbi algorithm;
Journal_Title :
Communications, IEEE Transactions on
