Lecture

Convolutional Codes & Viterbi Decoder

Description

This lecture covers Convolutional Codes, which transform information sequences into coded symbols with memory, and the Viterbi Algorithm for low-complexity decoding. It explains the state diagram and trellis diagram representations, the branch metric computation, and the state metric updates. The Viterbi Algorithm is detailed, including branch and state metric computations, and the traceback process. The lecture also discusses the high-level architecture of the Viterbi Algorithm, state metric computation using Add Compare Select (ACS), and examples of forward and backward iterations. It concludes with insights on limiting the survivor path length in large code blocks.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.