Error-Correcting Codes Laboratory

Graph of density evolution of LDPC code on BEC.

Graph of density evolution of LDPC code on BEC. (Image courtesy of Prof. Daniel Spielman.)

Instructor(s)

MIT Course Number

18.413

As Taught In

Spring 2004

Level

Undergraduate

Cite This Course

Course Features

Course Description

This course introduces students to iterative decoding algorithms and the codes to which they are applied, including Turbo Codes, Low-Density Parity-Check Codes, and Serially-Concatenated Codes. The course will begin with an introduction to the fundamental problems of Coding Theory and their mathematical formulations. This will be followed by a study of Belief Propagation--the probabilistic heuristic which underlies iterative decoding algorithms. Belief Propagation will then be applied to the decoding of Turbo, LDPC, and Serially-Concatenated codes. The technical portion of the course will conclude with a study of tools for explaining and predicting the behavior of iterative decoding algorithms, including EXIT charts and Density Evolution.

Spielman, Daniel. 18.413 Error-Correcting Codes Laboratory, Spring 2004. (MIT OpenCourseWare: Massachusetts Institute of Technology), http://ocw.mit.edu/courses/mathematics/18-413-error-correcting-codes-laboratory-spring-2004 (Accessed). License: Creative Commons BY-NC-SA


For more information about using these materials and the Creative Commons license, see our Terms of Use.


Close