A computationally efficient fano-based sequential detection algorithm for V-BLAST systems

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 360
  • Download : 0
We present a computationally efficient sequential detection scheme using a modified Fano algorithm (MFA) for V-BLAST systems. The proposed algorithm consists of the following three steps: initialization, tree searching, and optimal selection. In the first step, the proposed detection scheme chooses several candidate symbols at the tree level of one. Based on these symbols, the NIFA then finds the remaining transmitted symbols from the second tree level in the original tree structure. Finally, an optimal symbol sequence is decided among the most likely candidate sequences searched in the previous step. Computer simulation shows that the proposed scheme yields significant saving in complexity with very small performance degradation compared with that of sphere detection (SD).
Publisher
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
Issue Date
2007-06
Language
English
Article Type
Article
Citation

IEICE TRANSACTIONS ON COMMUNICATIONS, v.E90B, no.6, pp.1528 - 1531

ISSN
0916-8516
URI
http://hdl.handle.net/10203/88430
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0