Low Complexity Radix-4 Butterfly Design for the Viterbi Decoder

This study presents a new radix-4 butterfly design for Viterbi decoders. The branch symmetry of the radix-4 butterfly is exploited to design a low- complexity radix-4 butterfly module to simplify the implementation of the Viterbi decoder. By exploiting the branch symmetry, only a half of branch metrics need to be computed, while other metrics can be derived from the computed branches. Therefore, the branch metric computation of the radix-4 butterfly can be reduced by a factor of 2. Considering the convolutional code in the DAB system as an example, experimental results indicate that the proposed radix-4 butterfly design can reduce the number of FPGA slices of the radix-4 butterfly module by 24% over the conventional design.

[1]  R.V.K. Pillai,et al.  On high speed add-compare-select for Viterbi decoders , 2001, Canadian Conference on Electrical and Computer Engineering 2001. Conference Proceedings (Cat. No.01TH8555).

[2]  K. X. M. Tzeng,et al.  Convolutional Codes and 'Their Performance in Communication Systems , 1971 .

[3]  Shu Lin,et al.  Error control coding : fundamentals and applications , 1983 .

[4]  E. Casseau,et al.  Architecture of a high-rate VLSI Viterbi decoder , 1996, Proceedings of Third International Conference on Electronics, Circuits, and Systems.

[5]  Hsiao-Hsing Chou,et al.  Design and implementation of a DAB channel decoder , 1999, 1999 Digest of Technical Papers. International Conference on Consumer Electronics (Cat. No.99CH36277).

[6]  H.-L. Lou,et al.  Implementing the Viterbi algorithm , 1995, IEEE Signal Process. Mag..

[7]  P. K. Singh,et al.  A low-complexity, reduced-power Viterbi Algorithm , 1999, Proceedings Twelfth International Conference on VLSI Design. (Cat. No.PR00013).

[8]  Teresa H. Meng,et al.  A 140-Mb/s, 32-state, radix-4 Viterbi decoder , 1992 .