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-/spl mu/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 /spl mu/m/spl times/650 /spl mu/m.
展开▼
机译：已经为维特比算法开发了一种近似平方方法，该方法比常规的精确平方方法和查表方法更快，面积效率更高。使用蒙特卡洛模拟，这里表明，使用这种近似，维特比算法的性能不会降低。通过在2 / spl mu / m CMOS工艺中实现7-b近似平方功能，可以验证电路性能。它以20 MHz的最大速度运行，消耗95 pW / Hz的功率，并占据380 / spl mu / m / spl乘以/ 650 / spl mu / m的有效面积。
展开▼
