About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ICC 1990
Conference paper
VLSI architectures for metric normalization in the Viterbi algorithm
Abstract
In the realization of Viterbi decoders with finite precision arithmetic, the values of the survivor metrics computed by the add-compare-select (ACS) recursion must remain within a finite numerical range to avoid catastrophic overflow (or underflow) situations. In the present work, the authors compare several metric normalization techniques which are suitable for VLSI implementations with fixed-point arithmetic. The modulo technique is found to be the most local and uniform approach. An efficient VLSI design of the ACS units based on this technique is discussed. The modified comparison rule is found to produce a more efficient ACS architecture than previous results based on subtraction.