By Topic

Least-squares storage-channel identification

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Cioffi, J.M. ; Stanford University, Department of Electrical Engineering, California 94305, USA

Pulse (dibit) and step (transition) responses for magnetic-storage channels are important for detection-circuitry design and for comparison of various media, heads, and other channel components. This paper presents a least-squares procedure that can be used to identify the dibit and transition responses from measurements of the read-head response to any known data sequence written on the medium. The method yields significantly higher-quality estimates for the dibit and step shapes than does determining these same characteristics by measuring the average response to isolated transition or by performing a Discrete Fourier Transform (DFT) on the response to a pseudorandom data pattern. The new method can be implemented off line but also can be made sufficiently efficient to be implemented with a microprocessor for use in self-optimizing (adaptive) channel detection circuitry.

Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.  

Published in:

IBM Journal of Research and Development  (Volume:30 ,  Issue: 3 )