The Read Channel

In this paper, we provide a survey of the novel read channel technologies that found their implementation in products over the past decade, and we outline possible technology directions for the future of read channels. Recently, magnetic recording read channels have undergone several changes. In addition to switching from longitudinal to perpendicular recording channels, detectors tuned to media noise sources are now readily implemented in read channel chips. Powerful numerical techniques have emerged to evaluate the capacity of the magnetic recording channel. Further, improved coding/decoding methods have surfaced both for the incumbent Reed-Solomon codes and the promising low-density parity-check codes. The paper is a tutorial-like survey of these emerging technologies with the aim to propel the reader to the forefront of research and development in the areas of signal processing and coding for magnetic recording channels.

[1]  Krishna R. Narayanan,et al.  Iterative soft decoding of Reed-Solomon codes , 2004, IEEE Communications Letters.

[2]  Joachim Hagenauer,et al.  A Viterbi algorithm with soft-decision outputs and its applications , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[3]  Charles L. Weber,et al.  Elements of Detection and Signal Design , 1968 .

[4]  Jaekyun Moon.  Modeling the Recording Channel , 2004 .

[5]  Pascal O. Vontobel,et al.  A generalized Blahut-Arimoto algorithm , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[6]  Xiao Ma,et al.  Path partitions and forward-only trellis algorithms , 2003, IEEE Trans. Inf. Theory.

[7]  Li Ping,et al.  Soft-Input, Iterative, Reed-Solomon Decoding using Redundant Parity-Check Equations , 2007, 2007 IEEE Information Theory Workshop.

[8]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .

[9]  John Proakis.  Partial Response Equalization with Application to High Density Magnetic Recording Channels , 2004 .

[10]  A. Patapoutian,et al.  Baseline wander compensation for the perpendicular magnetic recording channel , 2004, IEEE Transactions on Magnetics.

[11]  F. Dolivo,et al.  Preamble recognition and synchronization detection in partial-response systems , 1991, [1991] Conference Record of the Twenty-Fifth Asilomar Conference on Signals, Systems & Computers.

[12]  Krishna R. Narayanan,et al.  Algebraic Soft-Decision Decoding of Reed–Solomon Codes Using Bit-Level Soft Information , 2006, IEEE Transactions on Information Theory.

[13]  B.V.K. Vijaya Kumar,et al.  Timing acquisition for low-SNR data storage channels , 2003, Digest of INTERMAG 2003. International Magnetics Conference (Cat. No.03CH37401).

[14]  Ara Patapoutian.  Head Position Estimation , 2004 .

[15]  J. Moon,et al.  Modeling the Lorentzian magnetic recording channel with transition noise , 2001 .

[16]  William E. Ryan,et al.  Performance of (quasi-)cyclic LDPC codes in noise bursts on the EPR4 channel , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[17]  R. Pighi,et al.  Information rates of multidimensional front ends for digital storage channels with data-dependent transition noise , 2006, IEEE Transactions on Magnetics.

[18]  Aleksandar Kavcic,et al.  A Low-Complexity Method for Chase-Type Decoding of Reed-Solomon Codes , 2006, 2006 IEEE International Symposium on Information Theory.

[19]  Sergio Benedetto,et al.  Algorithm for continuous decoding of turbo codes , 1996 .

[20]  Shu Lin,et al.  Soft-decision decoding of linear block codes based on ordered statistics , 1994, IEEE Trans. Inf. Theory.

[21]  H. Thapar,et al.  A class of partial response systems for increasing storage density in magnetic recording , 1987 .

[22]  B.V.K.V. Kumar,et al.  Field programmable gate array (FPGA) for iterative code evaluation , 2006, IEEE Transactions on Magnetics.

[23]  C.M. Melas,et al.  Adaptive equalization in magnetic-disk storage channels , 1990, IEEE Communications Magazine.

[24]  R. Pighi,et al.  Multidimensional signal processing and detection for storage systems with data-dependent transition noise , 2006, IEEE Transactions on Magnetics.

[25]  V. Sharma,et al.  Entropy and channel capacity in the regenerative setup with applications to Markov channels , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[26]  E.F. Haratsch,et al.  Quasi-Cyclic LDPC Codes for the Magnetic Recording Channel: Code Design and VLSI Implementation , 2007, IEEE Transactions on Magnetics.

[27]  Paul H. Siegel,et al.  On the achievable information rates of finite state ISI channels , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[28]  Wei Zeng,et al.  Trellis-Based Baud-rate Timing Recovery Loop for Magnetic Recording Channels , 2006, 2006 IEEE International Conference on Communications.

[29]  J.R. Barry,et al.  Iterative timing recovery , 2004, IEEE Signal Processing Magazine.

[30]  Thomas J. Richardson,et al.  Error Floors of LDPC Codes , 2003 .

[31]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[32]  J.C.L. van Peppen,et al.  Slider-disk clearance measurements in magnetic disk drives using the readback transducer , 1993, 1993 IEEE Instrumentation and Measurement Technology Conference.

[33]  Steven Kay,et al.  Fundamentals Of Statistical Signal Processing , 2001 .

