Rate variable, multi-binary turbo codes with controlled error-floor

Authors:
Marco Ferrari;Sandro Bellini
Affiliations:
Dipartimento of Elettronica e Informazione of Politecnico di Milano, National Research Council, Institute IEIIT, Italy;Dipartimento of Elettronica e Informazione of Politecnico di Milano, Italy
Venue:
IEEE Transactions on Communications
Year:
2009

Citing 5
Cited 0

Shift Register Sequences

Shift Register Sequences
Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding

IEEE Transactions on Information Theory
Bolt interleavers for turbo codes

IEEE Transactions on Information Theory
Interleavers for turbo codes using permutation polynomials over integer rings

IEEE Transactions on Information Theory
Symbol-by-symbol MAP decoding algorithm for high-rate convolutional codes that use reciprocal dual codes

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this letter we propose rate variable turbo codes based on the parallel concatenation of tailbiting Recursive Systematic multi-binary (m-ary) convolutional codes. Rate variability is not achieved by puncturing, which can have adverse effects on the minimum distance of the code. Using a variable number of input lines of the encoder, we obtain several different overall rates ranging from 1/2 to 7/8. The most suitable Soft-In-Soft-Out decoding algorithm for these turbo codes is based on the Dual Reciprocal Code, which is very efficient for high rate codes. A particular interleaver design, namely the "backbone" interleaver, guarantees a high Hamming weight in codewords with information weight 2 and 3, as well as good minimum distances and fairly low multiplicities for higher information weights. Therefore, these codes have very low error floors.