ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 Block Iterative CM-based Blind Multiuser Detector
Cited 0 time in scopus Download 1 time Share share facebook twitter linkedin kakaostory
저자
방승재, 신석주, Anders Host Madsen
발행일
200604
출처
IEICE Transactions on Communications, v.E89-B no.4, pp.1443-1446
ISSN
0916-8516
출판사
일본, 전자정보통신학회 (IEICE)
DOI
https://dx.doi.org/10.1093/ietcom/e89-b.4.1443
초록
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 제안 키워드
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