100% found this document useful (2 votes)
49 views

Coding and signal processing for magnetic recording systems 1st Edition Bane Vasic - Download the full ebook set with all chapters in PDF format

The document provides information on various ebooks and textbooks available for download at ebookultra.com, focusing on topics related to coding and signal processing for magnetic recording systems. It highlights specific titles, their authors, and download links, including works by Bane Vasic and others. Additionally, it discusses the advancements in magnetic recording technologies and the importance of signal processing and coding in enhancing data storage capabilities.

Uploaded by

yanekaleydis
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
100% found this document useful (2 votes)
49 views

Coding and signal processing for magnetic recording systems 1st Edition Bane Vasic - Download the full ebook set with all chapters in PDF format

The document provides information on various ebooks and textbooks available for download at ebookultra.com, focusing on topics related to coding and signal processing for magnetic recording systems. It highlights specific titles, their authors, and download links, including works by Bane Vasic and others. Additionally, it discusses the advancements in magnetic recording technologies and the importance of signal processing and coding in enhancing data storage capabilities.

Uploaded by

yanekaleydis
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 29

Download the full version and explore a variety of ebooks

or textbooks at https://ebookultra.com

Coding and signal processing for magnetic


recording systems 1st Edition Bane Vasic

_____ Follow the link below to get your download now _____

https://ebookultra.com/download/coding-and-signal-
processing-for-magnetic-recording-systems-1st-edition-bane-
vasic/

Access ebookultra.com now to download high-quality


ebooks or textbooks
We have selected some products that you may be interested in
Click the link to download now or visit ebookultra.com
for more options!.

Signal processing for magnetic resonance imaging and


spectroscopy 1st Edition Hong Yan

https://ebookultra.com/download/signal-processing-for-magnetic-
resonance-imaging-and-spectroscopy-1st-edition-hong-yan/

Multidimensional signal image and video processing and


coding 2ed Edition Woods J.W.

https://ebookultra.com/download/multidimensional-signal-image-and-
video-processing-and-coding-2ed-edition-woods-j-w/

Signal Processing for Wireless Communications Systems


Information Technology Transmission Processing and Storage
1st Edition H. Vincent Poor
https://ebookultra.com/download/signal-processing-for-wireless-
communications-systems-information-technology-transmission-processing-
and-storage-1st-edition-h-vincent-poor/

Wavelet Analysis and Transient Signal Processing


Applications for Power Systems 1st Edition Zhengyou He

https://ebookultra.com/download/wavelet-analysis-and-transient-signal-
processing-applications-for-power-systems-1st-edition-zhengyou-he/
Audio Signal Processing for Next Generation Multimedia
Communication Systems 1st Edition Yiteng Huang

https://ebookultra.com/download/audio-signal-processing-for-next-
generation-multimedia-communication-systems-1st-edition-yiteng-huang/

Signal Processing and Linear Systems 2nd Edition B. P.


Lathi

https://ebookultra.com/download/signal-processing-and-linear-
systems-2nd-edition-b-p-lathi/

Signal Processing for Digital Communications Artech House


Signal Processing Library George J. Miao

https://ebookultra.com/download/signal-processing-for-digital-
communications-artech-house-signal-processing-library-george-j-miao/

Signal Processing for Intelligent Sensor Systems with


MATLAB Second Edition David C. Swanson

https://ebookultra.com/download/signal-processing-for-intelligent-
sensor-systems-with-matlab-second-edition-david-c-swanson/

Signal Processing for Wireless Communications 1st Edition


Boccuzzi

https://ebookultra.com/download/signal-processing-for-wireless-
communications-1st-edition-boccuzzi/
Coding and signal processing for magnetic recording
systems 1st Edition Bane Vasic Digital Instant Download
Author(s): Bane Vasic, Erozan M. Kurtas
ISBN(s): 9780849315244, 0849315247
Edition: 1
File Details: PDF, 17.19 MB
Year: 2005
Language: english
CODING AND SIGNAL
PROCESSING FOR MAGNETIC
RECORDING SYSTEMS

Copyright 2005 by CRC Press LLC


Computer Engineering Series
Series Editor: Vojin Oklobdzija

Low-Power Electronics Design


Edited by Christian Piguet

Digital Image Sequence Processing,


Compression, and Analysis
Edited by Todd R. Reed

Coding and Signal Processing for


Magnetic Recording Systems
Edited by Bane Vasic and Erozan M. Kurtas

Copyright 2005 by CRC Press LLC


CODING AND SIGNAL
PROCESSING FOR MAGNETIC
RECORDING SYSTEMS

EDITED BY

Bane Vasic
University of Arizona
Tucson, AZ

Erozan M. Kurtas
Seagate Technology
Pittsburgh, PA

CRC PR E S S
Boca Raton London New York Washington, D.C.

Copyright 2005 by CRC Press LLC


Library of Congress Cataloging-in-Publication Data

Coding and signal processing for magnetic recording systems / edited by Bane Vasic and Erozan M. Kurtas.
p. cm. — (Computer engineering; 2)
Includes bibliographical references and index.
ISBN 0-8493-1524-7 (alk. paper)
1. Magnetic recorders and recording. 2. Signal processing. 3. Coding theory.
I. Vasic, Bane II. Kurtas, M. Erozan III. Title IV. Series: Computer engineering (CRC Press); 2.

