论文信息 - Design of a new squaring function for the Viterbi algorithm

Design of a new squaring function for the Viterbi algorithm

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. >

[1] Yariv Ephraim,et al. Statistical-model-based speech enhancement systems , 1992, Proc. IEEE.

[2] Michael W. Marcellin,et al. Trellis coded quantization of memoryless and Gauss-Markov sources , 1990, IEEE Trans. Commun..

[3] Jr. G. Forney,et al. The viterbi algorithm , 1973 .

[4] Richard R. Spencer. Simulated Performance of Analog Viterbi Detectors , 1992, IEEE J. Sel. Areas Commun..

[5] Stuart E. Dreyfus,et al. Applied Dynamic Programming , 1965 .

[6] J. Canaris,et al. Cellular logic array for computation of squares , 1991 .

[7] Andrew J. Viterbi,et al. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.

[8] Haomin Wu,et al. A new design of the CMOS full adder , 1992 .

[9] Kai Hwang,et al. Computer arithmetic: Principles, architecture, and design , 1979 .

[10] G. David Forney. Trellis shaping , 1992, IEEE Trans. Inf. Theory.

[11] G. Ungerboeck,et al. Trellis-coded modulation with redundant signal sets Part I: Introduction , 1987, IEEE Communications Magazine.