BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Analysis of message-passing iterative decoders via zeta functions 
DTSTART:20121109T140000
DTEND:20121109T150000
DTSTAMP:20260510T081941Z
UID:92944c1907a415f39aa357322a7479f3b69dd380ebd8af451fa4d976
CATEGORIES:Miscellaneous
DESCRIPTION:Dr. Pascal O. Vontobel Hewlett-Packard Laboratories\, Palo Alt
 o\, CA\, USA\n\nAbstract:\nMessage-passing iterative decoding has been ver
 y popular in the last\nfifteen years in the area of coded data transmissio
 n (and beyond)\nbecause of its low implementation complexity and its outst
 anding\nperformance. A central problem is the performance analysis of\nmes
 sage-passing iterative decoding of finite-length codes. In this\ntalk we a
 pproach this problem with the help of zeta functions.\n\nZeta functions ha
 ve been used to derive a variety of analysis results\nfor graphical models
  during the last decade. Some recent advances\nallow us to connect these d
 isparate results and to provide a more\nunified framework of this approach
  to the analysis of graphical\nmodels. In particular\, these advances allo
 w us to connect computation\ntree pseudo-codewords and graph-cover pseudo-
 codewords\, two central\nobjects in the analysis of message-passing iterat
 ive decoders of\nlow-density parity-check codes.\n\n(Based on joint work w
 ith Henry D. Pfister\, Texas A&M University.)
LOCATION:INM010 http://plan.epfl.ch/?zoom=19&recenter_y=5863899.43745&rece
 nter_x=730562.99553&layerNodes=fonds\,batiments\,labels\,events_surface\,e
 vents_line\,events_label\,information\,parkings_publics\,arrets_metro\,eve
 nem
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR