论文信息 - A Low Complexity Block Turbo Decoder Architecture - 字舞流文

A Low Complexity Block Turbo Decoder Architecture

We present a low-complexity architecture designed for the decoding of block turbo codes. In particular we simplify the implementation of Pyndiah’s algorithm by not memorizing any of the concurrent codewords generated by the Chase search.

Benoit Geller | Jean-Marc Brossier | Christophe Vanstraceele

[1] Ramesh Pyndiah,et al. Near-optimum decoding of product codes: block turbo codes , 1998, IEEE Trans. Commun..

[2] David Chase,et al. Class of algorithms for decoding block codes with channel measurement information , 1972, IEEE Trans. Inf. Theory.

[3] Ramesh Pyndiah,et al. How we implemented block turbo codes? , 2001, Ann. des Télécommunications.

[4] Joachim Hagenauer,et al. Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.

[5] Christophe Vanstraceele. Turbo codes et estimation paramétrique pour les communications à haut débit , 2005 .

[6] Steven W. McLaughlin,et al. A parallel decoder for low latency decoding of turbo product codes , 2002, IEEE Communications Letters.

[7] Bahram Honary,et al. Fast Chase algorithm with an application in turbo decoding , 2001, IEEE Trans. Commun..