EE 388 Modern Coding Theory Winter 2007–2008

Class Times and Locations Tuesdays and Thursdays, 12:35 PM-02:05 PM in Room: 260-113 Course Description Tools for analysis and optimization of iterative coding systems. LDPC, turbo and RA codes. Optimized ensembles, message passing algorithms, density evolution, and analytic techniques. References The course is mainly based on T. Richardson and R. Urbanke, Modern Coding Theory Additional references are R. G. Gallager, Low Density Parity Check Codes Prerequisites The prerequisite mentioned in the bulletin is EE376A (Information Theory.) If you did not take EE376A, this is not a problem. On the other hand, it is important to know some basic probability (say, enough probability for understanding a proof of the central limit theorem.)

• Andrea Montanari
  • Office: Packard 272
  • Office hours: Tuesdays 3:00PM-4:00PM, Thursdays 2:00-3:00PM
  • email: montanari@stanford.edu
  
  
• Teaching Assistant: Sewoong Oh
  • Office: Packard 239
  • Office hours: Mondays 3:00PM-5:00PM [no office hours on 1/21]
  • email: swoh@stanford.edu

Each week will be devoted to solving one concrete problem in code design (theory will be developed whenever requested for moving forward.) There will be a weekly homework (except in the last 3 weeks.) This will be a small implementation exercise based on the problem discussed in class. Implementations can be realized in C, C++, Matlab, Mathematica... There will be also a final project, which will consist in designing a code under some constraints.

Grading will be assigned according to: 35% for homework; 35% for final project; 30% for class participation.

We provide the solutions in C. There can be many different (and better) ways of implementing the same decoding algorithms.

Reports are due by Tuesday, Mar 11th at midnight(before Wednesday). Presentation is on Thursday, Mar 13th 12:35-2:55.
You're not required to print-out the final report. You can send the simulation code, parity check matrix, and the report via e-mail.
The presentation file in pdf format should be submitted to the TA by 10:00AM Thursday, Mar 13th.