Conventional Architecture of Turbo Decoder

When digital circuits and storage elements are exploited to perform the theoretical algorithm, we should pay attention to how the cycle-based process and resource limitation affect the turbo decoding. During the implementation, the hardware cost is of top priority. Our targets are usually fast processing speed and great decoding performance at the least expense of hardware. Of course those techniques toward lower complexity in the previous chapter will be applied. The practical design contains several functional units for the major computations in the simplified algorithm; besides, it needs a few control units to handle the data flow for the sliding window method and the message propagation between two constituent codes. These internal devices will run a variety of arithmetic operations. Among all the operations, the multiplication and division should be avoided because their corresponding circuits take much longer execution time and much larger hardware resource. In this chapter, we introduce the major component circuits of a practical turbo decoder at first. Then we shift the focus to the conventional architecture of the SISO decoder as well as its processing schedule. Based on such a prototype, the design issues about replacing the floating-point data with fixed-point data are highlighted. It is possible that the loss of precision gives rise to performance degradation. On the other hand, the bit number for data expression, also called data width, dominates the hardware cost. Thus, the choice of adequate data width is dependent on both the required performance and acceptable overhead. The subsequent discussions address the potential overflow problem and show the effects of several solutions. At the end of the chapter, two modified SISO decoders that have advantages such as shorter latency or less hardware over the conventional one are presented.

[1]  Gibong Jeong,et al.  Optimal quantization for soft-decision turbo decoder , 1999, Gateway to 21st Century Communications Village. VTC 1999-Fall. IEEE VTS 50th Vehicular Technology Conference (Cat. No.99CH36324).

[2]  Heinrich Meyr,et al.  Real-time algorithms and VLSI architectures for soft output MAP convolutional decoding , 1995, Proceedings of 6th International Symposium on Personal, Indoor and Mobile Radio Communications.

[3]  Yufei W. Blankenship,et al.  Data width requirements in SISO decoding with module normalization , 2001, IEEE Trans. Commun..

[4]  Yeheskel Bar-Ness,et al.  A parallel MAP algorithm for low latency turbo decoding , 2002, IEEE Communications Letters.

[5]  Andries P. Hekstra,et al.  An alternative to metric rescaling in Viterbi decoders , 1989, IEEE Trans. Commun..

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

[7]  Tughrul Arslan,et al.  High speed max-log-MAP turbo SISO decoder implementation using branch metric normalization , 2005, IEEE Computer Society Annual Symposium on VLSI: New Frontiers in VLSI Design (ISVLSI'05).

[8]  Andrew J. Viterbi,et al.  Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.

[9]  Inkyu Lee,et al.  A new architecture for the fast Viterbi algorithm , 2003, IEEE Trans. Commun..

[10]  Johan Eilert,et al.  Memory Conflict Analysis and Implementation of a Re-configurable Interleaver Architecture Supporting Unified Parallel Turbo Decoding , 2010, J. Signal Process. Syst..

[11]  Gianluca Piccinini,et al.  Architectural strategies for low-power VLSI turbo decoders , 2002, IEEE Trans. Very Large Scale Integr. Syst..