Density Evolution for SUDOKU Codes on the Erasure Channel

Add to your list(s) Download to your calendar using vCal

• Jossy Sayir, University of Cambridge
• Friday 15 August 2014, 12:00-12:30
• SigProC seminar room (3rd floor of Dept. of Engineering).

If you have a question about this talk, please contact Jossy Sayir.

Codes based on SUDOKU puzzles are discussed, and belief propagation decoding introduced for the erasure channel. Despite the non-linearity of the code constraints, it is argued that density evolution can be used to analyse code performance due to the invariance of the code under alphabet permutation. The belief propagation decoder for erasure channels operates by exchanging messages containing sets of possible values. Accordingly, density evolution tracks the probability mass functions of the set cardinalities. The equations governing the mapping of those probability mass functions are derived and calculated for variable and constraint nodes, and decoding thresholds are computed for long SUDOKU codes with random interleavers.

This talk is a pre-view of a talk to be delivered at the Turbo Coding Symposium next week

This talk is part of the Communications Research Group Seminar series.

This talk is included in these lists:

• Communications Research Group Seminar
• Information Engineering Division seminar list
• SigProC seminar room (3rd floor of Dept. of Engineering)

Note that ex-directory lists are not shown.