ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

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

상세정보

학술지 A Novel Subspace Tracking Algorithm and its Application to Blind Multiuser Detection in Cellular CDMA Systems
Cited 4 time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
저자
Imran Ali, 김덕년, 송윤정, Naeem Zafar Azeemi
발행일
201006
출처
Journal of Communications and Networks, v.12 no.3, pp.216-221
ISSN
1229-2370
출판사
한국통신학회
DOI
https://dx.doi.org/10.1109/JCN.2010.6388449
협약과제
10MR4800, AT-DMB 상용화 테스트 지원, 송윤정
초록
In this paper, we propose and develop a new algorithm for the principle subspace tracking by orthonormalizing the eigenvectors using an approximation of Gram-Schmidt procedure. We carry out a novel mathematical derivation to show that when this approximated version of Gram-Schmidt procedure is added to a modified form of projection approximation subspace tracking deflation (PASTd) algorithm, the eigenvectors can be orthonormalized within a linear computational complexity. While the PASTd algorithm tries to extracts orthonormalized eigenvectors, the new scheme orthonormalizes the eigenvectors after their extraction, yielding much more tacking efficiency. We apply the new tracking scheme for blind adaptive multiuser detection for non-stationary cellular CDMA environment and use extensive simulation results to demonstrate the performance improvement of the proposed scheme. © 2010 KICS.
키워드
Code division multiple access (cdma), GramSchmidt procedure, Multiuser detection, Subspace tracking
KSP 제안 키워드
Adaptive multiuser detection, Blind multiuser detection, CDMA systems, Carry out, Code division Multiple Access(CDMA), Gram-Schmidt, Linear computational complexity, Modified form, Non-Stationary, PASTd algorithm, Projection approximation