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

Ying Cui; Xiao Peng; Satoshi Goto

doi:10.1109/CSPA.2011.5759853

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

Ying Cui^*, Xiao Peng, Satoshi Goto

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Proceedings - 2011 IEEE 7th International Colloquium on Signal Processing and Its Applications, CSPA 2011
Pages	108-111
Number of pages	4
DOIs	https://doi.org/10.1109/CSPA.2011.5759853
Publication status	Published - 2011
Event	2011 IEEE 7th International Colloquium on Signal Processing and Its Applications, CSPA 2011 - Penang Duration: 2011 Mar 4 → 2011 Mar 6

Other

Other	2011 IEEE 7th International Colloquium on Signal Processing and Its Applications, CSPA 2011
City	Penang
Period	11/3/4 → 11/3/6

Keywords

4-cycle
LDPC
message passing
parity check matrix
turbo code

ASJC Scopus subject areas

Signal Processing

Access to Document

10.1109/CSPA.2011.5759853

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

@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",

note = "2011 IEEE 7th International Colloquium on Signal Processing and Its Applications, CSPA 2011 ; Conference date: 04-03-2011 Through 06-03-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

AN - SCOPUS:79957520677

SN - 9781612844145

SP - 108

EP - 111

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

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

Y2 - 4 March 2011 through 6 March 2011

ER -

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

Abstract

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this