BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Tree-Structured algorithm applied to LDPC decoding
DTSTART:20110624T111500
DTSTAMP:20260429T010121Z
UID:f8c8a6585697fa9b52a4e10c0102cc63ecff324908814af5df99e604
CATEGORIES:Conferences - Seminars
DESCRIPTION:Prof. Juan José Murillo Fuentes\, Universidad de Sevilla \nVe
 ry much effort has been devoted to the design of LDPC codes to achieve cap
 acity under BP decoding. In this work we rather focus on the decoder desig
 n. We borrow from the tree-structured expectation propagation (TEP) algori
 thm to propose novel decoders that improve the BP performance. We first de
 velop the TEP as a general decoder. Then\, we deeply study the impact of t
 his decoding on the BEC. We prove that it can achieve a better threshold a
 t linear complexity with the length of the code. And\, for short codes\, i
 t exhibits a good performance. The codes can also be designed to improve t
 he threshold. To achieve capacity\, we go further and develop decoders wit
 h no linear complexity that achieve the MAP solution. We end this talk by 
 presenting some present lines of research.  Prof. Murillo-Fuentes' homepag
 e
LOCATION:BC 01 https://plan.epfl.ch/?room==BC%2001
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR