Spring 2012 – ECE 695C Inference Methods for Codes on Graphs – Lecture Notes

Week 1: L01, L02; Suggested reading: [Poor, H.V., Sections II.A and II.B], Optional reading: [Poor, H.V., Sections II.C to II.E.]
L01: Introduction of coding
L02: MAP, ML, and Chernoff bound

Week 2: L03;
L03: Chernoff bound discussion

Week 3: L04, L05;
L04: KL divergence
L05: Entropy

Week 4: L06, L07; The error rate curves of the Hamming code.
L06: Capacity and binary linear codes
L07: Revisit Hamming codes decoder; Convolutional Codes

Week 5: L08, L09;
L08: Convolutional codes, trellis decoders, VA decoder
L09: VA decoder

Week 6: L10, L11;
L10: BCJR decoder
L11: Factor graph decoder

Week 7: L12, L13;
L12: Factor graph decoder
L13: Message passing decoder

Week 8: L14, L15; The performance of turbo codes (code 1, code 2)
L14: Factor graph for other applications. Turbo codes
L15: Turbo codes and LDPC codes

Week 9: L16, L17;
L16: LDPC decoder
L17: Density evolution

Week 10; L18, L19; (The density evolution paper.)

Week 11; L20, L21;

Week 12; L22, L23;

Week 13; L24, L25;

Week 14; L26;

Week 15; L27, L28;

Reference: Poor, H.V., An Introduction to Signal Detection and Estimation, 2nd Ed.,

Springer.