BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Signal Processing and Communications Lab Seminars
SUMMARY:Factor Graph Transforms - Prof. Pascal O. Vontobel
\, Department of Information Engineering\, The Chi
nese University of Hong Kong
DTSTART;TZID=Europe/London:20150529T113000
DTEND;TZID=Europe/London:20150529T123000
UID:TALK59506AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/59506
DESCRIPTION:Transforms of functions play an important role in
many applications\, be it for\nanalysis purposes o
r for computational complexity reasons. For exampl
e\, the\nFourier Transform of a time function imme
diately tells us if that function is\nbandlimited
or not. Or\, Fast-Fourier-Transform-based techniqu
es can be used to\nefficiently compute the convolu
tion of two discrete-time functions.\n\nGiven that
factor graphs represent multivariate functions\,
it is not\nsurprising that transforms play also an
important role for factor graphs. In\nthis talk\,
we first present an example of a factor graph tra
nsform that helps\nin the analysis of the partitio
n function of a factor graph. (Many important\nqua
ntities can be expressed as the partition function
of a factor graph\, and\nso a good understanding
of this object and its approximations is a worthwh
ile\nendeavor.)\n\nAfterwards\, we present an exam
ple of a factor graph transform that leads to an\n
efficient implementation of the sum-product algori
thm message update rules for\ncertain function nod
es. (The sum-product algorithm is at the basis of
decoding\nalgorithms for low-density parity-check
codes\, a class of codes which appears\nin various
telecommunication standards\, and so efficient im
plementations of\nthe sum-product algorithm are hi
ghly desirable.)\n\n_The_ _talk_ _is_ _planned_ _t
o_ _be_ _self-contained_\; basics of factor graphs
will be\nintroduced as needed.\n\n*BIO*: Biograph
y:\nPascal O. Vontobel received the Diploma degree
in electrical engineering in\n1997\, the Post-Dip
loma degree in information techniques in 2002\, an
d the Ph.D. degree in electrical engineering in 20
03\, all from ETH Zurich\,\nSwitzerland. From 1997
to 2002 he was a research and teaching assistant
at the Signal and\nInformation Processing Laborato
ry at ETH Zurich\, from 2006 to 2013 he was a\nres
earch scientist with the Information Theory Resear
ch Group at\nHewlett-Packard Laboratories in Palo
Alto\, CA\, USA\, and since 2014 he has been\nan A
ssociate Professor at the Department of Informatio
n Engineering at the\nChinese University of Hong K
ong. Besides this\, he was a postdoctoral research
\nassociate at the University of Illinois at Urban
a-Champaign (2002-2004)\, a\nvisiting assistant pr
ofessor at the University of Wisconsin-Madison\n(2
004-2005)\, a postdoctoral research associate at t
he Massachusetts Institute\nof Technology (2006)\,
and a visiting scholar at Stanford University (20
14).\nHis research interests lie in information th
eory\, data science\,\ncommunications\, and signal
processing.\n\nDr. Vontobel has been an Associate
Editor for the IEEE Transactions on\nInformation
Theory (2009-2012) and an Awards Committee Member
of the IEEE\nInformation Theory Society (2013-2014
). Currently\, he is an Associate Editor\nfor the
IEEE Transactions on Communications\, a Distinguis
hed Lecturer of the\nIEEE Information Theory Socie
ty\, and a TPC Co-Chair of the upcoming 2016 IEEE\
nInternational Symposium on Information Theory. He
has been on the technical\nprogram committees of
several international conferences and has co-organ
ized\nseveral topical workshops\, most recently a
workshop at Princeton University on\n"Counting\, I
nference\, and Optimization on Graphs." Moreover\,
he has been three\ntimes a plenary speaker at int
ernational information and coding theory\nconferen
ces and has been awarded the ETH medal for his Ph.
D. dissertation.
LOCATION:LR5\, Department of Engineering
CONTACT:Dr Ramji Venkataramanan
END:VEVENT
END:VCALENDAR