DocumentCode :
2383864
Title :
A new decoding algorithm for geometrically uniform trellis codes
Author :
Montorsi, G. ; Benedetto, S. ; Anderson, J.
Author_Institution :
Dipartimento di Elettronica, Politecnico di Torino, Italy
fYear :
1994
fDate :
1-5 May 1994
Firstpage :
1706
Abstract :
A new decoding algorithm for geometrically uniform trellis codes exploiting the group structure of the codes is presented. The algorithm complexity does not depend on the number of states of the trellis describing the code. Performance of the algorithm are evaluated through simulation and its complexity is compared to the Viterbi algorithm
Keywords :
adaptive decoding; geometric codes; maximum likelihood detection; trellis coded modulation; TCM codes; Viterbi algorithm; algorithm complexity; decoding algorithm; geometrically uniform trellis codes; group structure; maximum likelihood detection; performance evaluation; simulation; trellis coded modulation; Computational modeling; Constellation diagram; Convolutional codes; Decoding; Economic indicators; Euclidean distance; Signal generators; Solid modeling; Systems engineering and theory; Viterbi algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, 1994. ICC '94, SUPERCOMM/ICC '94, Conference Record, 'Serving Humanity Through Communications.' IEEE International Conference on
Conference_Location :
New Orleans, LA
Print_ISBN :
0-7803-1825-0
Type :
conf
DOI :
10.1109/ICC.1994.368742
Filename :
368742
Link To Document :
بازگشت