A new architecture for the Viterbi decoder for code rate k/n

A novel VLSI architecture is proposed for implementing a long constraint length Viterbi decoder (VD) for code rate k/n. This architecture is based on the encoding structure where k input bits are shifted into k shift registers in each cycle. The architecture is designed in a hierarchical manner by breaking the system into several levels and designing each level independently. The tasks in the design of each level range from determining the number of computation units, and the interconnection between the units, to the allocation and scheduling of operations. Additional design issues such as in-place storage of accumulated path metrics and trace back implementation of the survivor memory have also been addressed. The resulting architecture is regular, has a foldable global topology and is very flexible. It also achieves a better than linear trade-off between hardware complexity and computation time.

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

[2]  Robert Cypher,et al.  Generalized trace-back techniques for survivor memory management in the Viterbi algorithm , 1993, J. VLSI Signal Process..

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

[4]  Paul H. Siegel,et al.  Area-efficient architectures for the Viterbi algorithm. I. Theory , 1993, IEEE Trans. Commun..

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

[6]  Jens Sparsø,et al.  An area-efficient topology for VLSI implementation of Viterbi decoders and other shuffle-exchange type structures , 1991 .

[7]  Teresa H. Meng,et al.  A unified approach to the Viterbi algorithm state metric update for shift register processes , 1992, [Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[8]  Kung Yao,et al.  Systolic array processing of the Viterbi algorithm , 1989, IEEE Trans. Inf. Theory.

[9]  Thomas Kailath,et al.  Locally connected VLSI architectures for the Viterbi algorithm , 1988, IEEE J. Sel. Areas Commun..

[10]  Shuji Kubota,et al.  Novel Viterbi decoder VLSI implementation and its performance , 1993, IEEE Trans. Commun..

[11]  P. G. Gulak,et al.  Survivor sequence memory management in Viterbi decoders , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

[12]  P. Glenn Gulak,et al.  A multiprocessor architecture for Viterbi decoders with linear speedup , 1993, IEEE Trans. Signal Process..

[13]  C. B. Shung,et al.  General in-place scheduling for the Viterbi algorithm , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.

[14]  P. Glenn Gulak,et al.  VLSI Structures for Viterbi Receivers: Part I-General Theory and Applications , 1986, IEEE J. Sel. Areas Commun..