Decoding inter-block permuted turbo codes based on multistage factor graphs

Zheng Yan-Xiu, Yu T. Su

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Inter-block permuted turbo codes (IBPTC) provide significant performance gain over the conventional turbo codes (TC) without increasing the encoding and average decoding latencies. The major shortcoming is the increased memory requirement. A new decoding schedule is proposed to reduce both the memory requirement and the decoding latency. We present a multi-stage factor graph and sub-graph approach to describe the schedule and message-passing flow of an IBPTC decoder. Evaluating the effect of the finite iteration number on the decoder performance becomes feasible through the use of such graphs. The proposed graphic approach can be applied to find more efficient (in terms of computing complexity and storage) decoding schedules for other iterative decoders as well.

Original languageEnglish
Title of host publicationTURBO - CODING 2006 - 4th International Symposium on Turbo Codes and Related Topics and 6th International ITG-Conference on Source and Channel Coding
PublisherVDE Verlag GmbH
ISBN (Electronic)3800729474, 9783800729470
StatePublished - 2006
Event4th International Symposium on Turbo Codes and Related Topics and 6th International ITG-Conference on Source and Channel Coding, TURBOCODING 2006 - Munich, Germany
Duration: 3 Apr 20067 Apr 2006

Publication series

NameTURBO - CODING 2006 - 4th International Symposium on Turbo Codes and Related Topics and 6th International ITG-Conference on Source and Channel Coding

Conference

Conference4th International Symposium on Turbo Codes and Related Topics and 6th International ITG-Conference on Source and Channel Coding, TURBOCODING 2006
CountryGermany
CityMunich
Period3/04/067/04/06

Fingerprint Dive into the research topics of 'Decoding inter-block permuted turbo codes based on multistage factor graphs'. Together they form a unique fingerprint.

Cite this