Archivio Istituzionale della RicercaIn this paper, upper bounds to the average maximum-likelihood bit error probability of serially concatenated coding schemes are derived. Design guidelines for the outer and inner codes that maximize the interleaver gain are presented and a highly-performing iterative decoding algorithm is proposed.
Serial concatenation of interleaved codes: performance analysis, design and iterative decoding / Benedetto, S.; Divsalar, D.; Montorsi, Guido; Pollara, F.. - (1997), pp. 106-106. (Intervento presentato al convegno IEEE International Symposium on Information Theory 1997 tenutosi a Ulm nel 29 Jun-4 Jul 1997) [10.1109/ISIT.1997.613021].
Serial concatenation of interleaved codes: performance analysis, design and iterative decoding
MONTORSI, Guido;
1997
Abstract
In this paper, upper bounds to the average maximum-likelihood bit error probability of serially concatenated coding schemes are derived. Design guidelines for the outer and inner codes that maximize the interleaver gain are presented and a highly-performing iterative decoding algorithm is proposed.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/1414301
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo