BROWSE
Detail
Journal Article
Block Iterative CM-based Blind Multiuser Detector
Cited 0 time in 
Download 1 time
Share 
Download 1 time
Share
- Authors
- Seung Jae Bahng, Seok Joo Shin, Anders Host-Madsen
- Issue Date
- 2006-04
- Citation
- IEICE Transactions on Communications, v.E89-B, no.4, pp.1443-1446
- ISSN
- 0916-8516
- Publisher
- 일본, 전자정보통신학회 (IEICE)
- Language
- English
- Type
- Journal Article
- Abstract
- Motivated by the result in [12] we present a new block iterative multiuser detection algorithm utilizing the constant modulus (CM) property of data symbols. The proposed iterative detector is developed based on a constrained least square (LS) cost function and CM projection. It can be seen as an extension of least squares constant modulus algorithm [1] in a sense that it minimizes the CM and the LS cost functions iteratively. Simulation study shows that even for a reasonably small number of symbols, say around 100 received symbols, the proposed iterative detector approaches the performance of ideal MMSE detector and considerably out-performs the conventional blind detectors, such as subspace blind method [7] or MOE detector [5]. Copyright © 2006 The Institute of Electronics, Information and Communication Engineers.
- KSP Keywords
- Blind multiuser detector, Constant Modulus Algorithm(CMA), Constrained least square, Cost Function, Detection algorithm, Information and communication, Iterative multiuser detection, Least Squares(LS), Simulation study, blind method