Abstract
Fixed-delay tree search with decision feedback (FDTS/DF) has been proposed for retrieving data from hard disk drives. One problem with the algorithm as originally posed is the large number of serial operations that must be performed during one clock cycle. The authors explore the decision space in FDTS/DF using linear discriminants, which leads to a geometric depiction of the decision space. For channels with a d=0 minimum runlength constraint the number of serial computations reduces to one multiplication and one addition. More importantly, though, on high density channels with a d=1 minimum runlength constraint, the detector can be implemented as a multilevel decision feedback equalizer. >
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
