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.

Rate-variable, multi-binary Turbo Codes, with controlled error-floor

M Ferrari;S Bellini
2009

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.
2009
Istituto di Elettronica e di Ingegneria dell'Informazione e delle Telecomunicazioni - IEIIT
turbo codes
rate variable
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/433594
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 6
  • ???jsp.display-item.citation.isi??? ND
social impact