A Unified Framework for Linear-Programming Based Communication Receivers
Mark F. Flanagan

TL;DR
This paper introduces a unified linear-programming framework for communication receivers, establishing their relationship with sum-product algorithms, analyzing pseudoconfigurations, and demonstrating competitive performance in joint equalization and decoding tasks.
Contribution
It develops a general LP-based receiver framework for systems with SPA-based receivers, proves key properties, and applies it to joint equalization and decoding with promising results.
Findings
LP receiver has maximum likelihood certificate property
LP design can be applied to joint equalization and decoding
LP receiver outperforms turbo equalization in simulations
Abstract
It is shown that a large class of communication systems which admit a sum-product algorithm (SPA) based receiver also admit a corresponding linear-programming (LP) based receiver. The two receivers have a relationship defined by the local structure of the underlying graphical model, and are inhibited by the same phenomenon, which we call 'pseudoconfigurations'. This concept is a generalization of the concept of 'pseudocodewords' for linear codes. It is proved that the LP receiver has the 'maximum likelihood certificate' property, and that the receiver output is the lowest cost pseudoconfiguration. Equivalence of graph-cover pseudoconfigurations and linear-programming pseudoconfigurations is also proved. A concept of 'system pseudodistance' is defined which generalizes the existing concept of pseudodistance for binary and nonbinary linear codes. It is demonstrated how the LP design…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
