COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Signal Processing and Communications Lab Seminars > Factor Graph Transforms

## Factor Graph TransformsAdd to your list(s) Download to your calendar using vCal - Prof. Pascal O. Vontobel, Department of Information Engineering, The Chinese University of Hong Kong
- Friday 29 May 2015, 11:30-12:30
- LR5, Department of Engineering.
If you have a question about this talk, please contact Prof. Ramji Venkataramanan. Transforms of functions play an important role in many applications, be it for analysis purposes or for computational complexity reasons. For example, the Fourier Transform of a time function immediately tells us if that function is bandlimited or not. Or, Fast-Fourier-Transform-based techniques can be used to efficiently compute the convolution of two discrete-time functions. Given that factor graphs represent multivariate functions, it is not surprising that transforms play also an important role for factor graphs. In this talk, we first present an example of a factor graph transform that helps in the analysis of the partition function of a factor graph. (Many important quantities can be expressed as the partition function of a factor graph, and so a good understanding of this object and its approximations is a worthwhile endeavor.) Afterwards, we present an example of a factor graph transform that leads to an efficient implementation of the sum-product algorithm message update rules for certain function nodes. (The sum-product algorithm is at the basis of decoding algorithms for low-density parity-check codes, a class of codes which appears in various telecommunication standards, and so efficient implementations of the sum-product algorithm are highly desirable.)
Dr. Vontobel has been an Associate Editor for the IEEE Transactions on Information Theory (2009-2012) and an Awards Committee Member of the IEEE Information Theory Society (2013-2014). Currently, he is an Associate Editor for the IEEE Transactions on Communications, a Distinguished Lecturer of the IEEE Information Theory Society, and a TPC Co-Chair of the upcoming 2016 IEEE International Symposium on Information Theory. He has been on the technical program committees of several international conferences and has co-organized several topical workshops, most recently a workshop at Princeton University on “Counting, Inference, and Optimization on Graphs.” Moreover, he has been three times a plenary speaker at international information and coding theory conferences and has been awarded the ETH medal for his Ph.D. dissertation. This talk is part of the Signal Processing and Communications Lab Seminars series. ## This talk is included in these lists:- All Talks (aka the CURE list)
- Cambridge Centre for Data-Driven Discovery (C2D3)
- Cambridge University Engineering Department Talks
- Cambridge talks
- Centre for Smart Infrastructure & Construction
- Chris Davis' list
- Computational Continuum Mechanics Group Seminars
- Featured lists
- Information Engineering Division seminar list
- Interested Talks
- LR5, Department of Engineering
- School of Technology
- Signal Processing and Communications Lab Seminars
- Trust & Technology Initiative - interesting events
- bld31
- ndk22's list
- ob366-ai4er
- rp587
Note that ex-directory lists are not shown. |
## Other listsPeptide Mini-Symposium The Faraday Institute for Science and Religion CRASSH events The Ellen McArthur Lectures 2013 Gypsy Roma Traveller (GRT) History Month â€˜Diglossia, Bidialectalism, or Bilingualism? Portuguese as a Foreign Language in the Classroomâ€™## Other talksRegulation of progenitor cells in adult lung and in lung cancer Cambridge - Corporate Finance Theory Symposium September 2018 - Day 1 A stochastic model for understanding PIN polarity in isolated cells SciScreen: Finding Dory Making Refuge: Flight |