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

Simple item page
dc.creatorHu, Junli
dc.creatorLoeliger, Hans-Andrea
dc.creatorDauwels, Justin
dc.creatorKschischang, Frank
dc.date2006-07-07
dc.date2006-10-01
dc.date.accessioned2026-07-07T08:16:38Z
dc.date.available2026-07-07T08:16:38Z
dc.descriptionElaborating 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.
dc.descriptionProc. of the 44th Allerton Conference on Communication, Control, and Computing, Monticello, Ill., USA, Sept. 2006
dc.identifierhttps://arxiv.org/abs/cs/0607027
dc.identifierhttp://arxiv.org/abs/cs/0607027
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133845
dc.subjectInformation Theory
dc.titleA general computation rule for lossy summaries/messages with examples from equalization
dc.typetext

Files

Collections

arXiv