Abstract
본 논문은 포트 당 일정 파워 제약을 전제한 상황에서, 다중 안테나를 장착한 분산 안테나 (distributed antenna: DA) 포트를 갖는 분산 안테나 시스템 (distributed antenna system: DAS)의 안테나 위치 설계 방법을 분석한다. 안테나 위치의 설계를 위해 복잡하게 셀 당 평균 ergodic sum rate를 최대화하는 대신, 본 논문에서는 단일 셀 상황에서는 signal-to-noise ratio (SNR) 기댓값의 lower bound에, 그리고 이중 셀 상황에서는 signal-to-leakage ratio (SLR) 기댓값의 lower bound에 각각 초점을 맞춘다. 단일 셀 상황의 경우, 기존의 반복적 알고리즘에 비해 SNR criterion의 최적화 문제는 닫힌 형태 (closed-form)의 솔루션을 제공한다. 또한, 이중 셀 상황에선 gradient ascent 방법을 이용한 알고리즘을 제안하여 SLR criterion의 최적화 솔루션을 도출한다. In this paper, we optimize antenna locations for a distributed antenna system (DAS) with distributed antenna (DA) ports equipped with multiple antennas under per-DA port power constraint. Maximum ratio transmission and scaled zero-forcing beamforming are employed for single-user and multi-user DAS, respectively. Instead of maximizing the cell average ergodic sum rate, we focus on a lower bound of the expected signal-to-noise ratio (SNR) for the single-cell scenario and the expected signal-to-leakage ratio (SLR) for the two-cell scenario to determine antenna locations. For the single-cell case, optimization of the SNR criterion generates a closed form solution in comparison to conventional iterative algorithms. Also, a gradient ascent algorithm is proposed to solve the SLR criterion for the two-cell scenario. Simulation results show that DAS with antenna locations obtained from the proposed algorithms achieve capacity gains over traditional centralized antenna systems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: The Journal of Korean Institute of Communications and Information Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.