Near optimum multiuser detection with closest lattice point search

Byonghyo Shim, Insung Kang

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

1 Citation (Scopus)

Abstract

In this paper, we consider a low-complexity multiuser detection for downlink of high speed packet access (HSPA) system. Instead of attempting to perform the maximum likelihood (ML) detection of all users in multiple cells, which is impractical for battery powered mobile receiver, we utilize interference cancelled chips obtained from iterative linear minimum mean square error (LMMSE) estimation to perform a near ML detection in a reduced dimensional system. As a result, the worst case complexity of the detection process, achieved by the closest lattice point search (CLPS), is bounded to a controllable level irrespective of multipath spans. Further, by exploiting the LMMSE estimate in tightening the hypersphere condition of the CLPS algorithm so called sphere decoding, we achieve significant improvement in search complexity. From the simulations on realistic downlink communication scenario in HSPA systems, we show that the proposed method offers substantial performance gain over conventional receiver algorithms with implementable complexity.

Original languageEnglish
Title of host publicationIEEE International Conference on Communications
DOIs
Publication statusPublished - 2011 Sep 2
Event2011 IEEE International Conference on Communications, ICC 2011 - Kyoto, Japan
Duration: 2011 Jun 52011 Jun 9

Other

Other2011 IEEE International Conference on Communications, ICC 2011
CountryJapan
CityKyoto
Period11/6/511/6/9

Fingerprint

Multiuser detection
Mean square error
Maximum likelihood
Error analysis
Decoding
Communication

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Shim, B., & Kang, I. (2011). Near optimum multiuser detection with closest lattice point search. In IEEE International Conference on Communications [5963308] https://doi.org/10.1109/icc.2011.5963308

Near optimum multiuser detection with closest lattice point search. / Shim, Byonghyo; Kang, Insung.

IEEE International Conference on Communications. 2011. 5963308.

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

Shim, B & Kang, I 2011, Near optimum multiuser detection with closest lattice point search. in IEEE International Conference on Communications., 5963308, 2011 IEEE International Conference on Communications, ICC 2011, Kyoto, Japan, 11/6/5. https://doi.org/10.1109/icc.2011.5963308
Shim B, Kang I. Near optimum multiuser detection with closest lattice point search. In IEEE International Conference on Communications. 2011. 5963308 https://doi.org/10.1109/icc.2011.5963308
Shim, Byonghyo ; Kang, Insung. / Near optimum multiuser detection with closest lattice point search. IEEE International Conference on Communications. 2011.
@inproceedings{fbfc62c23e814eba965d01448b5007c1,
title = "Near optimum multiuser detection with closest lattice point search",
abstract = "In this paper, we consider a low-complexity multiuser detection for downlink of high speed packet access (HSPA) system. Instead of attempting to perform the maximum likelihood (ML) detection of all users in multiple cells, which is impractical for battery powered mobile receiver, we utilize interference cancelled chips obtained from iterative linear minimum mean square error (LMMSE) estimation to perform a near ML detection in a reduced dimensional system. As a result, the worst case complexity of the detection process, achieved by the closest lattice point search (CLPS), is bounded to a controllable level irrespective of multipath spans. Further, by exploiting the LMMSE estimate in tightening the hypersphere condition of the CLPS algorithm so called sphere decoding, we achieve significant improvement in search complexity. From the simulations on realistic downlink communication scenario in HSPA systems, we show that the proposed method offers substantial performance gain over conventional receiver algorithms with implementable complexity.",
author = "Byonghyo Shim and Insung Kang",
year = "2011",
month = "9",
day = "2",
doi = "10.1109/icc.2011.5963308",
language = "English",
isbn = "9781612842332",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

T1 - Near optimum multiuser detection with closest lattice point search

AU - Shim, Byonghyo

AU - Kang, Insung

PY - 2011/9/2

Y1 - 2011/9/2

N2 - In this paper, we consider a low-complexity multiuser detection for downlink of high speed packet access (HSPA) system. Instead of attempting to perform the maximum likelihood (ML) detection of all users in multiple cells, which is impractical for battery powered mobile receiver, we utilize interference cancelled chips obtained from iterative linear minimum mean square error (LMMSE) estimation to perform a near ML detection in a reduced dimensional system. As a result, the worst case complexity of the detection process, achieved by the closest lattice point search (CLPS), is bounded to a controllable level irrespective of multipath spans. Further, by exploiting the LMMSE estimate in tightening the hypersphere condition of the CLPS algorithm so called sphere decoding, we achieve significant improvement in search complexity. From the simulations on realistic downlink communication scenario in HSPA systems, we show that the proposed method offers substantial performance gain over conventional receiver algorithms with implementable complexity.

AB - In this paper, we consider a low-complexity multiuser detection for downlink of high speed packet access (HSPA) system. Instead of attempting to perform the maximum likelihood (ML) detection of all users in multiple cells, which is impractical for battery powered mobile receiver, we utilize interference cancelled chips obtained from iterative linear minimum mean square error (LMMSE) estimation to perform a near ML detection in a reduced dimensional system. As a result, the worst case complexity of the detection process, achieved by the closest lattice point search (CLPS), is bounded to a controllable level irrespective of multipath spans. Further, by exploiting the LMMSE estimate in tightening the hypersphere condition of the CLPS algorithm so called sphere decoding, we achieve significant improvement in search complexity. From the simulations on realistic downlink communication scenario in HSPA systems, we show that the proposed method offers substantial performance gain over conventional receiver algorithms with implementable complexity.

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

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

U2 - 10.1109/icc.2011.5963308

DO - 10.1109/icc.2011.5963308

M3 - Conference contribution

SN - 9781612842332

BT - IEEE International Conference on Communications

ER -