TK7881.6C62 2004
621.39—dc22
2004050269

This book contains information obtained from authentic and highly regarded sources. Reprinted material is quoted with
permission, and sources are indicated. A wide variety of references are listed. Reasonable efforts have been made to publish
reliable data and information, but the author and the publisher cannot assume responsibility for the validity of all materials
or for the consequences of their use.
Neither this book nor any part may be reproduced or transmitted in any form or by any means, electronic or mechanical,
including photocopying, microfilming, and recording, or by any information storage or retrieval system, without prior
permission in writing from the publisher.
All rights reserved. Authorization to photocopy items for internal or personal use, or the personal or internal use of specific
clients, may be granted by CRC Press LLC, provided that $1.50 per page photocopied is paid directly to Copyright Clearance
Center, 222 Rosewood Drive, Danvers, MA 01923 USA. The fee code for users of the Transactional Reporting Service is
ISBN 0-8493-1524-7/05/$0.00+$1.50. The fee is subject to change without notice. For organizations that have been granted a
photocopy license by the CCC, a separate system of payment has been arranged.
The consent of CRC Press LLC does not extend to copying for general distribution, for promotion, for creating new works, or
for resale. Specific permission must be obtained in writing from CRC Press LLC for such copying.
Direct all inquiries to CRC Press LLC, 2000 N.W. Corporate Blvd., Boca Raton, Florida 33431.
Trademark Notice: Product or corporate names may be trademarks or registered trademarks, and are used only for
identification and explanation, without intent to infringe.

Visit the CRC Press Web site at www.crcpress.com


c 2005 by CRC Press LLC

No claim to original U.S. Government works


International Standard Book Number 0-8493-1524-7
Library of Congress Card Number 2004050269
Printed in the United States of America 1 2 3 4 5 6 7 8 9 0
Printed on acid-free paper

Copyright 2005 by CRC Press LLC


Preface

A steady increase in recording densities and data rates of magnetic recording systems in the last 15 years
is mostly due to advances in recording materials, read/write heads and mechanical designs. The role of
signal processing and coding has been to make the best use of the capacity and speed potentials offered by
these advances. As the recording technology matures, the hard disk drive “read channel” is becoming more
and more advanced, reaching the point where it uses equally or even more complicated signal processing,
coding and modulation algorithms than any other telecommunication channel and where, due to the
speed, power consumption and cost requirements, the challenges in implementing new architectures and
designs have been pushed to today’s integrated circuit manufacturing technology limits.
This book reviews advanced coding and signal processing techniques, and architectures for magnetic
recording read channels. In the most general terms, the read channel controls reading and writing the
data to/from recording medium. The operations performed in the data channel include: timing recovery,
equalization, data detection, modulation coding/decoding and limited error control. Besides this so-called
data channel, a read channel also has a servo channel whose role is to sense head position information,
and to regulate a proper position of the head above the track. The error control functions of a hard drive
reside in a controller, a separate system responsible for a diverse set of electronic and mechanical functions
to provide the user with a data storage system that implements the high-level behavior described by the
magnetic hard drive’s user interface. A trend in hard drive systems is to merge the functionalities of a read
channel and controller into a so-called superchip. This book gives an in-depth treatment of all of these
subsystems, with an emphasis on coding and signal processing aspects.
The book has six sections. Each section begins with a review of the underlying principles and theoretical
foundations, describes the state-of-the-art systems, and ends with novel and most advanced techniques
and methodologies.
The first section gives an introduction to recording systems. After a brief history of magnetic storage,
we give basic principles of physics of longitudinal and perpendicular magnetic recording, and the physics
of optical recording.
A modern hard disk drive comprises a recording medium in the form of a thin film on a surface
of a disk, an inductive write head and a giant magneto-resistive read head. We describe and compare
two types of recording mechanisms: (i) longitudinal recording in which the media magnetic anisotropy
is oriented in the thin film plane, and (ii) perpendicular recording, where the magnetic anisotropy is
aligned perpendicular to the film plane. We discuss a pulse response, the media noise powers, and the
signal-to-noise ratio calculation for both types of recording. In a recording system, the playback noise orig-
inates from the head electronics and the media magnetization random patterns. Generally the medium
noise is decomposed into the direct current (DC) remanent and the transition components. However,
the transition jitter noise is dominant. In longitudinal recording, due to the random anisotropy disper-
sion, there always exist some levels of the DC remanent noise. However, in perpendicular recording,
the loop full squareness is required to maintain thermal stability. Therefore, the DC remanent noise
vanishes.

Copyright 2005 by CRC Press LLC


