Course Web-Page for Graph-Based Coding Theory - INF244 Seminar, Autumn 2012

Lecturer: Matthew G. Parker

THIS WEB-PAGE WILL BE ADDED TO AS TIME GOES BY


Background Material for INF244:

  • [http://www.comm.utoronto.ca/frank/papers/KFL01.pdf]
  • Information Theory, Inference, and Learning Algorithms, Author: David J.C. Mackay
  • Error Control Coding: Fundamentals & Applications Authors: Shu Lin and Daniel J. Costello

  • Course Summary

    This course will give an introduction to the techniques of probabilistic inference on graphs, with an emphasis on graph-based coding theory.

    Project

    To implement a semi-generic factor-graph software suite: [INF24412Project.pdf],

    Lecture Schedule

    Location for lectures: H°yteknologisenteret, Grupperom 2101 (HIB:G2101) (HIB) Tuesday and Friday

    Friday 10:15-12.00 (24.08.12), 2101 HIB -- FIRST LECTURE

    Factor Graphs and the Sum-Product Algorithm [FGSPA.pdf]

    Here is an example which should help to clarify some aspects of the current lectures: [FGSPAEx1.pdf]

    and here is another example: [Example1.3.pdf]

    Here is a Mathematica notebook to compute example 1 the naive way (not using message-passing): [FGSPAEx1Math.pdf]

    These notes are a summary of this paper: [http://www.comm.utoronto.ca/frank/papers/KFL01.pdf]

    Tuesday 12:15-14:00 (28.08.12), 2101 HIB

    Factor Graphs and the Sum-Product Algorithm (continued)

    Friday 10:15-12.00 (31.08.12), 2101 HIB

    Factor Graphs and the Sum-Product Algorithm (continued)

    Tuesday 12:15-14:00 (04.09.12), 2101 HIB

    Factor Graphs and the Sum-Product Algorithm (continued)

    Friday 10:15-12.00 (07.09.12), 2101 HIB

    Factor Graphs and the Sum-Product Algorithm (continued)

    Here are two examples showing the sum-product algorithm on a trellis: [Example1.2.pdf], [FGSPAEx2.pdf]

    Tuesday 12:15-14:00 (11.09.12), 2101 HIB

    Factor Graphs and the Sum-Product Algorithm (continued)

    Friday 10:15-12.00 (14.09.12), 2101 HIB

    Factor Graphs and the Sum-Product Algorithm (continued)

    Tuesday 12:15-14:00 (18.09.12), 2101 HIB

    Factor Graphs and the Sum-Product Algorithm (continued)

    Here is an example showing max-product on a trellis: [Example1.2b.pdf],

    Friday 10:15-12.00 (21.09.12), 2101 HIB

    Factor Graphs and the Sum-Product Algorithm (continued)

    Tuesday 12:15-14:00 (25.09.12), 2101 HIB

    Factor Graphs and the Sum-Product Algorithm (continued)

    Here is a note explaining why the Discrete Fourier transform is a special case of a residue system: [DFTRNS.pdf],

    Friday 10:15-12.00 (28.09.12), 2101 HIB

    Factor Graphs and the Sum-Product Algorithm (continued)

    Tuesday 12:15-14:00 (02.10.12), 2101 HIB

    SPA for simple graphs.

    Friday 10:15-12.00 (05.10.12), 2101 HIB

    SPA for simple graphs.

    Tuesday 12:15-14:00 (09.10.12), 2101 HIB

    SPA for simple graphs.

    Friday 10:15-12.00 (12.10.12), 2101 HIB

    SPA for simple graphs.

    Tuesday 12:15-14:00 (16.10.12), 2101 HIB

    SPA for simple graphs. [SPASimple.pdf]

    Friday 10:15-12.00 (19.10.12), 2101 HIB

    SPA for simple graphs.

    Tuesday 12:15-14:00 (23.10.12), 2101 HIB

    SPA for simple graphs.

    Friday 10:15-12.00 (26.10.12), 2101 HIB

    SPA for simple graphs.

    Tuesday 12:15-14:00 (30.10.12), 2101 HIB

    SPA for simple graphs.

    Friday 10:15-12.00 (02.10.12), 2101 HIB

    SPA for simple graphs. [DynamicTrellis.pdf]

    [GraphStates.pdf]

    Last updated 27.09.12.