Decoding inter-block permuted turbo codes based on multi-stage factor graphs

Konferenz: TURBO - CODING - 2006 - 4th International Symposium on Turbo Codes & Related Topics; 6th International ITG-Conference on Source and Channel Coding
03.04.2006 - 07.04.2006 in Munich, Germany

Tagungsband: TURBO - CODING - 2006

Seiten: 6Sprache: EnglischTyp: PDF

Persönliche VDE-Mitglieder erhalten auf diesen Artikel 10% Rabatt

Yan-Xiu, Zheng; Su, Yu T. (Department of Communications Engineering, National Chiao Tung University, Hsinchu, 30056, Taiwan)

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.