On Viterbi detector path metric differences

DOI10.1109/26.737388MaRDI QIDQ2714815zbMATH OpenOpenAlexFDO

Authors Andrei Vityaev, Paul Siegel

Publication date 14 August 2001

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/f990069de43411cb48715b0177f8103abbe5b6a5

zbMATH Keywords

boundslinear programmingmaximum-likelihood sequence detectorspartial-response channelspath metric differencesViterbi algorithmViterbi detectors

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Detection theory in information and communication theory (94A13) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• The Viterbi algorithm and Markov noise memory
• Breadth-first maximum likelihood sequence detection: Basics
• On Viterbi-like algorithms and their application to Reed-Muller codes
• Maximum likelihood sequence estimation from the lattice viewpoint
• Maximum likelihood sequence detection for intersymbol interference channels: A new upper bound on error probability

Cited in

(1)

• The Viterbi algorithm and Markov noise memory

This page was built for publication: On Viterbi detector path metric differences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2714815)