Abstract—In this correspondence, we present a technique for generation of linear subcodes of a given turbo code with better distance spectrum than the original mother turbo code, via an iterative process of trace-bit injection which minimallyr educes code rate, followed byselecti ve puncturing that allows recoveryof the rate loss incurred during the trace-bit injection. The technique allows for asymptotic performance improvement of any linear turbo code. In effect, we trim the distance spectrum of a turbo code via elimination of the lowdistance and/or high multiplicitycodew ords from the output space of the code. To this end, we perform a greedyminimization of a cost function closelyr elated to the asymptotic bit error probability (or frame error probability) of the code. This improves the performance of the code everywhere, but its main impact is a reduction in the error floor of the turbo code which is important for delayconstrained applications employing short interleavers.
Linear subcodes of turbo codes with improved distance spectra / Daneshgaran, F; Mondin, Marina; Mulassano, P.. - In: IEEE TRANSACTIONS ON INFORMATION THEORY. - ISSN 0018-9448. - STAMPA. - 50:12(2004), pp. 3291-3294. [10.1109/TIT.2004.838364]
Linear subcodes of turbo codes with improved distance spectra
MONDIN, Marina;
2004
Abstract
Abstract—In this correspondence, we present a technique for generation of linear subcodes of a given turbo code with better distance spectrum than the original mother turbo code, via an iterative process of trace-bit injection which minimallyr educes code rate, followed byselecti ve puncturing that allows recoveryof the rate loss incurred during the trace-bit injection. The technique allows for asymptotic performance improvement of any linear turbo code. In effect, we trim the distance spectrum of a turbo code via elimination of the lowdistance and/or high multiplicitycodew ords from the output space of the code. To this end, we perform a greedyminimization of a cost function closelyr elated to the asymptotic bit error probability (or frame error probability) of the code. This improves the performance of the code everywhere, but its main impact is a reduction in the error floor of the turbo code which is important for delayconstrained applications employing short interleavers.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/1402490
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo