6.451 Principles of Digital Communications II (Spring 2005, MIT OCW). Instructor: Professor David Forney.

FREE
This course includes
Hours of videos

694 years, 4 months

Units & Quizzes

25

Unlimited Lifetime access
Access on mobile app
Certificate of Completion

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. (from ocw.mit.edu)

Course Currilcum

  • Lecture 01 – Introduction, Sampling Theorem Unlimited
  • Lecture 02 – Performance of Small Signal Constellations Unlimited
  • Lecture 03 – Hard-decision and Soft-decision Decoding Unlimited
  • Lecture 04 – Hard-decision and Soft-decision Decoding Unlimited
  • Lecture 05 – Introduction to Binary Block Codes Unlimited
  • Lecture 06 – Introduction to Binary Block Codes Unlimited
  • Lecture 07 – Introduction to Finite Fields Unlimited
  • Lecture 08 – Introduction to Finite Fields Unlimited
  • Lecture 09 – Introduction to Finite Fields Unlimited
  • Lecture 10 – Reed-Solomon Codes Unlimited
  • Lecture 11 – Reed-Solomon Codes Unlimited
  • Lecture 12 – Reed-Solomon Codes Unlimited
  • Lecture 13 – Introduction to Convolutional Codes Unlimited
  • Lecture 14 – Introduction to Convolutional Codes Unlimited
  • Lecture 15 – Trellis Representations of Binary Linear Block Codes Unlimited
  • Lecture 16 – Trellis Representations of Binary Linear Block Codes Unlimited
  • Lecture 17 – Codes on Graphs Unlimited
  • Lecture 18 – Codes on Graphs Unlimited
  • Lecture 19 – The Sum-Product Algorithm Unlimited
  • Lecture 20 – Turbo, LDPC, and RA Codes Unlimited
  • Lecture 21 – Turbo, LDPC, and RA Codes Unlimited
  • Lecture 22 – Lattice and Trellis Codes Unlimited
  • Lecture 23 – Lattice and Trellis Codes Unlimited
  • Lecture 24 – Linear Gaussian Channels Unlimited
  • Lecture 25 – Linear Gaussian Channels Unlimited