The principles of optical recording are becoming increasingly important in hard drives because of
a promise of a dramatic increase in the recording density that can be achieved by applying heat assisted
magnetic recording (HAMR). In this approach, a laser beam at the spot where data are being recorded heats
the magnetic medium. Heating the medium results in a reduction of the coercivity required to write the
data to a level accessible by the recording head, while rapid subsequent cooling stabilizes the written data.
We give an introduction and history of magnetic recording heads, their evolution and importance,
followed by a description of the write head for both longitudinal and perpendicular recording. We describe
how various write head design parameters affect the written and read-back waveforms.
It is well understood that one of the key challenges to increasing areal density in magnetic recording
systems is media noise suppression. Reducing the size of magnetic domains written to the medium, which
has been the conventional approach to this problem, has a side effect whereby the magnetic domains
become thermally unstable. To avoid this, so-called super paramagnetic effects media with increased
coercivity are being used. However, the magnetic materials from which the head is made limit the fields
that can be applied, and these limits are being approached. When the bit size is reduced, the signal-to-noise
ratio is decreased, making the detection problem much more difficult.
The first section should equip the reader with a solid understanding of the physical principles of write
and read back processes and constraints in designing a data storage system.
The second section gives communication and information theory tools necessary for a design and analysis
of coding and signal processing techniques. We begin with modeling the recording channel. Design and
analysis of coding and signal processing techniques require a suitable communications channel model for
magnetic storage systems. Such a model should correctly reflect the essential physics of the read and write
processes of magnetic recording, but must also provide a system level description that allows convenient
design, analysis and simulation of the communications and signal processing techniques under study. We
introduce common signal and noise models for recording channel models, statistical analysis tools, and
partial response (PR) signaling as a method of controlling the intersymbol interference (ISI). We give
models for medium noise, nonlinear distortion of magnetic transitions, and jitter. We show the effect of
these noises on a number of conventional data detectors.
The first chapter on error control codes introduces finite fields and error correction capabilities of
algebraically constructed and decoded codes. We introduce finite fields, define linear codes over finite fields,
discuss the relation between minimum distance and error correction capability of a code, introduce cyclic
codes and Reed-Solomon (RS) codes and explain in detail their encoding and decoding algorithms. The
second chapter gives a theoretical foundation of message-passing algorithms and linear time sub-optimal
probabilistic decoding algorithms that achieve near optimum performance. Recently such algorithms
have attracted tremendous interest and have been investigated as an alternative decoding scheme for new
generation of read channels.
The next chapter reviews sofic systems, the theoretical foundation of constrained (or modulation) codes
that are used to translate an arbitrary sequence of user data to a channel sequence with special properties
required by the physics of the recording medium. Modulation coding in a read channel serves a variety
of important roles. Generally speaking, modulation coding eliminates those sequences from a recorded
stream that would degrade the error performance, for example, long runs of consecutive symbols that
impact the timing recovery or sequences that result in signals on a small Euclidian distance.
The section ends with a view of recording channels from the information theory standpoint, and a
chapter summarizing techniques for bounding the capacity of a PR channel. Such results are very important
in that they provide theoretical limits on the performance of practical coding/decoding schemes. Since
recording channels can be modeled as ISI channels with binary inputs, we first present the capacity of
the general ISI channels with additive white Gaussian noise, which is achieved by correlated Gaussian
inputs. When taking the constraint of binary inputs into account, no closed-form solutions exist; however,
several upper and lower bounds are derived. Monte-Carlo simulation techniques to estimate the achievable
information rates of ISI channels are also described. The simulation-based techniques can be extended

Copyright 2005 by CRC Press LLC


further to compute the achievable information rates of the magnetic recording channels with media noise,
present in high density recording systems.
The third section begins with a description of physical and logical organization of data in various
recording systems and methods of increasing recording density. Then we give a cross section of the state-
of-the-art read channels and explain their subsystems. We explain organization of data on the disc tracks,
servo sectors and data sectors, seeking and tracking operations, and phase and frequency acquisition. The
section on servo information detection explains sensing radial information and read channel subsystem
used to perform this operation.
The image of a magnetic storage device presented to a host computer by a standard interface is an
abstraction quite different from the reality of the actual mechanisms providing the means for storing
data. The device’s presentation via the interface is that of a linear and contiguous array of data blocks
that are trivially read from and stored in a defect-free space of logical blocks. This image belies the
elaborate choreography of signal processing, coding, data structure, control systems, and digital electronics
technologies that is exercised with every block of data moved to and from the magnetic media. The function
of a hard drive controller is to implement and coordinate the operation of these disparate technologies so
as to map the behavior of the physical storage device into the abstract storage model defined by the drive’s
interface to the host computer. The chapter on hard drive controllers describes some of the architectures
implemented by current hard drive controllers to serve this function.
The fourth section is concerned with modulation and error control coding for read channels. It starts
with an introduction of modulation coding techniques. The first class of constraints discussed is the
runlength constraint. It is the most common constraint in hard drives and is imposed to bound the
minimal or maximal lengths of consecutive like channel symbols in order to improve timing recovery,
reduce intersymbol interference in channels with excess bandwidth and reduce transition noise in nonlinear
media. We also discuss other important classes of codes: namely maximum transition run (MTR) coding
and spectrum shaping codes.
Maximum transition run constraint, which limits the number of consecutive transitions, improves
minimum distance properties of recorded sequences for a variety of channel responses applicable to
recording systems. The channel is characterized by types of error events and their occurrence probability,
and pairs of coded sequences that produce these errors are determined. This ambiguity is resolved by
simply enforcing a constraint in the encoder, which prevents one or both of the coded sequences.
The first type of spectrum shaping codes considered here is codes with higher order spectral zero at
zero frequency. Another class of spectrum shaping codes was invented to support the use of frequency
multiplexing technique for track following. Both techniques require the existence of spectral nulls at
nonzero frequencies. The third class of spectrum shaping codes is those that give rise to spectral lines.
Their purpose is to give the reference information to the head positioning servo system.
We continue with modulation codes with error correcting capability and convolutional codes for PR
channels designed to increase the minimum Euclidean distance. The section continues with an overview
of the research in new classes of modulation codes and detection techniques: capacity approaching codes
for partial response channels, coding and detection for multitrack systems and two-dimensional PR
equalization and error control.
The fifth section gives an in depth treatment of the signal processing techniques for read channels. In PR
channels a clock is used to sample the analog waveform to provide discrete samples to symbol-by-symbol
and sequence (Viterbi) detectors. Improper synchronization of these discrete samples with respect to those
expected by the detectors for a given partial response will degrade the eventual bit error rate (BER) of the
system. The goal of adaptive timing recovery is to produce samples for a sequence detector that are at the
desired sampling instances for the partial response being used. We review the basics of timing recovery as
well as commonly used algorithms for timing recovery in magnetic recording channels, and we introduce a
novel technique called interpolated timing recovery. We also introduce adaptive equalization architectures
for partial response channels.

