On Viterbi detector path metric differences

Author

Vityaev, Andrei ; Siegel, Paul H.

Author_Institution

Dept. of Math., Washington Univ., Seattle, WA, USA

Volume

46

Issue

12

fYear

1998

fDate

12/1/1998 12:00:00 AM

Firstpage

1549

Lastpage

1554

Abstract

This letter continues the investigation of methods for computing exact bounds on the path metric differences in maximum-likelihood sequence detectors based upon the Viterbi algorithm. New upper and lower estimates for these bounds are presented and recast in terms of a collection of linear programming problems. These estimates improve upon previously proposed linear programming bounds. The estimates are applied to derive exact bounds or provably close to exact bounds for several Viterbi detectors corresponding to coded and uncoded partial-response channels of practical interest in digital magnetic and optical recording

Keywords

Viterbi detection; channel coding; digital magnetic recording; linear programming; maximum likelihood detection; optical storage; partial response channels; Viterbi detector path metric differences; coded partial-response channels; digital magnetic recording; exact bounds; linear programming; maximum-likelihood sequence detectors; optical recording; uncoded partial-response channels; AWGN; Arithmetic; Circuits; Detectors; Digital recording; Linear programming; Magnetic recording; Maximum likelihood estimation; Optical recording; Viterbi algorithm;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.737388

Filename

737388