Design of turbo codes without 4-cycles in Tanner graph representation for message passing algorithm

Ying Cui, Xiao Peng, Satoshi Goto

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

Abstract

Turbo code and Low Density Parity Check (LDPC) code are both recommended as FEC code in many communication standards owing to their impressive error correcting performance. Aiming at the common architecture which can decode both of the two codes, this paper describes the method of decoding turbo codes with message passing algorithm which is conventionally used for LDPC codes. In this method, turbo codes are viewed as block codes and the sparse parity check matrices are constructed through Smith Decomposition or GBT (Generator matrix based transformation). In order to guarantee decoding performance, we propose the criterion of turbo codes with no 4-cycles, which is mathematically proved and demonstrated by the simulation results.

Original languageEnglish
Title of host publicationProceedings - 2011 IEEE 7th International Colloquium on Signal Processing and Its Applications, CSPA 2011
Pages108-111
Number of pages4
DOIs
Publication statusPublished - 2011
Event2011 IEEE 7th International Colloquium on Signal Processing and Its Applications, CSPA 2011 - Penang
Duration: 2011 Mar 42011 Mar 6

Other

Other2011 IEEE 7th International Colloquium on Signal Processing and Its Applications, CSPA 2011
CityPenang
Period11/3/411/3/6

Fingerprint

Turbo codes
Message passing
Decoding
Block codes
Decomposition
Communication

Keywords

  • 4-cycle
  • LDPC
  • message passing
  • parity check matrix
  • turbo code

ASJC Scopus subject areas

  • Signal Processing

Cite this

Cui, Y., Peng, X., & Goto, S. (2011). Design of turbo codes without 4-cycles in Tanner graph representation for message passing algorithm. In Proceedings - 2011 IEEE 7th International Colloquium on Signal Processing and Its Applications, CSPA 2011 (pp. 108-111). [5759853] https://doi.org/10.1109/CSPA.2011.5759853

Design of turbo codes without 4-cycles in Tanner graph representation for message passing algorithm. / Cui, Ying; Peng, Xiao; Goto, Satoshi.

Proceedings - 2011 IEEE 7th International Colloquium on Signal Processing and Its Applications, CSPA 2011. 2011. p. 108-111 5759853.

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

Cui, Y, Peng, X & Goto, S 2011, Design of turbo codes without 4-cycles in Tanner graph representation for message passing algorithm. in Proceedings - 2011 IEEE 7th International Colloquium on Signal Processing and Its Applications, CSPA 2011., 5759853, pp. 108-111, 2011 IEEE 7th International Colloquium on Signal Processing and Its Applications, CSPA 2011, Penang, 11/3/4. https://doi.org/10.1109/CSPA.2011.5759853
Cui Y, Peng X, Goto S. Design of turbo codes without 4-cycles in Tanner graph representation for message passing algorithm. In Proceedings - 2011 IEEE 7th International Colloquium on Signal Processing and Its Applications, CSPA 2011. 2011. p. 108-111. 5759853 https://doi.org/10.1109/CSPA.2011.5759853
Cui, Ying ; Peng, Xiao ; Goto, Satoshi. / Design of turbo codes without 4-cycles in Tanner graph representation for message passing algorithm. Proceedings - 2011 IEEE 7th International Colloquium on Signal Processing and Its Applications, CSPA 2011. 2011. pp. 108-111
@inproceedings{d76f57933b68445da1800dcf8be9e965,
title = "Design of turbo codes without 4-cycles in Tanner graph representation for message passing algorithm",
abstract = "Turbo code and Low Density Parity Check (LDPC) code are both recommended as FEC code in many communication standards owing to their impressive error correcting performance. Aiming at the common architecture which can decode both of the two codes, this paper describes the method of decoding turbo codes with message passing algorithm which is conventionally used for LDPC codes. In this method, turbo codes are viewed as block codes and the sparse parity check matrices are constructed through Smith Decomposition or GBT (Generator matrix based transformation). In order to guarantee decoding performance, we propose the criterion of turbo codes with no 4-cycles, which is mathematically proved and demonstrated by the simulation results.",
keywords = "4-cycle, LDPC, message passing, parity check matrix, turbo code",
author = "Ying Cui and Xiao Peng and Satoshi Goto",
year = "2011",
doi = "10.1109/CSPA.2011.5759853",
language = "English",
isbn = "9781612844145",
pages = "108--111",
booktitle = "Proceedings - 2011 IEEE 7th International Colloquium on Signal Processing and Its Applications, CSPA 2011",

}

TY - GEN

T1 - Design of turbo codes without 4-cycles in Tanner graph representation for message passing algorithm

AU - Cui, Ying

AU - Peng, Xiao

AU - Goto, Satoshi

PY - 2011

Y1 - 2011

N2 - Turbo code and Low Density Parity Check (LDPC) code are both recommended as FEC code in many communication standards owing to their impressive error correcting performance. Aiming at the common architecture which can decode both of the two codes, this paper describes the method of decoding turbo codes with message passing algorithm which is conventionally used for LDPC codes. In this method, turbo codes are viewed as block codes and the sparse parity check matrices are constructed through Smith Decomposition or GBT (Generator matrix based transformation). In order to guarantee decoding performance, we propose the criterion of turbo codes with no 4-cycles, which is mathematically proved and demonstrated by the simulation results.

AB - Turbo code and Low Density Parity Check (LDPC) code are both recommended as FEC code in many communication standards owing to their impressive error correcting performance. Aiming at the common architecture which can decode both of the two codes, this paper describes the method of decoding turbo codes with message passing algorithm which is conventionally used for LDPC codes. In this method, turbo codes are viewed as block codes and the sparse parity check matrices are constructed through Smith Decomposition or GBT (Generator matrix based transformation). In order to guarantee decoding performance, we propose the criterion of turbo codes with no 4-cycles, which is mathematically proved and demonstrated by the simulation results.

KW - 4-cycle

KW - LDPC

KW - message passing

KW - parity check matrix

KW - turbo code

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

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

U2 - 10.1109/CSPA.2011.5759853

DO - 10.1109/CSPA.2011.5759853

M3 - Conference contribution

SN - 9781612844145

SP - 108

EP - 111

BT - Proceedings - 2011 IEEE 7th International Colloquium on Signal Processing and Its Applications, CSPA 2011

ER -