Detection of Markov Random Fields on Two-Dimensional Intersymbol Interference Channels
| dc.creator | Zhu, Ying | |
| dc.creator | Cheng, Taikun | |
| dc.creator | Sivakumar, Krishnamoorthy | |
| dc.creator | Belzer, Benjamin J. | |
| dc.date | 2006-09-27 | |
| dc.date.accessioned | 2026-07-07T08:16:44Z | |
| dc.date.available | 2026-07-07T08:16:44Z | |
| dc.description | We present a novel iterative algorithm for detection of binary Markov random fields (MRFs) corrupted by two-dimensional (2D) intersymbol interference (ISI) and additive white Gaussian noise (AWGN). We assume a first-order binary MRF as a simple model for correlated images. We assume a 2D digital storage channel, where the MRF is interleaved before being written and then read by a 2D transducer; such channels occur in recently proposed optical disk storage systems. The detection algorithm is a concatenation of two soft-input/soft-output (SISO) detectors: an iterative row-column soft-decision feedback (IRCSDF) ISI detector, and a MRF detector. The MRF detector is a SISO version of the stochastic relaxation algorithm by Geman and Geman in IEEE Trans. Pattern Anal. and Mach. Intell., Nov. 1984. On the 2 x 2 averaging-mask ISI channel, at a bit error rate (BER) of 10^{-5}, the concatenated algorithm achieves SNR savings of between 0.5 and 2.0 dB over the IRCSDF detector alone; the savings increase as the MRFs become more correlated, or as the SNR decreases. The algorithm is also fairly robust to mismatches between the assumed and actual MRF parameters. | |
| dc.description | 8 pages, 17 figures | |
| dc.identifier | https://arxiv.org/abs/cs/0609155 | |
| dc.identifier | http://arxiv.org/abs/cs/0609155 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133882 | |
| dc.subject | Information Theory | |
| dc.title | Detection of Markov Random Fields on Two-Dimensional Intersymbol Interference Channels | |
| dc.type | text |