Tuesday, April 11, 2000
4:00 PM (reception following)
Room 35-225
LIDS Colloquium
Abstract
"Factor graphs" subsume a wide variety of system models in signal processing, artificial intelligence, and error correcting codes. A single generic "sum-product" algorithm, which operates on such graphs, subsumes a great number of important algorithms including the Viterbi algorithm, the forward-backward algorithm, the Kalman filter, Pearl's belief propagation algorithm, and iterative "turbo" decoding of error-correcting codes. Increasingly, the emphasis in both research and applications is on iterative versions of such algorithms.
Traditionally, all these algorithms are implemented with digital circuits. However, a miraculous match between transistor physics and certain computations with probabilities was recently discovered that enables robust analog VLSI implementations of some of these algorithms that outperform digital implementations by two orders of magnitude in terms of speed or power consumption.
Short biography: Hans-Andrea Loeliger (haloeliger@endora.ch) is a consultant in signal processing, digital communications, and error-correcting codes. He received a diploma in electrical engineering from the Swiss Federal Institute of Technology (ETH), Zurich, Switzerland, in 1985 and the Ph.D. degree, also from ETH Zurich, in 1992. From 1992 to 1995, he was Assistant Professor at Linkoping University, Sweden. He is now with Endora Tech AG, Basel, Switzerland, which he co-founded in 1995.
|
Modified: Mar 22, 2000|
Current events|
Your comments
and inquiries are welcome.