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

Keywords

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

ASJC Scopus subject areas

  • Signal Processing

Fingerprint Dive into the research topics of 'Design of turbo codes without 4-cycles in Tanner graph representation for message passing algorithm'. Together they form a unique fingerprint.

Cite this