Towards an optimal parallel decoding of turbo codes

High throughput decoding of turbo-codes can be achieved thanks to parallel decoding. However, for finite block sizes, the initialisation duration of each half-iteration reduces the activity of the processing units, especially for higher degrees of parallelism. To solve this issue, a new decoding scheduling is proposed, with a partial processing overlapping of two successive half iterations. Potential memory conflicts introduced by this new scheduling are solved by a constrained interleaver design. An example of application of the proposed technique shows that the complexity of the decoder is reduced by 25 % compared to a conventional approach.

[1]  Norbert Wehn,et al.  Concurrent interleaving architectures for high-throughput channel coding , 2003, 2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03)..

[2]  Sergio Benedetto,et al.  A soft-input soft-output maximum a posteriori (MAP) module to decode parallel and serial concatenated codes , 1996 .

[3]  David Gnaedig.  High-Speed decoding of convolutional Turbo Codes , 2005 .

[4]  J. Zhang,et al.  Reduced latency turbo decoding , 2005, IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005..

[5]  Vincent C. Gaudet,et al.  On multiple slice turbo codes , 2005, Ann. des Télécommunications.

[6]  Claude Berrou,et al.  Organisation de la mémoire dans un turbo décodeur utilisant l'algorithme SUB-MAP , 1999 .

[7]  Sergio Benedetto,et al.  Mapping interleaving laws to parallel turbo and LDPC decoder architectures , 2004, IEEE Transactions on Information Theory.

[8]  Francky Catthoor,et al.  Memory optimization of MAP turbo decoder algorithms , 2001, IEEE Trans. Very Large Scale Integr. Syst..

[9]  Claude Berrou,et al.  Designing good permutations for turbo codes: towards a single model , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[10]  P. Glenn Gulak,et al.  VLSI architectures for the MAP algorithm , 2003, IEEE Trans. Commun..