Exact bounds for Viterbi detector path metric differences

Exact bounds for Viterbi detector path metric differences

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 exam...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Siegel, P.H., Shung, C.B., Howell, T.D., Thapar, H.K.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Data communication
Detectors
Digital modulation
Digital recording
Linear programming
Magnetic modulators
Maximum likelihood detection
Maximum likelihood estimation
Very large scale integration
Viterbi algorithm
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.< >
ISSN:1520-6149
2379-190X
DOI:10.1109/ICASSP.1991.150552