Copyright 2005 by CRC Press LLC


Data in a disk drive is stored in concentric tracks, and when a given track needs to be accessed, the head
assembly moves the read/write head to the appropriate radial location. This positioning of the head on
top of a given track and maintaining a proper position is achieved by the use of a feedback servo system.
The servo system analysis includes a chapter on head position estimation and a chapter on servo signal
processing. The first chapter reviews methods to estimate the head position, which is uniquely determined
from the radial and angular position of the head with respect to a disk surface.
The second chapter gives an overview of servo channel signal processing using examples of techniques
employed in practical servo channels. It reviews how detectors for PR channels can be used to improve
the detection of the servo data with time varying Viterbi detector matched to a servo code.
The first article on data detection gives the basic detection principles and techniques. The second one
describes signal dependent detectors. It introduces the concepts and tools necessary for performing optimal
detection for ISI channels when the noise is not AWGN and signal dependent. We describe the techniques
to design both hard and soft decision detectors, in particular the so-called K-step, noise prediction and
signal dependent noise prediction detectors.
We end this section with an overview of traditional architectures for signal processing in magnetic read-
write channels. Today’s dominant architecture, where the majority of signal processing is performed in
the digital domain is analyzed in detail. The main challenges and alternatives for implementation of major
building blocks are discussed. As the previous chapters had covered the theoretical aspects of operation
of these blocks in considerable detail, most of the discussion in this chapter focuses on architectures and
techniques that are used in practical read channels. The techniques for implementing iterative decoders as
possible future detectors are presented at the end of this chapter.
We conclude this book by the review of new trends in coding, namely iterative decoding, given in the
sixth section. Iterative coding techniques that improve the reliability of input-constrained ISI channels
have recently driven considerable attention in magnetic recording applications.
It has been shown that randomly selected codes of very large block lengths can achieve channel capacity.
One way of obtaining a large block length code is concatenating two simple codes so that the encoding
and the decoding of the overall code are less complex. Turbo codes represent a way of concatenating two
simple codes to obtain codes that achieve the channel capacity. In turbo coding, two systematic recursive
constituent convolutional encoders are concatenated in parallel via a long interleaver. For decoding, a
practical suboptimal iterative decoding algorithm is employed. The first chapter in this section describes
the turbo coding principle in detail.
Drawing inspiration from the success of turbo codes, several authors have considered iterative decoding
architectures for coding schemes combining concatenation of outer block, convolutional or turbo encoder
with a rate one code representing the channel. Such an architecture is equivalent to a serial concatenation
of codes with the inner code being the ISI channel. The decoding of such concatenated codes is facilitated
using the concept of codes on graphs.
We continue with an introduction to low-density parity check (LDPC) codes, and describe single-parity
check turbo product codes and well-structured LDPC codes. We describe several classes of combinatorially
constructed LDPC codes along with their performance PR channels. Due to their mathematical structure,
and unlike random codes, these LDPC codes can lend themselves to very low complexity implementa-
tions. We describe constructions of regular Gallager LDPC codes based on combinatorial designs, finite
geometries and finite lattices.
Two constructions of single-parity check (SPC) codes are considered, one in the form of turbo codes
where two SPC branches are concatenated in parallel using a random interleaver, and the other in the
form of product codes where multiple SPC codewords are arranged row-wise and column-wise in a
two-dimensional array. Despite their small minimum distances, concatenated SPC codes, when combined
with a precoded PR channel, possess good distance spectra.
The last chapter introduces turbo coding for multi-track recording channels. It describes a modified
maximum a posteriori (MAP) detector for the multi-track systems with deterministic or random ITI.

Copyright 2005 by CRC Press LLC


