In this correspondence, we present the results of the optimization applied to the design of interleavers for rate-1 parallel concatenated convolutional codes (PCCC) tailored to specific recursive systematic convolutional (RSC) constituent codes. The emphasis is on low-latency codes associated with interleavers of block length less than or equal to 160. The error floors of the optimized codes are significantly lower than those associated with the use of random interleavers. The distance spectra of the equivalent block codes resulting from trellis termination applied to PCCC are evaluated and used to obtain asymptotic bit error rate (BER) curves for the optimized codes.
Optimized Turbo Codes for Delay Constrained Applications / F., Daneshgaran; Mondin, Marina. - In: IEEE TRANSACTIONS ON INFORMATION THEORY. - ISSN 0018-9448. - STAMPA. - 48:1(2002), pp. 293-305. [10.1109/18.971759]
Optimized Turbo Codes for Delay Constrained Applications
MONDIN, Marina
2002
Abstract
In this correspondence, we present the results of the optimization applied to the design of interleavers for rate-1 parallel concatenated convolutional codes (PCCC) tailored to specific recursive systematic convolutional (RSC) constituent codes. The emphasis is on low-latency codes associated with interleavers of block length less than or equal to 160. The error floors of the optimized codes are significantly lower than those associated with the use of random interleavers. The distance spectra of the equivalent block codes resulting from trellis termination applied to PCCC are evaluated and used to obtain asymptotic bit error rate (BER) curves for the optimized codes.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/1402474
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo