Iterative Viterbi decoding: Difference between revisions

Revision as of 21:56, 24 May 2007

Latest revision as of 13:00, 1 December 2020

(9 intermediate revisions by 7 users not shown)

Line 11:

<pre>

// input is placed in observation s[1..n], template t[1..m],

// and [[distance matrix]] d[1..n,1..m]

// remaining elements in matrices are solely for internal computations

(int, int, int) AverageSubmatchDistance(char s[0..(n+1)], char t[0..(m+1)], int d[1..n,0..(m+1)]) {

Line 35:

== References ==

* Silaghi, M., "Spotting Subsequences matching a HMM using the Average Observation Probability Criteria with application to Keyword Spotting", AAAI, 2005.

* Rozenknop, Antoine, and Silaghi, Marius; "Algorithme de decodagedécodage de treillis selon le criterecritère de coutcoût moyen pour la reconnaissance de la parole", TALN 2001.

==Further reading==

[[Category:Algorithms]]

*{{cite conference |title=An Efficient Code Structure of Block Coded Modulations with Iterative Viterbi Decoding Algorithm |last1=Li |first1=Huan-Bang |last2=Kohno |first2=Ryuji |date=2006 |publisher=IEEE |___location=Valencia, Spain |conference=3rd International Symposium on Wireless Communication Systems |isbn=978-1-4244-0397-4 |doi=10.1109/ISWCS.2006.4362391}}

*{{cite journal|last1=Wang |first1=Qi |last2=Wei |first2=Lei |last3=Kennedy |first3=R.A. |title=Iterative Viterbi decoding, trellis shaping, and multilevel structure for high-rate parity-concatenated TCM |journal=IEEE Transactions on Communications |volume=50 |number=1 |date=January 2002 |pages=48–55 |issn=0090-6778 |doi=10.1109/26.975743 }}

[[Category:Error detection and correction]]

[[Category:AlgorithmsMarkov models]]