Computer architecture for commercial workloads
Honesty C. Young, Wen-Hann Wang
ACSSC 1992
In the digital implementations of maximumlikelihood detectors based upon the Viterbi algorithm, bounds on the values of path metric differences are important parameters, and various techniques have been proposed for computing such bounds. This paper addresses the more general problem of characterizing the entire space of path metric differences, achievable from a given initial state, and calculating the probability density for the differences as a function of the distribution of the (noisy) channel output samples. Explicit results are given for two examples of interest in digital recording.
Honesty C. Young, Wen-Hann Wang
ACSSC 1992
Razmik Karabed, Paul Siegel
ISIT 1991
Paul Siegel, Brian Marcus
IEEE Transactions on Magnetics
Gee-Gwo Mark Mei, Min-Hsiung Lin, et al.
ACSSC 1992