pith. sign in

arxiv: cs/0607027 · v2 · submitted 2006-07-07 · 💻 cs.IT · math.IT

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

classification 💻 cs.IT math.IT
keywords messagescomputationgenerallossyruleapplicationscasecoded
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.