
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

A Computationally Efficient FanoBased Sequential Detection Algorithm for VBLAST Systems
Jongsub CHA Joonhyuk KANG
Publication
IEICE TRANSACTIONS on Communications
Vol.E90B
No.6
pp.15281531 Publication Date: 2007/06/01
Online ISSN: 17451345
DOI: 10.1093/ietcom/e90b.6.1528
Print ISSN: 09168516 Type of Manuscript: LETTER Category: Wireless Communication Technologies Keyword: MIMO, VBLAST, sphere detection, Fano algorithm,
Full Text: PDF(204.2KB)>>
Summary:
We present a computationally efficient sequential detection scheme using a modified Fano algorithm (MFA) for VBLAST 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).

