EE 388 : Syllabus
The basic philosophy of the course is:
Most of the ideas in modern coding are very intuitive and natural.
If someone had not invented them a few years ago, you could invent them yourself.
The main focus will be on: (i) Codes based on sparse graph constructions; (ii) Iterative decoding algorithms. For these topics a useful reference is the text book by Tom Richardson and Rudi Urbanke. For other topics (eg spatial coupling and polar codes) we will use handouts and original papers.
Here is a rough syllabus (changes are possible, and suggestions/feedback are welcome).
April 3, 5
Basic terminology and scope of coding theory. Regular sparse graph ensembles. Basic properties. (Chapter 1)
April 10, 12
Message passing decoding for the Binary Erasure Channel. Analysis through density evolution. (Chapter 3)
April 17, 19
Irregular graph ensembles. Density evolution. Achieving capacity on the Binary Erasure Channel. Tornado Codes, LT codes, Raptor Codes. (Chapter 3)
April 24, 26
General Binary Memoryless Symmetric (BMS) channels. Message passing decoders. Belief propagarion, quantized message passing. Density evolution. Thresholds. (Chapter 4)
May 1, 3
Local stability. Encoding. Finite block-length performances. Error floor. Waterfall. (Chapter 3.23, 3.24, 4.13, 4.14)
May 8, 10
Rateless codes. Encoding LDPC codes. (Chapter 7.5, Appendix A)
May 15, 17
Convolutional codes, trellis-coded modulation, Viterbi and BCJR algorithms.
May 22, 24
Turbo codes, RA codes. Multi-edge ensembles, protograph codes. (Chapter 6, 7)
May 29, 31
Achieving capacity on BMS channels through spatial coupling. Polar codes.
Homeworks will be assigned on April 3, 10, 17, 24, and May 1, 8. They are due one week after they are assigned.
The final project will be assigned on Tuesday May 8. It will consist in constructing a code which optimizes some performance metric under some constrants and simulating it. Project presentations will take place on Tuesday, June 5 and Wednesday, June 6.