Graph-Based Decoding in the Presence of ISI

Details Graph-Based Decoding in the Presence of ISI Graph-Based Decoding in the Presence of ISI

2007-07-09

arxiv.org/abs/0707.1241v1

Computer Science

Information Theory

25 pages, 8 figures, Submitted to IEEE Transactions on Information Theory

Scientific paper

We propose an approximation of maximum-likelihood detection in ISI channels based on linear programming or message passing. We convert the detection problem into a binary decoding problem, which can be easily combined with LDPC decoding. We show that, for a certain class of channels and in the absence of coding, the proposed technique provides the exact ML solution without an exponential complexity in the size of channel memory, while for some other channels, this method has a non-diminishing probability of failure as SNR increases. Some analysis is provided for the error events of the proposed technique under linear programming.

Affiliated with

Also associated with

No associations

Rating

Graph-Based Decoding in the Presence of ISI 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 Graph-Based Decoding in the Presence of ISI, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graph-Based Decoding in the Presence of ISI will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-159153