Archivio Istituzionale della RicercaA 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.
A new decoding algorithm for trellis codes over groups / Benedetto, S.; Montorsi, Guido. - (1994), pp. 486-486. (Intervento presentato al convegno IEEE International Symposium on Information Theory, 1994 tenutosi a Trondheim nel 27 Jun 1994-01 Jul 1994) [10.1109/ISIT.1994.395101].
A new decoding algorithm for trellis codes over groups
MONTORSI, Guido
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.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/1414314
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo