Viterbi Lattice Decoding Algorithm: Difference between revisions

From GM-RKB
Jump to navigation Jump to search
m (Text replacement - "** ..." to "** …")
m (Text replacement - ". ----" to ". ----")
 
Line 10: Line 10:
** a [[Mixed Integer Programming Algorithm]].
** a [[Mixed Integer Programming Algorithm]].
* <B>See:</B> [[Hidden Markov Modeling Algorithm]], [[Shortest-Path Search Algorithm]].
* <B>See:</B> [[Hidden Markov Modeling Algorithm]], [[Shortest-Path Search Algorithm]].
----
----
----
----

Latest revision as of 03:28, 24 September 2021

A Viterbi Lattice Decoding Algorithm is a dynamic programming-based beam-search optimal lattice-path algorithm that can locate a Viterbi lattice optimal path.



References

2012

2011

1989

1967

  • (Viterbi, 1967) ⇒ A. J. Viterbi. (1967). “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm". IEEE Transactions on Information Theory 13 (2): 260–269. DOI:10.1109/TIT.1967.1054010. (note: the Viterbi decoding algorithm is described in section IV.) Subscription required.