Low complexity Fano-based detection algorithm with iterative structure for V-BLAST systems

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 527
  • Download : 0
We present a computationally efficient Fano detection algorithm with an iterative structure for V-BLAST systems. As our previous work, we introduced a Fano-based sequential detection scheme with three interrelated steps whose computational loads are excessive. To deal with the computational inefficiency, the proposed algorithm is redesigned by the addition of two steps: preparation and iterative tree searching. In particular, it employs an early stop technique to avoid the unnecessary iteration or to stop the needless searching process of the algorithm. Computer simulation shows that the proposed scheme yields significant saving in complexity with very small performance degradation, compared with sphere detection (SD).
Publisher
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
Issue Date
2008-01
Language
English
Article Type
Article
Citation

IEICE TRANSACTIONS ON COMMUNICATIONS, v.E91B, no.1, pp.347 - 350

ISSN
0916-8516
DOI
10.1093/ietcom/e91-b.1.347
URI
http://hdl.handle.net/10203/91825
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