Expectation Maximization as Message Passing - Part I: Principles and Gaussian Messages (2009)
Dauwels, Justin, Eckford, Andrew, Korl, Sascha, Loeliger, Hans-Andrea
It is shown how expectation maximization (EM) may be viewed as a message passing algorithm in factor graphs. In particular, a general EM message computation rule is identified. As a factor graph...
On Markov structured summary propagation and LFSR synchronization (2008)
Justin Dauwels, Hans-andrea Loeliger, Patrick Merkli, Maja Ostojic
Allerton 2004 Sum-product message passing (belief propagation) was recently extended to messages/summaries with some nontrivial Markov structure. In this paper, a general update rule for...
for Channels With Memory (2008)
Dieter M. Arnold, Hans-andrea Loeliger, Pascal O. Vontobel, Ar Kavčić, Senior Member, Wei Zeng, ...
©2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale...
Lower Bounds, Dieter Arnold, Ar Kavčić, Hans-andrea Loeliger, Pascal O. Vontobel, Wei Zeng
It has recently become feasible to compute information rates of finite-state source/channel models with not too many states. Such methods can also be used to compute upper and lower bounds on the...
Et Communications, Nicolas Gresset, Hikmet Sari Président, Hans-andrea Loeliger, Geneviève Baudoin Examinateurs, Jean-claude Belfiore, ...
Nouvelles techniques de codage spatio-temporel avec des modulations codées à bits entrelacés Soutenue le 13 décembre 2004 devant le jury composé de
George S. Moschytz, Hans-andrea Loeliger, Prof Dr, Prof Dr, Prof Dr, David A. Johns
citizen of Kriens (LU) and Honau (LU) accepted on the recommendation of Prof. Dr. George S. Moschytz, examiner Prof. Dr. Hans-Andrea Loeliger, co-examiner
Extended Summary Background (2007)
Pascal O. Vontobel, Hans-andrea Loeliger
Factor graphs are graphical models with origins in coding theory. It is well known that Kalman filtering is an instance of the generic sum(mary)-product algorithm on the corresponding factor graph....
The convoluted history of minimal encoders (2007)
Abstract: Kalman's classic formula "minimal controllable and observable " fundamentally solves the minimality problem of linear systems theory. However, it took 35 years until...
Hans-andrea Loeliger, Felix Lustenberger, Markus Helfenstein, Felix Tarkoy
d I y p(y=0) I z p(z=0) I z p(z=1) I x p(x=1) I y p(y=1) I x p(x=0) Abstract: The sum-product algorithm (probability propagation) can be mapped directly into analog transistor circuits. These...
Benjamin Vigoda Justin, Justin Dauwels, Neil Gershenfeld, Hans-andrea Loeliger
Gershenfeld and Grinstein showed that a modulated linear-feedback shiftregister (LFSR) sequence can be synchronized by feeding the modulated sequence into an analog version of the LFSR. In this...
On the Basic Averaging Arguments (2007)
For Linear Codes, Hans-andrea Loeliger
Linear codes over F q are considered for use in detecting and in correcting the additive errors in some subset E of F q .(Themost familiar example of such an error set E is the set of all n-tuples of...
A general computation rule for lossy summaries/messages with examples from equalization (2006)
Hu, Junli, Loeliger, Hans-Andrea, Dauwels, Justin, Kschischang, Frank
Elaborating on prior work by Minka, we formulate a general computation rule for lossy messages. An important special case (with many applications in communications) is the conversion of "soft-bit"...
Signal processing with factor graphs: examples (2004)
Hans-andrea Loeliger, Justin Dauwels, Volker M. Koch, Sascha Korl
Graphical models such as factor graphs allow to model complex systems and help to derive practical detection/estimation algorithms as message passing in the graph. In this paper, we outline three...
Phase estimation by message passing (2004)
Justin Dauwels, Hans-andrea Loeliger
Abstract — The problem of phase estimation in a “turbo receiver” is considered for two different channel models. Several message passing algorithms for phase estimation are derived from the...
Simulation-Based Computation of Information Rates for Channels with Memory (2004)
Dieter Arnold, Hans-Andrea Loeliger, For Channels Memory, Aleksandar Kavcic, Pascal O. Vontobel, Ar Kavcic, ...
The information rate of finite-state source/channel models can be accurately estimated by sampling both a long channel input sequence and the corresponding channel output sequence, followed by a...
Phase Estimation and Phase Ambiguity Resolution by Message Passing (2004)
Justin Dauwels, Henk Wymeersch, Hans-andrea Loeliger
Abstract. Several code-aided algorithms for phase estimation have recently been proposed. While some of them are ad-hoc, others are derived in a systematic way. The latter can be divided into two...
Measurements on an analog (8,4,4) Hamming Code Decoder Chip (2004)
Matthias Frey, Hans-andrea Loeliger, Felix Lustenberger, Patrick Merkli, Patrik Strebel, Matthias Frey, ...
An analog decoder for an (8,4,4) Hamming code was implemented with CMOS transistors in weak inversion in a 0.25 µm BiCMOS-process. Many different measurements were conducted on the chip: bit-error...
Some Remarks on Factor Graphs (2003)
The paper is a collection of remarks, some rather plain, on various issues with factor graphs. In particular, it is pointed out that powerful signal processing techniques such as gradient methods,...
On Structured-Summary Propagation, (2003)
Lfsr Synchronization And, Justin Dauwels, Hans-andrea Loeliger, Patrick Merkli, Maja Ostojic
A general idea---message passing with messages that have some nontrivial Markov structure---is outlined. This general idea is worked out for one particular application, viz., the synchronization...
Least Squares and Kalman Filtering (2002)
On Forney Graphs, Hans-andrea Loeliger, Eth Zürich
General versions of Kalman filtering and recursive least-squares algorithms are derived as instances of the sum(mary)-product algorithm on Forney-style factor graphs.
On Factor Graphs And Electrical Networks (2002)
Pascal O . Vontobel, Hans-andrea Loeliger
Factor graphs are graphical models with origins in coding theory. The sum-product and the max-product algorithms, which operate by message passing in a factor graph, subsume a great variety of...
Frank R. Kschischang, Brendan J. Frey, Hans-andrea Loeliger, Jonathan S. Yedidia, Wiliam T. Freeman, Yair Weiss, ...
gi(xi) g(x1,..., xn)
On mismatch errors in analog-VLSI error correcting decoders (2001)
Felix Lustenberger, Hans-andrea Loeliger
A new type of nonlinear analog transistor networks has recently been proposed for “turbo ” decoding of error correcting codes. However, the influence of various nonidealities on the performance...
On mismatch errors in analog-VLSI error correcting decoders (2001)
Felix Lustenberger, Hans-andrea Loeliger
A new type of nonlinear analog transistor networks has recently been proposed for “turbo ” decoding of error correcting codes. However, the influence of various nonidealities on the performance...
Factor Graphs and the Sum-Product Algorithm (2001)
Frank Kschischang, Senior Member, Brendan J. Frey, Hans-andrea Loeliger
Algorithms that must deal with complicated global functions of many variables often exploit the manner in which the given functions factor as a product of "local" functions, each of which...
Thomas Michael Sailer, Prof Dr, Gerhard Tröster, Prof Dr, Hans-andrea Loeliger, Thomas Sailer Iii
citizen of Winterthur, ZH
Probability Propagation and Decoding in Analog VLSI (2000)
Hans-Andrea Loeliger, Felix Lustenberger, Markus Helfenstein, Felix Tarköy
: The sum-product algorithm (belief/probability propagation) can be naturally mapped into analog transistor circuits. These circuits enable the construction of analog-VLSI decoders for turbo codes,...
accepted on the recommendation of (2000)
Prof Dr, George S. Moschytz, Prof Dr, Scott C. Douglas, Prof Dr, Hans-andrea Loeliger, ...
Mehr zu hören, als zu reden – solches lehrt uns die Natur:
accepted on the recommendation of (2000)
Prof Dr, George S. Moschytz, Prof Dr, Scott C. Douglas, Prof Dr, Hans-andrea Loeliger, ...
Mehr zu hören, als zu reden – solches lehrt uns die Natur:
accepted on the recommendation of (2000)
Prof Dr, George S. Moschytz, Prof Dr, Scott C. Douglas, Prof Dr, Hans-andrea Loeliger, ...
Mehr zu hören, als zu reden – solches lehrt uns die Natur:
An analog vlsi decoding technique for digital codes (1999)
Felix Lustenberger, Markus Helfenstein, Hans-andrea Loeliger, Felix Tarköy, George S. Moschytz
Iterative decoding of high-performance error-correcting codes, such as turbo and related codes, is computationally demanding. This paper presents the application of a new type of analog computing...
Decoding in Analog VLSI (1999)
Hans-andrea Loeliger, Felix Tarköy, Endora Tech Ag, Felix Lustenberger, Markus Helfenstein, Eth Zurich
n Figure 1. Communication system. Encoder Channel u 1 ,...,u k x 1 ,...,x n Decoder ^ u 1 ,..., ^ u k y 1 ,...,y n n Figure 2. Simple encoder. "Addition" is modulo 2 (exclusive OR). u 1 x 1...
Probability Propagation in Analog VLSI (1998)
Hans-andrea Loeliger, Felix Lustenberger, Markus Helfenstein, Felix Tarköy, Felix Lustenberger B, ...
: The sum-product algorithm #probability propagation# can be mapped directly into analog transistor circuits. These circuits enable the construction of analog-VLSI decoders for turbo codes,...
Factor Graphs and the Sum-Product Algorithm (1998)
Frank R. Kschischang, Brendan J. Frey, Hans-andrea Loeliger
A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other...
Factor graphs and algorithms (1997)
Brendan J. Frey, Frank R. Kschischang, Hans-andrea Loeliger, Niclas Wiberg
Abstract---A factor graph is a bipartite graph that expresses how a global function of several variables factors into a product of local functions. Factor graphs subsume many other graphical models,...
Abstract--- Unlike the usual turbo codes, "unifilar turbo codes" are based on only one underlying trellis code. If terminated (i.e., as block codes), they perform as well as...
The Convoluted History of Minimal Encoders (1997)
Kalman's classic formula "minimal controllable and observable" fundamentally solves the minimality problem of linear systems theory. However, it took 35 years until Kalman's...
To boldly go where no man has gone before. (1971)
Maximillian Koch, Prof Dr, Hans-andrea Loeliger, Prof Dr, ...
nal and rmation cessing olume todo rtung