1995
DOI: 10.1109/79.410439
|View full text |Cite
|
Sign up to set email alerts
|

Implementing the Viterbi algorithm

Abstract: he Viterbi algorithm, an application of dynamic programming, is widely used for estimation and detection T problems in digital communications and signal processing. It is used to detect signals in communication channels with memory, and to decode sequential error-control codes that are used to enhance the performance of digital communication systems. The Viterbi algorithm is also used in speech and character recognition tasks where the speech signals or characters are modeled by hidden Markov models. This arti… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
48
0
3

Year Published

2004
2004
2019
2019

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 184 publications
(53 citation statements)
references
References 30 publications
(7 reference statements)
0
48
0
3
Order By: Relevance
“…The expected code symbol along the branch from state to state is derived by the mapping and . In the additive white Gaussian noise channel the optimal distance measure is the squared Euclidean distance (2) However, given the preceding symbol constraints, it is shown in [5] that this measure simplifies to for for (3) and the complete branch metric is then written as (4) III. USING THE COMPLEMENTARY PROPERTY This discussion is restricted to rate 1/2 codes, that is , although the considerations can be generalized to codes.…”
Section: Notationmentioning
confidence: 99%
“…The expected code symbol along the branch from state to state is derived by the mapping and . In the additive white Gaussian noise channel the optimal distance measure is the squared Euclidean distance (2) However, given the preceding symbol constraints, it is shown in [5] that this measure simplifies to for for (3) and the complete branch metric is then written as (4) III. USING THE COMPLEMENTARY PROPERTY This discussion is restricted to rate 1/2 codes, that is , although the considerations can be generalized to codes.…”
Section: Notationmentioning
confidence: 99%
“…The Viterbi algorithm is a formal technique used for finding the single best state sequence. It provides an optimal solution for the problem of estimating the state sequence of HMM (Lou, 1995). For this study, the parameters of the HMM were first defined using an EM algorithm.…”
Section: Methodsmentioning
confidence: 99%
“…According to the existing literature, the first problem (i.e., the problem of finding the most likely explanation for an observation sequence) can be solved efficiently using the Viterbi algorithm (Forney, 1973;Lou, 1995). To adapt that algorithm for our purposes, we have to define the following structures:…”
Section: Hmm Approachmentioning
confidence: 99%