Archivio Istituzionale della RicercaA self-concatenated code with interleavers is a concatenated coded scheme based on only one recursive convolutional code. An upper bound on bit error probability, averaged over all possible interleavers, using maximum-likelihood decoding is obtained. Design rules for the single convolutional code, that maximize the interleavers gain and the effective free distance are presented. Design rules are extended to nonbinary modulation for the design of self-concatenated trellis coded modulation. A low-complexity self-iterative decoding algorithm for the self-concatenated code for binary and nonbinary modulation is proposed.
Self-concatenated codes with self-iterative decoding for powerand bandwidth efficiency / Benedetto, S.; Divsalar, D.; Montorsi, Guido; Pollara, F.. - (1998), pp. 177-177. (Intervento presentato al convegno IEEE International Symposium on Information Theory, 1998 tenutosi a Cambridge (USA) nel 16-21 Aug 1998) [10.1109/ISIT.1998.708774].
Self-concatenated codes with self-iterative decoding for powerand bandwidth efficiency
MONTORSI, Guido;
1998
Abstract
A self-concatenated code with interleavers is a concatenated coded scheme based on only one recursive convolutional code. An upper bound on bit error probability, averaged over all possible interleavers, using maximum-likelihood decoding is obtained. Design rules for the single convolutional code, that maximize the interleavers gain and the effective free distance are presented. Design rules are extended to nonbinary modulation for the design of self-concatenated trellis coded modulation. A low-complexity self-iterative decoding algorithm for the self-concatenated code for binary and nonbinary modulation 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/1414299
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo