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.
| Original language | English |
|---|---|
| Pages (from-to) | 544-558 |
| Number of pages | 15 |
| Journal | IEICE Transactions on Communications |
| Volume | E92-B |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 2009 Feb |
Fingerprint
Keywords
- Complexity reduction
- Maximum likelihood detection
- MIMO system
- Spatial multiplexing
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Computer Networks and Communications
- Software
Cite this
Tree based approximate optimal signal detectors for MIMO spatial multiplexing systems. / Jiang, Wenjie; Asai, Yusuke; Kubota, Shuji.
In: IEICE Transactions on Communications, Vol. E92-B, No. 2, 02.2009, p. 544-558.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Tree based approximate optimal signal detectors for MIMO spatial multiplexing systems
AU - Jiang, Wenjie
AU - Asai, Yusuke
AU - Kubota, Shuji
PY - 2009/2
Y1 - 2009/2
N2 - 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.
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.
KW - Complexity reduction
KW - Maximum likelihood detection
KW - MIMO system
KW - Spatial multiplexing
UR - http://www.scopus.com/inward/record.url?scp=77952863381&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77952863381&partnerID=8YFLogxK
U2 - 10.1587/transcom.E92.B.544
DO - 10.1587/transcom.E92.B.544
M3 - Article
AN - SCOPUS:77952863381
VL - E92-B
SP - 544
EP - 558
JO - IEICE Transactions on Communications
JF - IEICE Transactions on Communications
SN - 0916-8516
IS - 2
ER -