Towards the Performance of ML and the Complexity of MMSE: A Hybrid Approach for Multiuser Detection
- Authors
- Shim, Byonghyo; Choi, Jun Won; Kang, Insung
- Issue Date
- 7월-2012
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Keywords
- Closest lattice point search; sphere decoding; multiuser detection; Babai point; noncausal path metric
- Citation
- IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, v.11, no.7, pp.2508 - 2519
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS
- Volume
- 11
- Number
- 7
- Start Page
- 2508
- End Page
- 2519
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/108030
- DOI
- 10.1109/TWC.2012.051512.111220
- ISSN
- 1536-1276
- Abstract
- In this paper, we consider a low-complexity multiuser detection for downlink of high speed packet access (HSPA) of universal mobile telecommunications system (UMTS). Instead of attempting to perform 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. Furthermore, 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 simulations on realistic downlink communication scenario in HSPA systems, we show that the proposed method offers substantial performance gain over conventional receiver algorithms with reasonable complexity.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Informatics > Department of Computer Science and Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.