A Computationally Efficient Fano-Based Sequential Detection Algorithm for V-BLAST Systems

Jongsub CHA
Joonhyuk KANG

IEICE TRANSACTIONS on Communications   Vol.E90-B    No.6    pp.1528-1531
Publication Date: 2007/06/01
Online ISSN: 1745-1345
DOI: 10.1093/ietcom/e90-b.6.1528
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Wireless Communication Technologies
MIMO,  V-BLAST,  sphere detection,  Fano algorithm,  

Full Text: PDF>>
Buy this Article

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 MFA 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).