The turbo equalization and the iterative decoding are performed by exchanging the soft information
between the channel MAP detector and the outer soft-input soft-output decoder that corresponds to the
outer encoder. The resulting system performance is very close to the information theoretical limits.
We would like to end this preface by acknowledging the excellent work done by the contributors. Also
it is a pleasure to acknowledge the financial support from the National Science Foundation (Grant CCR
020859) and the continuous support from the Information Storage Industry Consortium and Seagate
Technologies.
Bane Vasic
Erozan M. Kurtas

Copyright 2005 by CRC Press LLC


Contributor Listing

Viswanath Annampedu Bruce Buch Dusan Drajic


Agere Systems Maxtor Corporation Faculty of Electrical
Storage Products Shrewsbury, MA Engineering
Allentown, PA University of Belgrade
William A. Challener Serbia and Montenegro
Pervez Aziz Seagate Technology
Agere Systems Pittsburgh, PA Tolga M. Duman
Storage Products Department of Electrical
Dallas, TX Roy W. Chantrell Engineering
Seagate Technology Arizona State University
Dragana Bajic Pittsburgh, PA Tempe, AZ
Faculty of Technical Sciences
University of Novi Sad Willem A. Clarke Mehmet Fatih Erden
Serbia and Montenegro Department of Electrical and Seagate Technology
Electronic Engineering Pittsburgh, PA
John R. Barry Rand Afrikaans University
School of Electrical and Auckland Park, South Africa John L. Fan
Computer Engineering Flarion Technologies
Georgia Institute of Stojan Denic Bedminster, NJ
Technology School of Information
Atlanta, GA Technology and Engineering Hendrik C. Ferreira
University of Ottawa Department of Electrical and
Mario Blaum Ottawa, ON Electronic Engineering
Hitachi Global Storage Rand Afrikaans University
Technologies Miroslav Despotović Auckland Park, South Africa
San Jose, CA Department of Electrical
Engineering and Kiyoshi Fukahori
Eric D. Boerner Computer Science TDK Semiconductor
Seagate Technology Faculty of Engineering Corporation
Pittsburgh, PA University of Novi Sad, Mountain View, CA
Serbia and Montenegro
Barrett J. Brickner Roy W. Gustafson
Bermai, Inc. Seagate Technology
Minnetonka, MN Pittsburgh, PA

Copyright 2005 by CRC Press LLC


Mark A. Herro Jing Li Borivoje Nikolic
Department of Electrical and Department of Electrical and Department of Electrical
Electronic Engineering Computer Engineering Engineering and Computer
University College Lehigh University Sciences
Dublin, Ireland Bethlehem, PA University of California
Berkeley, CA
Kees A. Schouhamer Immink Michael Link
University of Essen Seagate Technology Travis Oenning
Essen, Germany Pittsburgh, PA IBM Corporation,
Turing Machines Inc. Rochester, MI
Rotterdam, Netherlands Xiao Ma
Department of Electronic Dean Palmer
Aleksandar Kavčić Engineering Seagate Technology
Division of Engineering and City University of Hong Kong Minneapolis, MN
Applied Sciences Kowloon, Hong Kong
Harvard University Jongseung Park
Boston, MA Brian Marcus Seagate Technology
Department of Mathematics Pittsburgh, PA
Mustafa Kaynak University of British Columbia
Department of Electrical Vancouver, BC Ara Patapoutian
Engineering Maxtor Corporation
Arizona State University Terry W. McDaniel Shrewsbury, MA
Tempe, AZ Seagate Technology
Pittsburgh, PA John Proakis
Brian M. King Department of Electrical and
Electrical and Computer Olgica Milenkovic Computer Engineering
Engineering Department Electrical and Computer University of California
Worcester Polytechnic Institute Engineering Department San Diego
Worcester, MA University of Colorado San Diego, CA
Boulder, CO
Piya Kovintavewat William Radich
School of Electrical and Jaekyun Moon Seagate Technology
Computer Engineering Department of Electrical and Pittsburgh, PA
Georgia Institute of Computer Engineering
Technology University of Minnesota Thomas A. Roscamp
Atlanta, GA Minneapolis, MN Seagate Technology
Pittsburgh, PA
Erozan M. Kurtas Krishna R. Narayanan
Seagate Technology Texas A&M University Robert E. Rottmayer
Pittsburgh, PA College Park, TX Seagate Technology
Pittsburgh, PA
Alexander Kuznetsov Mark A. Neifeld
Seagate Technology Electrical and Computer William E. Ryan
Pittsburgh, PA Engineering Department Department of Electrical and
University of Arizona Computer Engineering
Michael Leung Tucson, AZ 85721 University of Arizona
SolarFlare Communications Tucson, AZ
Irvine, CA

Copyright 2005 by CRC Press LLC


