%0 Conference Paper %B 1993 Canadian Conference on Electrical and Computer Engineering (Cat. No.93TH0590-0) %D 1993 %T A variable rate constraint length K=5 Viterbi decoder for 12 Mb/s %A Bonek, P %A Ivanov, A %A Kallel, S %C Vancouver, BC, Canada %I IEEE %K application specific integrated circuits,CMOS integrated circuits,codecs,convolutional codes,decoding,digital signal processing chips,maximum likelihood estimation,memory architecture,parallel architectures,VLSI %P 582-5 %U http://dx.doi.org/10.1109/CCECE.1993.332358 %V vol.1 %X Describes a fully testable variable rate Viterbi decoder chip capable of decoding convolutional codes ranging from rate 7/8 to 1/4 derived from the same 1/2 rate code. The architecture of the Viterbi decoder is bit-serial node-parallel to save interconnect area but still achieve high speed decoding. Modulo normalization of the surviving path metrics, arranging the memory elements of the path memory as sets of butterflies, and custom layout are the key for reducing the Si area. Newly developed area efficient testing schemes achieve 99.9\% single stuck-at-fault coverage, while requiring <5\% hardware overhead %9 inproceedings