Iterative Viterbi decoding: Difference between revisions

Browse history interactively

← Previous edit

Content deleted Content added

VisualWikitext

Revision as of 05:43, 26 July 2008 edit Edward (talk \| contribs) Administrators 94,541 edits m link distance matrix using Find link ← Previous edit		Latest revision as of 13:00, 1 December 2020 edit undo Monkbot (talk \| contribs) Bots 3,695,952 edits m Task 18 (cosmetic): eval 2 templates: del empty params (2×); Tag: AWB
(7 intermediate revisions by 5 users not shown)
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 ~~decodage~~décodage de treillis selon le ~~critere~~critère de ~~cout~~coût moyen pour la reconnaissance de la parole", TALN 2001. ==Further reading== {{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:Markov models]]