Exact bounds for Viterbi detector path metric differences
Authors:
- 1 January 1991
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15206149,p. 1093-1096 vol.2
Abstract
The authors address the problem of computing exact bounds on the path metric differences in maximum-likelihood sequence detectors based upon the Viterbi algorithm. The calculation of the bounds is formulated as a series of linear programming problems. Numerical results are presented for several examples of uncoded and coded partial-response channels of practical interest in digital data recording applications.Keywords
This publication has 6 references indexed in Scilit:
- Matched spectral-null codes for partial-response channelsIEEE Transactions on Information Theory, 1991
- A 30MHz Trellis CODEC Chip For Partial-response Channels1991
- VLSI architectures for metric normalization in the Viterbi algorithm1990
- An alternative to metric rescaling in Viterbi decodersIEEE Transactions on Communications, 1989
- The viterbi algorithmProceedings of the IEEE, 1973
- Optimal Reception for Binary Partial Response ChannelsBell System Technical Journal, 1972