Sundararajan Sankaranarayanan Bartolomeu F. Uchôa-Filho Xueshi Yang
Department of Electrical and Department of Electrical Seagate Technology
Computer Engineering Engineering Pittsburgh, PA
University of Arizona Federal University of Santa
Tucson, AZ Catarina Engling Yeo
Florianopolis, Brazil Department of Electrical
Necip Sayiner Engineering and Computer
Agere Systems Nedeljko Varnica Sciences
Allentown, PA Division of Engineering and University of California
Applied Sciences Berkeley, CA
Vojin Šenk Harvard University
Department of Electrical Boston, MA Zheng Zhang
Engineering and Department of Electrical
Computer Science Bane Vasic Engineering
Faculty of Engineering Department of Electrical and Arizona State University
University of Novi Sad Computer Engineering Tempe, AZ
Novi Sad, Yugoslavia Department of Mathematics
University of Arizona Hong J. Zhou
Emina Soljanin Tucson, AZ Seagate Technology
Bell Laboratories Pittsburgh, PA
Lucent Technologies Shaohua Yang
Murray Hill, NJ Division of Engineering and
Applied Sciences
Harvard University
Boston, MA

Copyright 2005 by CRC Press LLC


Contents

Section I: Recording Systems

1 A Brief History of Magnetic Storage


Dean Palmer

2 Physics of Longitudinal and Perpendicular Recording


Hong Zhou, Tom Roscamp, Roy Gustafson, Eric Boernern, and Roy Chantrell

3 The Physics of Optical Recording


William A. Challener and Terry W. McDaniel

4 Head Design Techniques for Recording Devices


Robert E. Rottmayer

Section II: Communication and Information Theory


of Magnetic Recording Channels

5 Modeling the Recording Channel


Jaekyun Moon

6 Signal and Noise Generation for Magnetic Recording Channel Simulations


Xueshi Yang and Erozan M. Kurtas

7 Statistical Analysis of Digital Signals and Systems


Dragana Bajic and Dusan Drajic

8 Partial Response Equalization with Application to High Density


Magnetic Recording Channels
John G. Proakis

9 An Introduction to Error-Correcting Codes


Mario Blaum

Copyright 2005 by CRC Press LLC


10 Message-Passing Algorithm
Sundararajan Sankaranarayanan and Bane Vasic

11 Modulation Codes for Storage Systems


Brian Marcus and Emina Soljanin

12 Information Theory of Magnetic Recording Channels


Zheng Zhang, Tolga M. Duman, and Erozan M. Kurtas

13 Capacity of Partial Response Channels


Shaohua Yang and Aleksandar Kavčić

Section III: Introduction to Read Channels

14 Recording Physics and Organization of Data on a Disk


Bane Vasic, Miroslav Despotović, and Vojin Šenk

15 Read Channels for Hard Drives


Bane Vasic, Pervez M. Aziz, and Necip Sayiner

16 An Overview of Hard Drive Controller Functionality


Bruce Buch

Section IV: Coding for Read Channels

17 Runlength Limited Sequences


Kees A. Schouhamer Immink

18 Maximum Transition Run Coding


Barrett J. Brickner

19 Spectrum Shaping Codes


Stojan Denic and Bane Vasic

20 Introduction to Constrained Binary Codes with Error Correction Capability


Hendrik C. Ferreira and Willem A. Clarke

21 Constrained Coding and Error-Control Coding


John L. Fan

22 Convolutional Codes for Partial-Response Channels


Bartolomeu F. Uchôa-Filho, Mark A. Herro, Miroslav Despotović,
and Vojin Šenk

23 Capacity-Approaching Codes for Partial Response Channels


Nedeljko Varnica, Xiao Ma, and Aleksandar Kavčić

Copyright 2005 by CRC Press LLC


24 Coding and Detection for Multitrack Systems
Bane Vasic and Olgica Milenkovic

25 Two-Dimensional Data Detection and Error Control


Brian M. King and Mark A. Neifeld

Section V: Signal Processing for Read Channels

26 Adaptive Timing Recovery for Partial Response Channels


Pervez M. Aziz and Viswanath Annampedu

27 Interpolated Timing Recovery


Piya Kovintavewat, John R. Barry, M. Fatih Erden, and Erozan M. Kurtas

28 Adaptive Equalization Architectures for Partial Response Channels


Pervez M. Aziz

29 Head Position Estimation


Ara Patapoutian

30 Servo Signal Processing


Pervez M. Aziz and Viswanath Annampedu

31 Evaluation of Thermal Asperity in Magnetic Recording


M. Fatih Erden, Erozan M. Kurtas, and Michael J. Link

32 Data Detection
Miroslav Despotović and Vojin Šenk

33 Detection Methods for Data-dependent Noise in Storage Channels


Erozan M. Kurtas, Jongseung Park, Xueshi Yang, William Radich,
and Aleksandar Kavčić

34 Read/Write Channel Implementation


Borivoje Nikolić, Michael Leung, Engling Yeo, and Kiyoshi Fukahori

Section VI: Iterative Decoding

35 Turbo Codes
Mustafa N. Kaynak, Tolga M. Duman, and Erozan M. Kurtas

36 An Introduction to LDPC Codes


William E. Ryan

Copyright 2005 by CRC Press LLC


Exploring the Variety of Random
Documents with Different Content
containing a part of this work or any other work associated with
Project Gutenberg™.

1.E.5. Do not copy, display, perform, distribute or redistribute


this electronic work, or any part of this electronic work, without
prominently displaying the sentence set forth in paragraph 1.E.1
with active links or immediate access to the full terms of the
Project Gutenberg™ License.

