Tree Based Approximate Optimal Signal Detectors for MIMO Spatial Multiplexing Systems
Summary :
In multiple antenna systems that use spatial multiplexing to raise transmission rates, it is preferable to use maximum likelihood (ML) detection to exploit the full receive diversity and minimize the error probability. In this paper, we present two tree based approximate ML detectors that use new two ordering criteria in conjunction with efficient search strategies. Unlike conventional tree detectors, the new detectors closely approximate the error performance of the exact ML detector while achieving a dramatic reduction in complexity. Moreover, they ensure a fixed detection delay and high level of parallelization in the tree search.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E92-B No.2 pp.544-558
- Publication Date
- 2009/02/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E92.B.544
- Type of Manuscript
- PAPER
- Category
- Wireless Communication Technologies
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Wenjie JIANG, Yusuke ASAI, Shuji KUBOTA, "Tree Based Approximate Optimal Signal Detectors for MIMO Spatial Multiplexing Systems" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 2, pp. 544-558, February 2009, doi: 10.1587/transcom.E92.B.544.
Abstract: In multiple antenna systems that use spatial multiplexing to raise transmission rates, it is preferable to use maximum likelihood (ML) detection to exploit the full receive diversity and minimize the error probability. In this paper, we present two tree based approximate ML detectors that use new two ordering criteria in conjunction with efficient search strategies. Unlike conventional tree detectors, the new detectors closely approximate the error performance of the exact ML detector while achieving a dramatic reduction in complexity. Moreover, they ensure a fixed detection delay and high level of parallelization in the tree search.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.544/_p
Copy
@ARTICLE{e92-b_2_544,
author={Wenjie JIANG, Yusuke ASAI, Shuji KUBOTA, },
journal={IEICE TRANSACTIONS on Communications},
title={Tree Based Approximate Optimal Signal Detectors for MIMO Spatial Multiplexing Systems},
year={2009},
volume={E92-B},
number={2},
pages={544-558},
abstract={In multiple antenna systems that use spatial multiplexing to raise transmission rates, it is preferable to use maximum likelihood (ML) detection to exploit the full receive diversity and minimize the error probability. In this paper, we present two tree based approximate ML detectors that use new two ordering criteria in conjunction with efficient search strategies. Unlike conventional tree detectors, the new detectors closely approximate the error performance of the exact ML detector while achieving a dramatic reduction in complexity. Moreover, they ensure a fixed detection delay and high level of parallelization in the tree search.},
keywords={},
doi={10.1587/transcom.E92.B.544},
ISSN={1745-1345},
month={February},}
Copy
TY - JOUR
TI - Tree Based Approximate Optimal Signal Detectors for MIMO Spatial Multiplexing Systems
T2 - IEICE TRANSACTIONS on Communications
SP - 544
EP - 558
AU - Wenjie JIANG
AU - Yusuke ASAI
AU - Shuji KUBOTA
PY - 2009
DO - 10.1587/transcom.E92.B.544
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2009
AB - In multiple antenna systems that use spatial multiplexing to raise transmission rates, it is preferable to use maximum likelihood (ML) detection to exploit the full receive diversity and minimize the error probability. In this paper, we present two tree based approximate ML detectors that use new two ordering criteria in conjunction with efficient search strategies. Unlike conventional tree detectors, the new detectors closely approximate the error performance of the exact ML detector while achieving a dramatic reduction in complexity. Moreover, they ensure a fixed detection delay and high level of parallelization in the tree search.
ER -
English
