Parallel concatenated coding schemes employing convolutional codes as constituent codes linked by an interleaver have been proposed in the literature as “turbo codes”. They yield very good performance in connection with simple suboptimum decoding algorithms. In this paper, we propose an alternative scheme consisting of the serial concatenation of block or convolutional codes and evaluate its average performance in terms of analytical bounds on the bit error probability. Comparisons with parallel concatenated coding schemes show in some cases sensible advantages.
Serial concatenation of interleaved codes: analytical performance bounds / Benedetto, S.; Montorsi, Guido. - 1:(1996), pp. 106-110. (Intervento presentato al convegno Global Telecommunications Conference 1996, GLOBECOM '96 tenutosi a London nel 18-22 Nov 1996) [10.1109/GLOCOM.1996.594342].
Serial concatenation of interleaved codes: analytical performance bounds
MONTORSI, Guido
1996
Abstract
Parallel concatenated coding schemes employing convolutional codes as constituent codes linked by an interleaver have been proposed in the literature as “turbo codes”. They yield very good performance in connection with simple suboptimum decoding algorithms. In this paper, we propose an alternative scheme consisting of the serial concatenation of block or convolutional codes and evaluate its average performance in terms of analytical bounds on the bit error probability. Comparisons with parallel concatenated coding schemes show in some cases sensible advantages.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/1414307
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo