Analysis of message-passing iterative decoders via zeta functions
Event details
| Date | 09.11.2012 |
| Hour | 14:00 › 15:00 |
| Speaker |
Dr. Pascal O. Vontobel Hewlett-Packard Laboratories, Palo Alto, CA, USA |
| Location | |
| Category | Miscellaneous |
Abstract:
Message-passing iterative decoding has been very popular in the last
fifteen years in the area of coded data transmission (and beyond)
because of its low implementation complexity and its outstanding
performance. A central problem is the performance analysis of
message-passing iterative decoding of finite-length codes. In this
talk we approach this problem with the help of zeta functions.
Zeta functions have been used to derive a variety of analysis results
for graphical models during the last decade. Some recent advances
allow us to connect these disparate results and to provide a more
unified framework of this approach to the analysis of graphical
models. In particular, these advances allow us to connect computation
tree pseudo-codewords and graph-cover pseudo-codewords, two central
objects in the analysis of message-passing iterative decoders of
low-density parity-check codes.
(Based on joint work with Henry D. Pfister, Texas A&M University.)
Message-passing iterative decoding has been very popular in the last
fifteen years in the area of coded data transmission (and beyond)
because of its low implementation complexity and its outstanding
performance. A central problem is the performance analysis of
message-passing iterative decoding of finite-length codes. In this
talk we approach this problem with the help of zeta functions.
Zeta functions have been used to derive a variety of analysis results
for graphical models during the last decade. Some recent advances
allow us to connect these disparate results and to provide a more
unified framework of this approach to the analysis of graphical
models. In particular, these advances allow us to connect computation
tree pseudo-codewords and graph-cover pseudo-codewords, two central
objects in the analysis of message-passing iterative decoders of
low-density parity-check codes.
(Based on joint work with Henry D. Pfister, Texas A&M University.)
Practical information
- Informed public
- Free