Parallel VLSI architecture for MAP turbo decoder

Turbo codes achieve performance near the Shannon limit. Standard sequential VLSI implementation of turbo decoding requires large memory and incurs a long latency, which cannot be tolerated in some applications. A novel parallel VLSI architecture for turbo decoding is described, comprising multiple SISO (soft-in soft-out) elements, operating jointly on one turbo coded block, and a new parallel interleaver. Latency is reduced up to twenty times and throughput for large blocks is increased up to five-fold relative to sequential decoders, using the same area of silicon, and achieving the same coding gain. The parallel architecture scales favourably - latency and throughput improve with growing block size and chip area.

[1]  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.

[2]  M. Engels,et al.  Optimized MAP turbo decoder , 2000, 2000 IEEE Workshop on SiGNAL PROCESSING SYSTEMS. SiPS 2000. Design and Implementation (Cat. No.00TH8528).

[3]  S. A. Barbulescu Sliding window and interleaver design , 2001 .

[4]  Alain Glavieux,et al.  Reflections on the Prize Paper : "Near optimum error-correcting coding and decoding: turbo codes" , 1998 .

[5]  Peter A. Beerel,et al.  A low latency SISO with application to broadband turbo decoding , 2001, IEEE J. Sel. Areas Commun..

[6]  Massimo Ruo Roch,et al.  VLSI architectures for turbo codes , 1999, IEEE Trans. Very Large Scale Integr. Syst..

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