Live briefing
Everything about Iterative Viterbi decoding
Algorithm
Iterative Viterbi decoding is an algorithm that spots the subsequence S of an observation O = {o1, ..., on} having the highest average probability of being generated by a given hidden Markov model M with m states. The algorithm uses a modified Viterbi algorithm as an internal step. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Iterative Viterbi decodingA 5-minute orientation
- Read the landmark paper: Iterative Viterbi decoding, trellis shaping, and multilevel structure for high-rate parity-concatenated TCMCited 18 times
- Go sideways: Viterbi algorithmA closely related topic
- Go sideways: Concatenated error correction codeA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Iterative Viterbi decoding, trellis shaping, and multilevel structure for high-rate parity-concatenated TCM
Iterative Decoding between Two-Dimensional Soft Output Viterbi Algorithm and Error Correcting Modulation Code for Holographic Data Storage
Iterative Decoding between Two-Dimensional Soft Output Viterbi Algorithm and Error Correcting Modulation Code for Holographic Data Storage
Performance Review of Serially Concatenated RSC-RSC Codes using Non-iterative Viterbi Decoding Technique
đź“š Books worth reading
Open Library didn't respond; try again in a moment.
đź”— Related topics
- Viterbi algorithm The Viterbi algorithm is a dynamic programming algorithm that finds the most likely sequence of hidden events that would explain a sequence of observed…
- Concatenated error correction code In coding theory, concatenated codes form a class of error-correcting codes that are derived by combining an inner code and an outer code. They were conceived…
- Turbo code In information theory, turbo codes are a class of high-performance forward error correction (FEC) codes developed around 1990–91, but first published in…
- Decoding methods In coding theory, decoding is the process of translating received messages into codewords of a given code. There have been many common methods of mapping…
- BCJR algorithm The Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm is an algorithm for maximum a posteriori decoding of error correcting codes defined on trellises (principally…
- Berlekamp–Massey algorithm The Berlekamp–Massey algorithm is an algorithm that will find the shortest linear-feedback shift register (LFSR) for a given binary output sequence. The…
- Noise-predictive maximum-likelihood detection Noise-Predictive Maximum-Likelihood (NPML) is a class of digital signal-processing methods suitable for magnetic data storage systems that operate at high…
- Levenshtein distance In information theory, linguistics, and computer science, the Levenshtein distance is a string metric for measuring the difference between two sequences…