[34]  Hans-Andrea Loeliger,et al.  On the information rate of binary-input channels with memory , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[35]  Richard C. Singleton,et al.  Maximum distance q -nary codes , 1964, IEEE Trans. Inf. Theory.

[36]  Shaohua Yang,et al.  Capacity of Partial Response Channels , 2004 .

[37]  Jaekyun Moon,et al.  Pattern-dependent noise prediction in signal-dependent noise , 2001, IEEE J. Sel. Areas Commun..

[38]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .

[39]  G. David Forney,et al.  Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference , 1972, IEEE Trans. Inf. Theory.

[40]  Krishna R. Narayanan,et al.  Concatenated Single- Parity Check Codes for High- Density Digital Recording Systems , 2004 .

[41]  Sekhar Tatikonda,et al.  Feedback capacity of finite-state machine channels , 2005, IEEE Transactions on Information Theory.

[42]  Aleksandar Kavcic,et al.  Optimized low-density parity-check codes for partial response channels , 2003, IEEE Communications Letters.

[43]  Jan W. M. Bergmans,et al.  Digital baseband transmission and recording , 1996 .

[44]  Erozan M. Kurtas,et al.  Signal and Noise Generation for Magnetic Recording Channel Simulations , 2004 .

[45]  Sae-Young Chung,et al.  On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit , 2001, IEEE Communications Letters.

[46]  A. Valembois,et al.  Box and match techniques applied to soft-decision decoding , 2002, Proceedings IEEE International Symposium on Information Theory,.

[47]  A. Barron.  THE STRONG ERGODIC THEOREM FOR DENSITIES: GENERALIZED SHANNON-MCMILLAN-BREIMAN THEOREM' , 1985 .

[48]  Pervez Aziz.  Adaptive Equalization Architectures for Partial Response Channels , 2004 .

[49]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[50]  Shu Lin,et al.  Low density parity check codes: construction based on finite geometries , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[51]  A.R. Nayak,et al.  Optimal placement of training symbols for frequency acquisition: a Crame/spl acute/r-rao bound approach , 2006, IEEE Transactions on Magnetics.

[52]  Wenyi Jin,et al.  GEN03-3: Enhanced Box and Match Algorithm for Reliability-Based Soft-Decision Decoding of Linear Block Codes , 2006, IEEE Globecom 2006.

[53]  Madhu Sudan,et al.  Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..

[54]  Wei Zeng,et al.  Simulation-Based Computation of Information Rates for Channels With Memory , 2006, IEEE Transactions on Information Theory.

[55]  Bane V. Vasic,et al.  Combinatorial constructions of low-density parity-check codes for iterative decoding , 2002, IEEE Transactions on Information Theory.

[56]  Alexander Vardy,et al.  Algebraic soft-decision decoding of Reed-Solomon codes , 2003, IEEE Trans. Inf. Theory.

[57]  H. Yada.  Clock jitter in a servo-derived clocking scheme for magnetic disk drives , 1996 .

[58]  Pascal O. Vontobel,et al.  An upper bound on the capacity of channels with memory and constraint input , 2001, Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494).

[59]  Edward A. Lee,et al.  Digital communication (2. ed.) , 1994 .

[60]  John G. Proakis,et al.  Partial response equalizer performance in digital magnetic recording channels , 1993 .

[61]  José M. F. Moura,et al.  The Viterbi algorithm and Markov noise memory , 2000, IEEE Trans. Inf. Theory.

[62]  Paul H. Siegel,et al.  Markov processes asymptotically achieve the capacity of finite-state intersymbol interference channels , 2004, ISIT.

[63]  Claude E. Shannon,et al.  A Mathematical Theory of Communications , 1948 .

[64]  I. Reed,et al.  Polynomial Codes Over Certain Finite Fields , 1960 .

[65]  A. Patapoutian,et al.  Performance of a signal-dependent autoregressive channel model , 2000 .

[66]  R. L. Wallace,et al.  The reproduction of magnetically recorded signals , 1951 .

[67]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[68]  S. McLaughlin,et al.  Joint timing recovery and turbo equalization for coded partial response channels , 2002 .

[69]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.

[70]  Robert A. Scholtz,et al.  Frame Synchronization Techniques , 1980, IEEE Trans. Commun..

[71]  Ara Patapoutian,et al.  Data-dependent synchronization in partial-response systems , 2006, IEEE Transactions on Signal Processing.

[72]  Xiao Ma,et al.  Binary intersymbol interference channels: Gallager codes, density evolution, and code performance bounds , 2003, IEEE Transactions on Information Theory.

[73]  Aleksandar Kavcic.  On the capacity of Markov sources over noisy channels , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[74]  Jr. G. Forney,et al.  Viterbi Algorithm , 1973, Encyclopedia of Machine Learning.

[75]  A. Patapoutian,et al.  Signal-dependent autoregressive channel model , 1999, IEEE International Magnetics Conference.

[76]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[77]  Tolga M. Duman,et al.  Information Theory of Magnetic Recording Channels , 2004 .

[78]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[79]  Bane Vasic,et al.  Spectrum shaping codes , 2004 .