Archivio Istituzionale della RicercaA 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.
A new decoding algorithm for geometrically uniform trellis codes / Montorsi, Guido; Benedetto, S.; Anderson, J.. - 3:(1994), pp. 1706-1711. (Intervento presentato al convegno IEEE International Conference on Communications 1994, ICC '94, SUPERCOMM/ICC '94 tenutosi a New Orleans, LA nel 1-5 May 1994) [10.1109/ICC.1994.368742].
A new decoding algorithm for geometrically uniform trellis codes
MONTORSI, Guido;
1994
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.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/1414313
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo