Title :
Design of a new squaring function for the Viterbi algorithm
Author :
Eshraghi, Aria ; Fiez, Terri S. ; Winters, Kel D. ; Fischer, Thomas R.
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Washington State Univ., Pullman, WA, USA
fDate :
9/1/1994 12:00:00 AM
Abstract :
An approximate squaring method has been developed for the Viterbi algorithm that is faster and more area efficient than conventional exact squaring methods and table look-up. Using Monte-Carlo simulations, it is shown here that the performance of the Viterbi algorithm is not degraded using this approximation. The circuit performance is verified by implementing a 7-b approximate squaring function in a 2-μm CMOS process. It operates at a maximum speed of 20 MHz, consumes 95 pW/Hz of power, and occupies an active area of 380 μm×650 μm
Keywords :
CMOS integrated circuits; Monte Carlo methods; decoding; integrated logic circuits; maximum likelihood estimation; 2 micron; 20 MHz; CMOS process; Monte-Carlo simulations; Viterbi algorithm; squaring function; Algorithm design and analysis; Convolutional codes; Decoding; Degradation; Demodulation; Digital communication; Distortion measurement; Euclidean distance; Quantization; Viterbi algorithm;
Journal_Title :
Solid-State Circuits, IEEE Journal of