A general computation rule for lossy summaries/messages with examples from equalization

Abstract

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" messages to Gaussian messages. By this method, the performance of a Kalman equalizer is improved, both for uncoded and coded transmission.

Proc. of the 44th Allerton Conference on Communication, Control, and Computing, Monticello, Ill., USA, Sept. 2006

References in corpus (1)

• Expectation Propagation for approximate Bayesian inference

Cited by in corpus (9)

• The Trapping Redundancy of Linear Block Codes
• Unifying Message Passing Algorithms Under the Framework of Constrained Bethe Free Energy Minimization
• A double EP-based proposal for turbo equalization
• A BP-MF-EP Based Iterative Receiver for Joint Phase Noise Estimation, Equalization and Decoding
• Probabilistic Receiver Architecture Combining BP, MF, and EP for Multi-Signal Detection
• A Binarizing NUV Prior and its Use for M-Level Control and Digital-to-Analog Conversion
• Equalization with Expectation Propagation at Smoothing Level
• Message-Passing Receiver for Joint Channel Estimation and Decoding in 3D Massive MIMO-OFDM Systems
• The Hilbert Space of Probability Mass Functions and Applications on Probabilistic Inference