Viterbi Algorithm for MLSE — Study Resources & PYQs
The Viterbi algorithm for maximum likelihood sequence estimation (MLSE)
- Estimated study time: 90 minutes
Study resources
- Lecture 37: Viterbi Algorithm with Solved Example of Decoding a Code - Convolutional Codes — IEMDaily index (Video) — Lecture 37: Viterbi Algorithm with Solved Example of Decoding a Code - Convolutional Codes — IEMDaily index — selected for the syllabus topic Viterbi Algorithm for MLSE.
- NPTEL An Introduction to Information Theory (Article) — NPTEL course covering entropy, source coding, Huffman coding, channel capacity and noisy-channel coding theorem.
Viterbi Algorithm for MLSE previous year questions
Taught in these subjects
- Information Theory and Coding — ECT-1706 · Government College of Engineering and Technology, Jammu