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

2006/07/07 by Junli Hu, Hans‐Andrea Loeliger, Hu, Junli +7 · 2 citations
Biochemistry, Genetics and Molecular Biology · Computer Science · Mathematics · #Algorithms and Data Compression #DNA and Biological Computing #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.cs/0607027

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

openalex publication_date 2006/07/07 · arxiv created 2006/10/01 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Cited by

• 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\n Probabilistic Inference

Related

• Lossy Computing with Side Information via Multi-Hypergraphs
• Universally Attainable Error and Information Exponents, and Equivocation Rate for the Broadcast Channels with Confidential Messages
• Robust Coding for Lossy Computing with Receiver-Side Observation Costs
• Robust Coding for Lossy Computing with Observation Costs
• Error and Erasure Exponents for the Broadcast Channel with Degraded\n Message Sets