A high-speed MAP architecture with optimized memory size and power consumption

This paper presents a novel high-speed maximum a posteriori (MAP) decoder architecture with optimized memory size and power consumption. Area and power consumption are both reduced significantly, compared to the state-of-the-art. The architecture is also capable of decoding recursive systematic convolutional codes which are the constituent codes of the revolutionary turbo-codes and related concatenation schemes. The architecture is highly scalable with respect to throughput, expanding its applicability over a wide range of throughput requirements (300 Mbit/s-45 Gbit/s and above).

[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]  Herbert Dawid Algorithmen und Schaltungsarchitekturen zur Maximum a Posteriori Faltungsdecodierung , 1996 .

[3]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .

[4]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[5]  Joachim Hagenauer,et al.  A Viterbi algorithm with soft-decision outputs and its applications , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[6]  H. Meyr,et al.  Map channel decoding: Algorithm and VLSI architecture , 1993, Proceedings of IEEE Workshop on VLSI Signal Processing.

[7]  Patrick Robertson,et al.  Optimal and sub-optimal maximum a posteriori algorithms suitable for turbo decoding , 1997, Eur. Trans. Telecommun..

[8]  Francky Catthoor,et al.  Custom Memory Management Methodology , 1998, Springer US.