By Topic

Linear subcodes of turbo codes with improved distance spectra

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Daneshgaran, F. ; Electr. & Comput. Eng. Dept., Calif. State Univ., Los Angeles, CA, USA ; Mondin, M. ; Mulassano, P.

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 minimally reduces code rate, followed by selective puncturing that allows recovery of 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 low distance and/or high multiplicity codewords from the output space of the code. To this end, we perform a greedy minimization of a cost function closely related 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 delay constrained applications employing short interleavers.

Published in:

Information Theory, IEEE Transactions on  (Volume:50 ,  Issue: 12 )