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.
Conference paper
Generalized trace back techniques for survivor memory management in the Viterbi algorithm
Abstract
A general framework for designing survivor memory based on the trace-back technique with any number of trace-back pointers is presented. It is shown that the memory size is reduced by using more trace-back pointers and that a uniform speed realization can be achieved with more than one trace back pointer. Two implementations of the K-pointer trace-back techniques based on standard RAMs and custom-shift registers are presented.