Title :
A new architecture for the Viterbi decoder for code rate k/n
Author :
Li, Hsiang-Ling ; Chakrabarti, Chaitali
Author_Institution :
Dept. of Electr. Eng., Arizona State Univ., Tempe, AZ, USA
fDate :
2/1/1996 12:00:00 AM
Abstract :
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
Keywords :
VLSI; Viterbi decoding; digital signal processing chips; maximum likelihood decoding; processor scheduling; trellis codes; VLSI architecture; accumulated path metrics; code rate k/n; computation time; computation units; design issues; encoding structure; foldable global topology; hardware complexity; in-place storage; interconnection; long constraint length Viterbi decoder; operation allocation; operation scheduling; shift registers; survivor memory; trace back implementation; Computer architecture; Computer hacking; Convolutional codes; Encoding; Hardware; Maximum likelihood decoding; Processor scheduling; Shift registers; Very large scale integration; Viterbi algorithm;
Journal_Title :
Communications, IEEE Transactions on