A low complex parallel decoding structure for turbo-codes

The Max-Log-MAP (MLM) algorithm is simple for turbo code decoding. Based on the algorithm a parallel array structure for turbo code decoding is suggested, which is easy to implement by VLSI. In this structure, flow direction of dates and computation process of the algorithm are obtained, the relation of nodes and date frames are analyzed, and the simple time sequencing of date operation is presented. The structure is proved by simulation.

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

[2]  Wolfgang Koch,et al.  Optimum and sub-optimum detection of coded data disturbed by time-varying intersymbol interference (applicable to digital mobile radio receivers) , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[3]  Subbarayan Pasupathy,et al.  Reduced complexity symbol detectors with parallel structures , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

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

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