Decoding turbo codes based on their parity-check matrices

Fan Jiang, Eric Psota, Lance C. Pérez

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

The turbo iterative decoding algorithm only performs well for turbo codes with relatively small memories. Moreover, its decoding complexity becomes prohibitively large when the turbo encoders have very large memories. The sumproduct and linear programming decoding algorithms are based on the parity-check matrices of the codes. They are widely used to decode low-density parity-check codes. These algorithms do not suffer the limitations of the turbo iterative decoding algorithm. In order to apply them to the turbo codes, the parity-check matrices of turbo codes must be found. By treating turbo codes as serially concatenated codes, the generator and paritycheck matrices of the turbo codes are derived in this paper. Turbo codes with low-density parity-check matrices are then designed based on the derived results. Provided these matrices, turbo codes are decoded using the sum-product algorithms. Preliminary results show that the sum-product decoding of turbo codes performs slightly worse than sum-product decoding of conventional low-density parity-check codes. However, since the encoding of turbo codes has less complexity than the straightforward encoding of low-density parity-check codes, this loss in performance may be justified by the drastically decreased encoding complexity. The availability of the parity-check matrices of turbo codes also makes them ready to be decoded by the linear programming decoding algorithm which is optimum for the given linear constraints.

Original languageEnglish (US)
Title of host publicationProceedings of the Thirty-Ninth Southeastern Symposium on System Theory, SSST
Pages221-224
Number of pages4
DOIs
StatePublished - Aug 28 2007
Event2007 39th Southeastern Symposium on System Theory, SSST - Macon, GA, United States
Duration: Mar 4 2007Mar 6 2007

Publication series

NameProceedings of the Annual Southeastern Symposium on System Theory

Other

Other2007 39th Southeastern Symposium on System Theory, SSST
CountryUnited States
CityMacon, GA
Period3/4/073/6/07

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Mathematics(all)

Fingerprint Dive into the research topics of 'Decoding turbo codes based on their parity-check matrices'. Together they form a unique fingerprint.

  • Cite this

    Jiang, F., Psota, E., & Pérez, L. C. (2007). Decoding turbo codes based on their parity-check matrices. In Proceedings of the Thirty-Ninth Southeastern Symposium on System Theory, SSST (pp. 221-224). [4160838] (Proceedings of the Annual Southeastern Symposium on System Theory). https://doi.org/10.1109/SSST.2007.352352