DESIGN OF A NEW SQUARING FUNCTION FOR THE VITERBI ALGORITHM

An approximate squaring method has been developed for the Viterbi algo rithm that is faster and more area efficient than conventional exact s quaring methods and table look-up. Using Monte-Carlo simulations, it i s shown here that the performance of the Viterbi algorithm is not degr aded using this approximation. The circuit performance is verified by implementing a 7-b approximate squaring function in a 2-mum CMOS proce ss. It operates at a maximum speed of 20 MHz, consumes 95 pW/Hz of pow er, and occupies an active area of 380 mum x 650 mum.