Channel Coding Theory
View sample lecture.
Description of the Course
Lecture, four hours; outside study, eight hours. Fundamentals of error control codes and decoding algorithms. Topics include block codes, convolutional codes, trellis codes, and turbo codes. Letter grading.
Background students will need
Although prerequisites are not enforced for graduate students, it is strongly recommended that each student has taken a course equivalent to Probability.
About the Instructor
Richard Wesel: Richard D. Wesel is a Professor with the UCLA Electrical Engineering Department and is the Associate Dean for Academic and Student Affairs for the UCLA Henry Samueli School of Engineering and Applied Science. He joined UCLA in 1996 after receiving his Ph.D. in electrical engineering from Stanford. His B.S. and M.S. degrees in electrical engineering are from MIT. His research is in the area of communication theory with particular interest in channel coding. He has received the National Science Foundation (NSF) CAREER Award, an Okawa Foundation award for research in information theory and telecommunications, and the Excellence in Teaching Award from the Henry Samueli School of Engineering and Applied Science. He has authored or co-authored over a hundred conference and journal publications. For more about his research group see http://www.ee.ucla.edu/~csl.
Readings from Algebraic Codes for Data Transmission, Richard E. Blahut. In general, readings include extraneous material. Use the lectures as a guide to what is important.
Readings: 1,2,3.5 and 12.3 (only Gilbert bound)
Topics: Linear Block Codes, Bounds on Hamming Distance
Topics: The Standard Array, Syndrome Decoding, Hamming Codes
Reading: only slides
Topics: The Totient Theorem
Topics: Division of Polynomials over GF(q), Minimal Polynomials, Conjugacy Classes
Readings: 5 and 6
Topics: Linear Cyclic Codes, BCH, and Reed Solomon Codes, the BCH Bound
Readings: 6 and 7
Topics: Decoding BCH and Reed Solomon Codes
Readings: 9 and 11
Topics: Convolutional Codes and Viterbi Decoding
Topics: Catastrophic Behavior and Minimality
Topics: Bit Error Rates for Convolutional Codes
Topics: Trellis Codes, Set Partitioning and Euclidean Distance
Readings: 14.4, Shi
Topics: BER bounds for Trellis Codes
Topics: The Forward-Backward Maximum a-Posteriori Decoder
Topics: Turbo Codes: Introduction and Decoding
Topics: Uniform Interleaver Analysis of Turbo Codes
Topics: Turbo Encoder Design Criteria
Topics: Low-Density Parity Check Codes: Decoding
Topics: Low-Density Parity Check Codes: Design
Topics: Network Coding, Other Topics
Topics: Final Review, Final Project Due