ETRI-Knowledge Sharing Plaform



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


학술대회 Low Complexity Beam Searching Algorithm Using Asymptotic Property of Massive MIMO Systems
Cited 0 time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
김희영, 정재민, 한성배, 김석기, 백승권, 최수용
International Conference on Ubiquitous and Future Networks (ICUFN) 2018, pp.589-591
17HF1600, (통합)초연결 스마트 서비스를 위한 5G 이동통신 핵심기술개발, 정현규
This paper considers a low complexity codebook-based beam searching algorithm for massive MIMO (Multiple Input Multiple Output) systems in limited scattering environments. Based on the asymptotic property of the massive MIMO systems that the channel array response vector converges to the optimal precoding vector derived from channel singular value decomposition (SVD), we propose a independent selection method for the transmitter (TX) and receiver (RX) beam vectors. Due to the independent selection of the Tx and Rx beam vectors from the asymptotic property, the proposed algorithm has a much lower complexity compared to the full search beam selection method. Furthermore, the proposed algorithm shows the similar data rates to the full search beam selection method at low signal to noise ratio regions in a 6-bit codebook system with 64×64 antennas and 2 RF chains at each TX and RX.
KSP 제안 키워드
Full search, Massive MIMO system, Multiple input multiple output(MIMO), Precoding Vector, RF chain, Searching algorithm, Selection method, Signal noise ratio(SNR), Signal-to-Noise, beam selection, data rate