Low Complexity Fano-Based Detection Algorithm with Iterative Structure for V-BLAST Systems

Jongsub CHA; Hyoungsuk JEON; Hyuckjae LEE

doi:10.1093/ietcom/e91-b.1.347

Low Complexity Fano-Based Detection Algorithm with Iterative Structure for V-BLAST Systems

Jongsub CHA, Hyoungsuk JEON, Hyuckjae LEE

Full Text Views

0

Share
Cite this

Summary :

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

Publication: IEICE TRANSACTIONS on Communications Vol.E91-B No.1 pp.347-350

Publication Date: 2008/01/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1093/ietcom/e91-b.1.347

Type of Manuscript: LETTER

Category: Wireless Communication Technologies

Cite this

Copy

Jongsub CHA, Hyoungsuk JEON, Hyuckjae LEE, "Low Complexity Fano-Based Detection Algorithm with Iterative Structure for V-BLAST Systems" in IEICE TRANSACTIONS on Communications, vol. E91-B, no. 1, pp. 347-350, January 2008, doi: 10.1093/ietcom/e91-b.1.347.
Abstract: 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).
URL: https://globals.ieice.org/en_transactions/communications/10.1093/ietcom/e91-b.1.347/_p

Copy

@ARTICLE{e91-b_1_347,
author={Jongsub CHA, Hyoungsuk JEON, Hyuckjae LEE, },
journal={IEICE TRANSACTIONS on Communications},
title={Low Complexity Fano-Based Detection Algorithm with Iterative Structure for V-BLAST Systems},
year={2008},
volume={E91-B},
number={1},
pages={347-350},
abstract={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).},
keywords={},
doi={10.1093/ietcom/e91-b.1.347},
ISSN={1745-1345},
month={January},}

Copy

TY - JOUR
TI - Low Complexity Fano-Based Detection Algorithm with Iterative Structure for V-BLAST Systems
T2 - IEICE TRANSACTIONS on Communications
SP - 347
EP - 350
AU - Jongsub CHA
AU - Hyoungsuk JEON
AU - Hyuckjae LEE
PY - 2008
DO - 10.1093/ietcom/e91-b.1.347
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E91-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2008
AB - 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).
ER -