Graph-Based Decoding in the Presence of ISI

DOI10.1109/TIT.2011.2110070zbMATH Open1366.94728arXiv0707.1241MaRDI QIDQ5280977FDOQ5280977

Authors: Mohammad Hossein Taghavi, Paul Siegel 

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/0707.1241

Recommendations

• Graph Configurations and Decoding Performance
• Publication:4945360
• Graph-based iterative decoding algorithms for parity-concatenated trellis codes
• Graph-based convolutional and block LDPC codes
• scientific article; zbMATH DE number 1714662
• Graph theoretic methods in coding theory
• Graph based linear error correcting codes
• Error-correcting codes from graphs
• Graph theoretic error-correcting codes
• Graph-based codes

Mathematics Subject Classification ID

Decoding (94B35)

This page was built for publication: Graph-Based Decoding in the Presence of ISI

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5280977)