Architectures for the implementation of a fixed delay tree search detector

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 136
  • Download : 0
This paper examines the tradeoff between fixed delay tree search (FDTS) detector complexity and performance with various modulation codes, Several architectures suitable for implementing FDTS or achieving performance comparable to FDTS are presented. Recursive forms are derived by decomposing the branch metric computation while breaking down the entire path metric yields nonrecursive forms, The final architecture casts the detection problem Into a signal space context in which the observation space is partitioned into decision regions, These structures are presented and evaluated in the context of an analog very large scale integration (VLSI) implementation, Compared to a direct mapping to hardware of the original algorithm, these alternative schemes offer reduced power consumption and/or increased data rate.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
1997-03
Language
ENG
Article Type
Article
Keywords

DECISION-FEEDBACK EQUALIZATION; MAGNETIC RECORDING CHANNEL; STORAGE; FDTS/DF

Citation

IEEE TRANSACTIONS ON MAGNETICS, v.33, no.2, pp.1116 - 1124

ISSN
0018-9464
DOI
10.1109/20.558535
URI
http://hdl.handle.net/10203/69772
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0