course: Codes over graphs and decoding algorithms
speaker: Pascal Olivier Vontobel (University of Illinois at Urbana)abstract: Topics: (1) Brief reminder of important notions of coding theory. FactorTanner graphs and the sum-product algorithm (including introduction to LDPC codes, turbo codes, iterative decoding).
(2) Linear programming (LP) decoding, connections between iterative decoding and LP decoding, connections between Bethe free energy minimization and LP decoding.
(3) Pseudo-codewords, pseudo-weight and its connection to stopping sets, near codewords, and trapping sets, the geometry of the fundamental polytope and cone, minial codewords and minimal pseudo-codewords (ML vs. LP decoding)
(4) Construction of codes based on graphs with large girth (algebraic and random constructions), based on finite geometries and related objects, quasi-cyclic LDPC codes.
(5) Applications of factor graphs and the sum-product algorithm beyond pure channel coding (Equalization, Kalman filtering, Inference, Fourier and Legendre transform) (Part 1)
(6) Applications of factor graphs and the sum-product algorithm beyond pure channel coding (Equalization, Kalman filtering, Inference, Fourier and Legendre transform) (Part 2).
timetable:
Mon 30 Jan, 9:00 - 10:30, Aula Dini
Tue 31 Jan, 11:30 - 12:30, Aula Dini
Wed 1 Feb, 9:00 - 10:30, Aula Dini
Wed 1 Feb, 14:00 - 15:30, Aula Dini
Thu 2 Feb, 11:30 - 12:30, Aula Dini
Fri 3 Feb, 11:30 - 12:30, Aula Dini
<< Go back