A new decoding algorithm for geometrically uniform trellis codes |
| |
| Authors: | Benedetto S Montorsi G |
| |
| Affiliation: | Dipartimento di Elettronica, Politecnico di Torino ; |
| |
| 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: | |
|
|
