Design of efficient high throughput pipelined parallel turbo decoder using QPP interleaver

This paper introduces a novel energy efficient architecture for a turbo decoder using quadratic permutation polynomial (QPP) interleaver The Add Compare Select Offset (ACSO) unit of the maximum a posteriori probability (MAP) decoder, has been pipelined to a depth of four to reduce the critical path delay and increase the operating clock frequency and throughput as a consequence. The present turbo decoder architecture also benefits from a contention-free quadratic permutation polynomial (QPP) based interleaver, the complexity of which has been considerably reduced by judicious memory partitioning. Typically, as demonstrated in the present work, 32 MAP decoder core can achieve a data rate of 1.138 Gbps at a maximum clock frequency of 486 MHz when implemented in a 90 nm CMOS process.

[1]  Norbert Wehn,et al.  Optimized concurrent interleaving architecture for high-throughput turbo-decoding , 2002, 9th International Conference on Electronics, Circuits and Systems.

[2]  Cheng-Chi Wong,et al.  Turbo Decoder Using Contention-Free Interleaver and Parallel Architecture , 2010, IEEE Journal of Solid-State Circuits.

[3]  A. Giulietti,et al.  Parallel turbo coding interleavers: avoiding collisions in accesses to storage elements , 2002 .

[4]  Oscar Y. Takeshita,et al.  On maximum contention-free interleavers and permutation polynomials over integer rings , 2005, IEEE Transactions on Information Theory.

[5]  P. Urard,et al.  A generic 350 Mb/s turbo-codec based on a 16-states SISO decoder , 2004, 2004 IEEE International Solid-State Circuits Conference (IEEE Cat. No.04CH37519).

[6]  Tobias G. Noll,et al.  A parametrizable low-power high-throughput turbo-decoder , 2005, Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005..

[7]  Naresh R. Shanbhag,et al.  Area-efficient high-throughput MAP decoder architectures , 2005, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[8]  Indrajit Chakrabarti,et al.  An improved low-power high-throughput log-MAP turbo decoder , 2010, IEEE Transactions on Consumer Electronics.

[9]  Patrick Robertson,et al.  A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[10]  Zhongfeng Wang High-Speed Recursion Architectures for MAP-Based Turbo Decoders , 2007, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[11]  Paul Fortier,et al.  Highly-Parallel Decoding Architectures for Convolutional Turbo Codes , 2006, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[12]  Ali Özgür Yilmaz,et al.  Collision free row column S-random interleaver , 2009, IEEE Communications Letters.

[13]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[14]  Brian K. Classon,et al.  Contention-Free Interleavers for High-Throughput Turbo Decoding , 2008, IEEE Transactions on Communications.