MIT OCW 6.451 Principles of Digital Communication II Spring 05

==Course Description 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. More advanced topics include trellis representations of binary linear block codes and trellis-based decoding; codes on graphs; the sum-product and min-sum algorithms; the BCJR algorithm; turbo codes, LDPC codes and RA codes; and performance of LDPC codes with iterative decoding. Finally, the course addresses coding for the bandwidth-limited regime, including lattice c

本课程为6.450课程的第二学期课程，属于双学期课程序列的第二部分。课程重点在于探讨逼近加性高斯白噪声（AWGN）信道香农极限的编码技术、性能分析以及设计原则。在回顾6.450课程以及AWGN信道的香农极限之后，课程首先讨论小信号星座图、性能分析和编码增益，以及硬决策和软决策解码。随后，课程将继续探讨二元线性分组码、里德-穆勒码、有限域、里德-所罗门码和循环码、二元线性卷积码以及维特比算法。更高级的主题包括二元线性分组码的格形表示及其基于格形的解码；图上的码；求和-积算法和最小-和算法；BCJR算法；涡轮码、低密度奇偶校验码（LDPC）和RA码；以及具有迭代解码的低密度奇偶校验码的性能。最后，课程将讨论带宽受限情况下的编码问题。