A two-path tree search algorithm for use with DFE

The two-path tree search is a detection algorithm that improves the performance of standard decision-feedback equalizer detectors by examining two likely paths through the decision tree. The method achieves about 1-dB improvement over standard decision-feedback equalization for typical magnetic reco...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on communications Vol. 48; no. 6; pp. 913 - 916
Main Authors Xiaodong Wang, Spencer, R.R.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.06.2000
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Channels
Decision feedback equalizers
Decision trees
Detection algorithms
Detectors
Disk drives
Equalization
Equalizers
Filters
Intersymbol interference
Iron
Magnetic recording
Maximum likelihood estimation
Polynomials
Signal to noise ratio
Trees
Online AccessGet full text

Cover

More Information
Summary:The two-path tree search is a detection algorithm that improves the performance of standard decision-feedback equalizer detectors by examining two likely paths through the decision tree. The method achieves about 1-dB improvement over standard decision-feedback equalization for typical magnetic recording channels used in hard disk drives. The implementation complexity is modest and is compared with other improved decision-feedback structures.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0090-6778
1558-0857
DOI:10.1109/26.848547