MIT 6.451 Principles of Digital Communication II

This course is the second of a two-term sequence with 6.450. The focus is on coding techniques for approaching the Shannon limit of additive white Gaussian noise (AWGN) channels, their performance analysis, and design principles. After a review of 6.450 and the Shannon limit for AWGN channels, the course begins by discussing small signal constellations, performance analysis and coding gain, and hard-decision and soft-decision decoding. It continues with binary linear block codes, Reed-Muller codes, finite fields, Reed-Solomon and BCH codes, binary linear convolutional codes, and the Viterbi algorithm. http://ocw.mit.edu

Lecture Notes

Special software is required to use some of the files in this section: .mp4, .rm.

The course notes are written by Prof. David Forney, and are organized by chapter. In addition to downloadable lecture notes, video files of each lecture are provided below.

LEC #	CHAPTERS	TOPICS
1	1-3	Introduction - Sampling Theorem and Orthonormal PAM/QAM - Capacity of AWGN Channels
2	4	Performance of Small Signal Constellations
3	5	Hard-decision and Soft-decision Decoding
4	5	Hard-decision and Soft-decision Decoding cont.
5	6	Introduction to Binary Block Codes
6	6	Introduction to Binary Block Codes cont.
7	7	Introduction to Finite Fields
8	7	Introduction to Finite Fields cont.
9	7	Introduction to Finite Fields cont.
10	8	Reed-Solomon Codes
11	8	Reed-Solomon Codes cont.
12	8	Reed-Solomon Codes cont.
13	9	Introduction to Convolutional Codes
14	9	Introduction to Convolutional Codes cont.
15	10	Trellis Representations of Binary Linear Block Codes
16	10	Trellis Representations of Binary Linear Block Codes cont.
17	11	Codes on Graphs
18	11	Codes on Graphs cont.
19	12	The Sum-Product Algorithm
20	13	Turbo, LDPC, and RA Codes
21	13	Turbo, LDPC, and RA Codes cont.
22	14	Lattice and Trellis Codes
23	14	Lattice and Trellis Codes cont.
24	15	Linear Gaussian Channels
25	15	Linear Gaussian Channels cont.