Viterbi Algorithm

The Viterbi Algorithm is a dynamic programming algorithm that, as a method for decoding the most likely sequence of hidden states in a Hidden Markov Model, distinguishes itself by maximizing the joint probability of the state sequence given a sequence of observations.

1.8K

Publications

123.2K

Citations

3.9K

Authors

1K

Institutions

Publications per year

2017–2026

208

Authors

3.9K

  1. HM
    H. Meyr

    RWTH Aachen University, Germany

    15 publications · 672 citations

    13

    h-index

  2. PH
    Paul H. Siegel

    University of California San Diego, United States

    15 publications · 623 citations

    13

    h-index

  3. HT
    H.K. Thapar

    IBM (United States), United States

    13 publications · 435 citations

    13

    h-index

  4. GC
    Giulio Colavolpe

    University of Parma, Italy

    12 publications · 606 citations

    12

    h-index

  5. RR
    R. Raheli

    University of Parma, Italy

    12 publications · 1.2K citations

    11

    h-index

1–5 of 3.9K

Venues

  1. IEEE Transactions on Communications

    137 publications · 11.1K citations

    49

    h-index

  2. IEEE Transactions on Information Theory

    68 publications · 19.3K citations

    34

    h-index

  3. IEEE Journal on Selected Areas in Communications

    36 publications · 2.6K citations

    24

    h-index

  4. IEEE Transactions on Magnetics

    41 publications · 1.4K citations

    21

    h-index

  5. IRE Transactions on Communications Systems

    30 publications · 3.4K citations

    20

    h-index

1–5