1.E.6. You may convert to and distribute this work in any binary,
compressed, marked up, nonproprietary or proprietary form,
including any word processing or hypertext form. However, if
you provide access to or distribute copies of a Project
Gutenberg™ work in a format other than “Plain Vanilla ASCII” or
other format used in the official version posted on the official
Project Gutenberg™ website (www.gutenberg.org), you must,
at no additional cost, fee or expense to the user, provide a copy,
a means of exporting a copy, or a means of obtaining a copy
upon request, of the work in its original “Plain Vanilla ASCII” or
other form. Any alternate format must include the full Project
Gutenberg™ License as specified in paragraph 1.E.1.

1.E.7. Do not charge a fee for access to, viewing, displaying,


performing, copying or distributing any Project Gutenberg™
works unless you comply with paragraph 1.E.8 or 1.E.9.

1.E.8. You may charge a reasonable fee for copies of or


providing access to or distributing Project Gutenberg™
electronic works provided that:

• You pay a royalty fee of 20% of the gross profits you derive
from the use of Project Gutenberg™ works calculated using the
method you already use to calculate your applicable taxes. The
fee is owed to the owner of the Project Gutenberg™ trademark,
but he has agreed to donate royalties under this paragraph to
the Project Gutenberg Literary Archive Foundation. Royalty
payments must be paid within 60 days following each date on
which you prepare (or are legally required to prepare) your
periodic tax returns. Royalty payments should be clearly marked
as such and sent to the Project Gutenberg Literary Archive
Foundation at the address specified in Section 4, “Information
about donations to the Project Gutenberg Literary Archive
Foundation.”

• You provide a full refund of any money paid by a user who


notifies you in writing (or by e-mail) within 30 days of receipt
that s/he does not agree to the terms of the full Project
Gutenberg™ License. You must require such a user to return or
destroy all copies of the works possessed in a physical medium
and discontinue all use of and all access to other copies of
Project Gutenberg™ works.

• You provide, in accordance with paragraph 1.F.3, a full refund of


any money paid for a work or a replacement copy, if a defect in
the electronic work is discovered and reported to you within 90
days of receipt of the work.

• You comply with all other terms of this agreement for free
distribution of Project Gutenberg™ works.

1.E.9. If you wish to charge a fee or distribute a Project


Gutenberg™ electronic work or group of works on different
terms than are set forth in this agreement, you must obtain
permission in writing from the Project Gutenberg Literary
Archive Foundation, the manager of the Project Gutenberg™
trademark. Contact the Foundation as set forth in Section 3
below.

1.F.

1.F.1. Project Gutenberg volunteers and employees expend


considerable effort to identify, do copyright research on,
transcribe and proofread works not protected by U.S. copyright
law in creating the Project Gutenberg™ collection. Despite these
efforts, Project Gutenberg™ electronic works, and the medium
on which they may be stored, may contain “Defects,” such as,
but not limited to, incomplete, inaccurate or corrupt data,
transcription errors, a copyright or other intellectual property
infringement, a defective or damaged disk or other medium, a
computer virus, or computer codes that damage or cannot be
read by your equipment.

1.F.2. LIMITED WARRANTY, DISCLAIMER OF DAMAGES - Except


for the “Right of Replacement or Refund” described in
paragraph 1.F.3, the Project Gutenberg Literary Archive
Foundation, the owner of the Project Gutenberg™ trademark,
and any other party distributing a Project Gutenberg™ electronic
work under this agreement, disclaim all liability to you for
damages, costs and expenses, including legal fees. YOU AGREE
THAT YOU HAVE NO REMEDIES FOR NEGLIGENCE, STRICT
LIABILITY, BREACH OF WARRANTY OR BREACH OF CONTRACT
EXCEPT THOSE PROVIDED IN PARAGRAPH 1.F.3. YOU AGREE
THAT THE FOUNDATION, THE TRADEMARK OWNER, AND ANY
DISTRIBUTOR UNDER THIS AGREEMENT WILL NOT BE LIABLE
TO YOU FOR ACTUAL, DIRECT, INDIRECT, CONSEQUENTIAL,
PUNITIVE OR INCIDENTAL DAMAGES EVEN IF YOU GIVE
NOTICE OF THE POSSIBILITY OF SUCH DAMAGE.

1.F.3. LIMITED RIGHT OF REPLACEMENT OR REFUND - If you


discover a defect in this electronic work within 90 days of
receiving it, you can receive a refund of the money (if any) you
paid for it by sending a written explanation to the person you
received the work from. If you received the work on a physical
medium, you must return the medium with your written
explanation. The person or entity that provided you with the
defective work may elect to provide a replacement copy in lieu
of a refund. If you received the work electronically, the person
or entity providing it to you may choose to give you a second
opportunity to receive the work electronically in lieu of a refund.
If the second copy is also defective, you may demand a refund
in writing without further opportunities to fix the problem.

1.F.4. Except for the limited right of replacement or refund set


forth in paragraph 1.F.3, this work is provided to you ‘AS-IS’,
WITH NO OTHER WARRANTIES OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO WARRANTIES OF
MERCHANTABILITY OR FITNESS FOR ANY PURPOSE.

