240 0

Towards the Performance of ML and the Complexity of MMSE: A Hybrid Approach for Multiuser Detection

Title
Towards the Performance of ML and the Complexity of MMSE: A Hybrid Approach for Multiuser Detection
Author
최준원
Keywords
Closest lattice point search; sphere decoding; multiuser detection; Babai point; noncausal path metric
Issue Date
2012-07
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 445 HOES LANE, PISCATAWAY, NJ 08855-4141 USA
Citation
IEEE Transactions on Wireless Communications , 11권, 7호, 2508p ~ 2519p
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.
URI
http://ieeexplore.ieee.org/document/6204012/http://hdl.handle.net/20.500.11754/38015
ISSN
1536-1276
DOI
10.1109/TWC.2012.051512.111220
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > ELECTRICAL AND BIOMEDICAL ENGINEERING(전기·생체공학부) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE