Computer Science – Information Theory
Scientific paper
2011-02-26
Computer Science
Information Theory
5 Pages, Submitted to ISIT 2011
Scientific paper
We present and study linear programming based detectors for two-dimensional intersymbol interference channels. Interesting instances of two-dimensional intersymbol interference channels are magnetic storage, optical storage and Wyner's cellular network model. We show that the optimal maximum a posteriori detection in such channels lends itself to a natural linear programming based sub-optimal detector. We call this the Pairwise linear program detector. Our experiments show that the Pairwise linear program detector performs poorly. We then propose two methods to strengthen our detector. These detectors are based on systematically enhancing the Pairwise linear program. The first one, the Block linear program detector adds higher order potential functions in an {\em exhaustive} manner, as constraints, to the Pairwise linear program detector. We show by experiments that the Block linear program detector has performance close to the optimal detector. We then develop another detector by {\em adaptively} adding frustrated cycles to the Pairwise linear program detector. Empirically, this detector also has performance close to the optimal one and turns out to be less complex then the Block linear program detector.
Chertkov Michael
Johnson Jason K.
Kudekar Shrinivas
No associations
LandOfFree
Linear Programming based Detectors for Two-Dimensional Intersymbol Interference Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Linear Programming based Detectors for Two-Dimensional Intersymbol Interference Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear Programming based Detectors for Two-Dimensional Intersymbol Interference Channels will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-302119