|
|
马上注册，结交更多好友，享用更多功能，让你轻松玩转社区。
您需要 登录 才可以下载或查看，没有账号？注册
x
麻省理工讲义 Principles of Digital Communication II, Spring 2005
課程描述
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 codes, trellis-coded modulation, multilevel coding and shaping. If time permits, it covers equalization of linear Gaussian channels.
Introduction (PDF)
Sampling Theorem and Orthonormal PAM/QAM (PDF) Capacity of AWGN Channels (PDF)
Performance of Small Signal Constellations (PDF)
Hard-decision and Soft-decision Decoding (PDF)
Introduction to Binary Block Codes (PDF)
Introduction to Finite Fields (PDF)
Reed-Solomon Codes (PDF)
Introduction to Convolutional Codes (PDF)
Trellis Representations of Binary Linear Block Codes (PDF)
Codes on Graphs (PDF)
The Sum-Product Algorithm (PDF)
Turbo, LDPC, and RA Codes (PDF)
Lattice and Trellis Codes (PDF) |
|
/1 
eetop公众号
创芯大讲堂
创芯人才网
发表于 2009-5-14 19:46:08
