7. Viterbi decoding

From the creator

MIT 6.02 Introduction to EECS II: Digital Communication Systems, Fall 2012 View the complete course: http://ocw.mit.edu/6-02F12 Instructor: George Verghese This lecture starts with a review of encoding and decoding. The Viterbi algorithm, which includes a branch netric and a path metric, is introduced as a way to find the maximum-likelihood path during decoding. License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

Published 2014-03-18 · Watch on YouTube ↗
Availability and playback restrictions are controlled by the original channel.