Near-ML detection over a reduced dimension hypersphere

Jun Won Choi, Byonghyo Shim, Andrew C. Singer

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we propose a near-maximum likelihood (ML) detection method referred to as reduced dimension ML search (RD-MLS). The RD-MLS detector is based on a partitioned search method that divides the symbol space into two groups and searches over the vector space of one group instead of that comprising all of the symbols. First, a minimum mean square error (MMSE) dimension reduction operator suppressing the interference from the second group is applied, and then a list tree search (LTS) is performed over the symbols in the first group. For each lattice point of symbols for the first group found from the LTS, the rest of symbols are estimated by MMSE-decision feedback (MMSE-DF) estimation. Among these lattice point candidates, a final solution is chosen as a minimizer of the L2-norm criterion. From an asymptotic error probability analysis, we show that the dimension reduction loss is potentially compensated by the LTS gain proportional to the size of the list. Furthermore, we demonstrate through simulation on multi-input multi-output (MIMO) transmissions that the RD-MLS detector achieves substantial complexity reduction with relatively little performance loss over ML detection.

Original languageEnglish
Title of host publicationGLOBECOM - IEEE Global Telecommunications Conference
DOIs
Publication statusPublished - 2009 Dec 1
Event2009 IEEE Global Telecommunications Conference, GLOBECOM 2009 - Honolulu, HI, United States
Duration: 2009 Nov 302009 Dec 4

Other

Other2009 IEEE Global Telecommunications Conference, GLOBECOM 2009
CountryUnited States
CityHonolulu, HI
Period09/11/3009/12/4

Fingerprint

Maximum likelihood
Mean square error
Detectors
Vector spaces
Mathematical operators
Feedback
Error probability

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Choi, J. W., Shim, B., & Singer, A. C. (2009). Near-ML detection over a reduced dimension hypersphere. In GLOBECOM - IEEE Global Telecommunications Conference [5426075] https://doi.org/10.1109/GLOCOM.2009.5426075

Near-ML detection over a reduced dimension hypersphere. / Choi, Jun Won; Shim, Byonghyo; Singer, Andrew C.

GLOBECOM - IEEE Global Telecommunications Conference. 2009. 5426075.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Choi, JW, Shim, B & Singer, AC 2009, Near-ML detection over a reduced dimension hypersphere. in GLOBECOM - IEEE Global Telecommunications Conference., 5426075, 2009 IEEE Global Telecommunications Conference, GLOBECOM 2009, Honolulu, HI, United States, 09/11/30. https://doi.org/10.1109/GLOCOM.2009.5426075
Choi JW, Shim B, Singer AC. Near-ML detection over a reduced dimension hypersphere. In GLOBECOM - IEEE Global Telecommunications Conference. 2009. 5426075 https://doi.org/10.1109/GLOCOM.2009.5426075
Choi, Jun Won ; Shim, Byonghyo ; Singer, Andrew C. / Near-ML detection over a reduced dimension hypersphere. GLOBECOM - IEEE Global Telecommunications Conference. 2009.
@inproceedings{83d08fc9a5564e95998f476838fd39ca,
title = "Near-ML detection over a reduced dimension hypersphere",
abstract = "In this paper, we propose a near-maximum likelihood (ML) detection method referred to as reduced dimension ML search (RD-MLS). The RD-MLS detector is based on a partitioned search method that divides the symbol space into two groups and searches over the vector space of one group instead of that comprising all of the symbols. First, a minimum mean square error (MMSE) dimension reduction operator suppressing the interference from the second group is applied, and then a list tree search (LTS) is performed over the symbols in the first group. For each lattice point of symbols for the first group found from the LTS, the rest of symbols are estimated by MMSE-decision feedback (MMSE-DF) estimation. Among these lattice point candidates, a final solution is chosen as a minimizer of the L2-norm criterion. From an asymptotic error probability analysis, we show that the dimension reduction loss is potentially compensated by the LTS gain proportional to the size of the list. Furthermore, we demonstrate through simulation on multi-input multi-output (MIMO) transmissions that the RD-MLS detector achieves substantial complexity reduction with relatively little performance loss over ML detection.",
author = "Choi, {Jun Won} and Byonghyo Shim and Singer, {Andrew C.}",
year = "2009",
month = "12",
day = "1",
doi = "10.1109/GLOCOM.2009.5426075",
language = "English",
isbn = "9781424441488",
booktitle = "GLOBECOM - IEEE Global Telecommunications Conference",

}

TY - GEN

T1 - Near-ML detection over a reduced dimension hypersphere

AU - Choi, Jun Won

AU - Shim, Byonghyo

AU - Singer, Andrew C.

PY - 2009/12/1

Y1 - 2009/12/1

N2 - In this paper, we propose a near-maximum likelihood (ML) detection method referred to as reduced dimension ML search (RD-MLS). The RD-MLS detector is based on a partitioned search method that divides the symbol space into two groups and searches over the vector space of one group instead of that comprising all of the symbols. First, a minimum mean square error (MMSE) dimension reduction operator suppressing the interference from the second group is applied, and then a list tree search (LTS) is performed over the symbols in the first group. For each lattice point of symbols for the first group found from the LTS, the rest of symbols are estimated by MMSE-decision feedback (MMSE-DF) estimation. Among these lattice point candidates, a final solution is chosen as a minimizer of the L2-norm criterion. From an asymptotic error probability analysis, we show that the dimension reduction loss is potentially compensated by the LTS gain proportional to the size of the list. Furthermore, we demonstrate through simulation on multi-input multi-output (MIMO) transmissions that the RD-MLS detector achieves substantial complexity reduction with relatively little performance loss over ML detection.

AB - In this paper, we propose a near-maximum likelihood (ML) detection method referred to as reduced dimension ML search (RD-MLS). The RD-MLS detector is based on a partitioned search method that divides the symbol space into two groups and searches over the vector space of one group instead of that comprising all of the symbols. First, a minimum mean square error (MMSE) dimension reduction operator suppressing the interference from the second group is applied, and then a list tree search (LTS) is performed over the symbols in the first group. For each lattice point of symbols for the first group found from the LTS, the rest of symbols are estimated by MMSE-decision feedback (MMSE-DF) estimation. Among these lattice point candidates, a final solution is chosen as a minimizer of the L2-norm criterion. From an asymptotic error probability analysis, we show that the dimension reduction loss is potentially compensated by the LTS gain proportional to the size of the list. Furthermore, we demonstrate through simulation on multi-input multi-output (MIMO) transmissions that the RD-MLS detector achieves substantial complexity reduction with relatively little performance loss over ML detection.

UR - http://www.scopus.com/inward/record.url?scp=77951527664&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77951527664&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.2009.5426075

DO - 10.1109/GLOCOM.2009.5426075

M3 - Conference contribution

SN - 9781424441488

BT - GLOBECOM - IEEE Global Telecommunications Conference

ER -