A general computation rule for lossy summaries/messages with examples from equalization
Junli Hu, Hans-Andrea Loeliger, Justin Dauwels, Frank Kschischang
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.
Create a lesson
Related papers
An Explicit Family of Log-Concave Counterexamples to the Gaussian Completely Monotone Conjecture
Jiayang Zou, Luyao Fan, Jiayang Gao et al.
Strengthening Recursive Constructions for Zero-Error Shannon Capacity
Ravi Tandon
Fluid Antenna Multiple Access for Noise Modulation
Hadi Zayyani, Felipe A. P. de Figueiredo
The generalized covering radii of Melas codes
Shuxing Li, Maosheng Xiong
Efficient Polynomial-Time Decoding of Simplicial Anticodes with Near-Optimal Performance
Antonio Jesús Lorite-López, Daniel Camazón-Portela, Juan Antonio López-Ramos
Multi-Access Speculative Inference: Uplink or Downlink?
Chang Cai, Kaibin Huang