Close category search window
 

Comparison of computationally efficient forms of FDTS/DF against PR4-ML

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
$31 $13
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

2 Author(s)
Carley, L.R. ; Dept. of Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, USA ; Kenney, J.G.

The authors compare the error-rate performance and circuit complexity of fixed-delay tree search with decision-feedback (FDTS/DF) to that of Class IV partial response equalization followed by Viterbi detection (PR4-ML). The impact of realistic impulse responses, misequalization, phase errors, and offtrack interference on both detection strategies is explored. Two computationally efficient methods for implementing FDTS/DF are presented. These FDTS/DF architectures avoid explicit multiplication-one uses a RAM-based table lookup and the other uses binary equalization over the tree-depth

Published in:
Magnetics, IEEE Transactions on  (Volume:27 ,  Issue: 6 )

Date of Publication: Nov 1991

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.