Graph-based channel detection for multitrack recording channels

Tolga M. Duman, Jun Hu, M. Fatih Erden

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

We propose a low complexity detection technique for multihead multitrack recording systems. By exploiting sparseness of two-dimensional partial response (PR) channels, we develop an algorithm which performs belief propagation (BP) over corresponding factor graphs. We consider the BP-based detector not only for partial response channels but also for more practical conventional media and bit-patterned media storage systems, with and without media noise. Compared to the maximum likelihood detector which has a prohibitively high complexity that is exponential with both the number of tracks and the number of intersymbol interference (ISI) taps, the proposed detector has a much lower complexity and a fast parallel structure. For the multitrack recording systems with PR equalization, the price is a small performance penalty (less than one dB if the intertrack interference (ITI) is not too high). Furthermore, since the algorithm is soft-input soft-output in nature, turbo equalization can be employed if there is an outer code. We show that a few turbo equalization iterations can provide significant performance improvement even when the ITI level is high.

Original languageEnglish (US)
Article number738281
JournalEurasip Journal on Advances in Signal Processing
Volume2008
DOIs
StatePublished - 2008
Externally publishedYes

Fingerprint

Detectors
Intersymbol interference
Maximum likelihood

ASJC Scopus subject areas

  • Hardware and Architecture
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Graph-based channel detection for multitrack recording channels. / Duman, Tolga M.; Hu, Jun; Erden, M. Fatih.

In: Eurasip Journal on Advances in Signal Processing, Vol. 2008, 738281, 2008.

Research output: Contribution to journalArticle

@article{e66a211a252e4c52a3a8f8244c4f2e67,
title = "Graph-based channel detection for multitrack recording channels",
abstract = "We propose a low complexity detection technique for multihead multitrack recording systems. By exploiting sparseness of two-dimensional partial response (PR) channels, we develop an algorithm which performs belief propagation (BP) over corresponding factor graphs. We consider the BP-based detector not only for partial response channels but also for more practical conventional media and bit-patterned media storage systems, with and without media noise. Compared to the maximum likelihood detector which has a prohibitively high complexity that is exponential with both the number of tracks and the number of intersymbol interference (ISI) taps, the proposed detector has a much lower complexity and a fast parallel structure. For the multitrack recording systems with PR equalization, the price is a small performance penalty (less than one dB if the intertrack interference (ITI) is not too high). Furthermore, since the algorithm is soft-input soft-output in nature, turbo equalization can be employed if there is an outer code. We show that a few turbo equalization iterations can provide significant performance improvement even when the ITI level is high.",
author = "Duman, {Tolga M.} and Jun Hu and Erden, {M. Fatih}",
year = "2008",
doi = "10.1155/2008/738281",
language = "English (US)",
volume = "2008",
journal = "Eurasip Journal on Advances in Signal Processing",
issn = "1687-6172",
publisher = "Springer Publishing Company",

}

TY - JOUR

T1 - Graph-based channel detection for multitrack recording channels

AU - Duman, Tolga M.

AU - Hu, Jun

AU - Erden, M. Fatih

PY - 2008

Y1 - 2008

N2 - We propose a low complexity detection technique for multihead multitrack recording systems. By exploiting sparseness of two-dimensional partial response (PR) channels, we develop an algorithm which performs belief propagation (BP) over corresponding factor graphs. We consider the BP-based detector not only for partial response channels but also for more practical conventional media and bit-patterned media storage systems, with and without media noise. Compared to the maximum likelihood detector which has a prohibitively high complexity that is exponential with both the number of tracks and the number of intersymbol interference (ISI) taps, the proposed detector has a much lower complexity and a fast parallel structure. For the multitrack recording systems with PR equalization, the price is a small performance penalty (less than one dB if the intertrack interference (ITI) is not too high). Furthermore, since the algorithm is soft-input soft-output in nature, turbo equalization can be employed if there is an outer code. We show that a few turbo equalization iterations can provide significant performance improvement even when the ITI level is high.

AB - We propose a low complexity detection technique for multihead multitrack recording systems. By exploiting sparseness of two-dimensional partial response (PR) channels, we develop an algorithm which performs belief propagation (BP) over corresponding factor graphs. We consider the BP-based detector not only for partial response channels but also for more practical conventional media and bit-patterned media storage systems, with and without media noise. Compared to the maximum likelihood detector which has a prohibitively high complexity that is exponential with both the number of tracks and the number of intersymbol interference (ISI) taps, the proposed detector has a much lower complexity and a fast parallel structure. For the multitrack recording systems with PR equalization, the price is a small performance penalty (less than one dB if the intertrack interference (ITI) is not too high). Furthermore, since the algorithm is soft-input soft-output in nature, turbo equalization can be employed if there is an outer code. We show that a few turbo equalization iterations can provide significant performance improvement even when the ITI level is high.

UR - http://www.scopus.com/inward/record.url?scp=61349177827&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=61349177827&partnerID=8YFLogxK

U2 - 10.1155/2008/738281

DO - 10.1155/2008/738281

M3 - Article

AN - SCOPUS:61349177827

VL - 2008

JO - Eurasip Journal on Advances in Signal Processing

JF - Eurasip Journal on Advances in Signal Processing

SN - 1687-6172

M1 - 738281

ER -