1.F.5. Some states do not allow disclaimers of certain implied


warranties or the exclusion or limitation of certain types of
damages. If any disclaimer or limitation set forth in this
agreement violates the law of the state applicable to this
agreement, the agreement shall be interpreted to make the
maximum disclaimer or limitation permitted by the applicable
state law. The invalidity or unenforceability of any provision of
this agreement shall not void the remaining provisions.

1.F.6. INDEMNITY - You agree to indemnify and hold the


Foundation, the trademark owner, any agent or employee of the
Foundation, anyone providing copies of Project Gutenberg™
electronic works in accordance with this agreement, and any
volunteers associated with the production, promotion and
distribution of Project Gutenberg™ electronic works, harmless
from all liability, costs and expenses, including legal fees, that
arise directly or indirectly from any of the following which you
do or cause to occur: (a) distribution of this or any Project
Gutenberg™ work, (b) alteration, modification, or additions or
deletions to any Project Gutenberg™ work, and (c) any Defect
you cause.

Section 2. Information about the Mission


of Project Gutenberg™
Project Gutenberg™ is synonymous with the free distribution of
electronic works in formats readable by the widest variety of
computers including obsolete, old, middle-aged and new
computers. It exists because of the efforts of hundreds of
volunteers and donations from people in all walks of life.

Volunteers and financial support to provide volunteers with the


assistance they need are critical to reaching Project
Gutenberg™’s goals and ensuring that the Project Gutenberg™
collection will remain freely available for generations to come. In
2001, the Project Gutenberg Literary Archive Foundation was
created to provide a secure and permanent future for Project
Gutenberg™ and future generations. To learn more about the
Project Gutenberg Literary Archive Foundation and how your
efforts and donations can help, see Sections 3 and 4 and the
Foundation information page at www.gutenberg.org.

Section 3. Information about the Project


Gutenberg Literary Archive Foundation
The Project Gutenberg Literary Archive Foundation is a non-
profit 501(c)(3) educational corporation organized under the
laws of the state of Mississippi and granted tax exempt status
by the Internal Revenue Service. The Foundation’s EIN or
federal tax identification number is 64-6221541. Contributions
to the Project Gutenberg Literary Archive Foundation are tax
deductible to the full extent permitted by U.S. federal laws and
your state’s laws.

The Foundation’s business office is located at 809 North 1500


West, Salt Lake City, UT 84116, (801) 596-1887. Email contact
links and up to date contact information can be found at the
Foundation’s website and official page at
www.gutenberg.org/contact
Section 4. Information about Donations to
the Project Gutenberg Literary Archive
Foundation
Project Gutenberg™ depends upon and cannot survive without
widespread public support and donations to carry out its mission
of increasing the number of public domain and licensed works
that can be freely distributed in machine-readable form
accessible by the widest array of equipment including outdated
equipment. Many small donations ($1 to $5,000) are particularly
important to maintaining tax exempt status with the IRS.

The Foundation is committed to complying with the laws


regulating charities and charitable donations in all 50 states of
the United States. Compliance requirements are not uniform
and it takes a considerable effort, much paperwork and many
fees to meet and keep up with these requirements. We do not
solicit donations in locations where we have not received written
confirmation of compliance. To SEND DONATIONS or determine
the status of compliance for any particular state visit
www.gutenberg.org/donate.

While we cannot and do not solicit contributions from states


where we have not met the solicitation requirements, we know
of no prohibition against accepting unsolicited donations from
donors in such states who approach us with offers to donate.

International donations are gratefully accepted, but we cannot


make any statements concerning tax treatment of donations
received from outside the United States. U.S. laws alone swamp
our small staff.

Please check the Project Gutenberg web pages for current


donation methods and addresses. Donations are accepted in a
number of other ways including checks, online payments and
credit card donations. To donate, please visit:
www.gutenberg.org/donate.

Section 5. General Information About


Project Gutenberg™ electronic works
Professor Michael S. Hart was the originator of the Project
Gutenberg™ concept of a library of electronic works that could
be freely shared with anyone. For forty years, he produced and
distributed Project Gutenberg™ eBooks with only a loose
network of volunteer support.

Project Gutenberg™ eBooks are often created from several


printed editions, all of which are confirmed as not protected by
copyright in the U.S. unless a copyright notice is included. Thus,
we do not necessarily keep eBooks in compliance with any
particular paper edition.

Most people start at our website which has the main PG search
facility: www.gutenberg.org.

This website includes information about Project Gutenberg™,


including how to make donations to the Project Gutenberg
Literary Archive Foundation, how to help produce our new
eBooks, and how to subscribe to our email newsletter to hear
about new eBooks.
Welcome to our website – the ideal destination for book lovers and
knowledge seekers. With a mission to inspire endlessly, we offer a
vast collection of books, ranging from classic literary works to
specialized publications, self-development books, and children's
literature. Each book is a new journey of discovery, expanding
knowledge and enriching the soul of the reade

Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.

Let us accompany you on the journey of exploring knowledge and


personal growth!

ebookultra.com

You might also like