ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

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

상세정보

학술대회 Cholesky Based Efficient Algorithms for the MMSE-SIC Receiver
Cited 6 time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
저자
남준영, 김성락, 정현규, 최진호, 하정석
발행일
200711
출처
Global Telecommunications Conference (GLOBECOM) 2007, pp.3045-3050
DOI
https://dx.doi.org/10.1109/GLOCOM.2007.577
협약과제
07MM1300, 4세대 이동통신용 적응 무선접속 및 전송 기술개발, 김진업
초록
The minimum mean square error with successive interference cancellation (MMSE-SIC) receiver is known to achieve the capacity of multiple-input multiple-output (MIMO) fast fading channels in the presence of knowledge of the channel at the receiver. This paper presents efficient and numerically stable Cholesky decomposition based detection algorithms for MMSE-SIC, exploiting a property of ordering of MMSE-SIC. The proposed algorithms are shown to significantly reduce the computational complexity of existing efficient algorithms for SIC in MIMO flat fading channels. © 2007 IEEE.
KSP 제안 키워드
Cholesky decomposition, Computational complexity, Detection algorithm, Efficient algorithms, Flat fading channels, MMSE-SIC, Minimum Mean Square Error(MMSE), Multiple input multiple output(MIMO), SIC receiver, Successive Interference Cancellation, fast fading channels