Decoding turbo codes based on their parity-check matrices

Fan Jiang, Eric Psota, Lance C Perez

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

3 Citations (Scopus)

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

Fingerprint

Turbo codes
Decoding
Iterative decoding
Linear programming
Concatenated codes
Data storage equipment
Availability

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Mathematics(all)

Cite this

Jiang, F., Psota, E., & Perez, 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

Decoding turbo codes based on their parity-check matrices. / Jiang, Fan; Psota, Eric; Perez, Lance C.

Proceedings of the Thirty-Ninth Southeastern Symposium on System Theory, SSST. 2007. p. 221-224 4160838 (Proceedings of the Annual Southeastern Symposium on System Theory).

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

Jiang, F, Psota, E & Perez, LC 2007, Decoding turbo codes based on their parity-check matrices. in Proceedings of the Thirty-Ninth Southeastern Symposium on System Theory, SSST., 4160838, Proceedings of the Annual Southeastern Symposium on System Theory, pp. 221-224, 2007 39th Southeastern Symposium on System Theory, SSST, Macon, GA, United States, 3/4/07. https://doi.org/10.1109/SSST.2007.352352
Jiang F, Psota E, Perez LC. Decoding turbo codes based on their parity-check matrices. In Proceedings of the Thirty-Ninth Southeastern Symposium on System Theory, SSST. 2007. p. 221-224. 4160838. (Proceedings of the Annual Southeastern Symposium on System Theory). https://doi.org/10.1109/SSST.2007.352352
Jiang, Fan ; Psota, Eric ; Perez, Lance C. / Decoding turbo codes based on their parity-check matrices. Proceedings of the Thirty-Ninth Southeastern Symposium on System Theory, SSST. 2007. pp. 221-224 (Proceedings of the Annual Southeastern Symposium on System Theory).
@inproceedings{f977f6d6c0014dedac544652842b4821,
title = "Decoding turbo codes based on their parity-check matrices",
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.",
author = "Fan Jiang and Eric Psota and Perez, {Lance C}",
year = "2007",
month = "8",
day = "28",
doi = "10.1109/SSST.2007.352352",
language = "English (US)",
isbn = "1424411262",
series = "Proceedings of the Annual Southeastern Symposium on System Theory",
pages = "221--224",
booktitle = "Proceedings of the Thirty-Ninth Southeastern Symposium on System Theory, SSST",

}

TY - GEN

T1 - Decoding turbo codes based on their parity-check matrices

AU - Jiang, Fan

AU - Psota, Eric

AU - Perez, Lance C

PY - 2007/8/28

Y1 - 2007/8/28

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=34548139795&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34548139795&partnerID=8YFLogxK

U2 - 10.1109/SSST.2007.352352

DO - 10.1109/SSST.2007.352352

M3 - Conference contribution

AN - SCOPUS:34548139795

SN - 1424411262

SN - 9781424411269

T3 - Proceedings of the Annual Southeastern Symposium on System Theory

SP - 221

EP - 224

BT - Proceedings of the Thirty-Ninth Southeastern Symposium on System Theory, SSST

ER -