Abstract
Abstract In this study, we propose several power allocation schemes in a coordinated base station downlink transmission with per antenna and per base station power constraints. Block Diagonalization is employed to remove interference among users. For each set of power constraints, two schemes based on the waterfilling distribution are proposed and compared to the optimal solution, which can only be obtained numerically by using convex optimization. We show that the proposed schemes achieve a performance, in terms of weighted sum rate, very close to the optimal, without the heavy computational complexity required by the latter. The sum rates are compared first in a simplified two-user two-cell case where we also compare our approach to the previous solutions available in the literature. Then, we examine the performance in a multi-cell scenario where we also evaluate the degradation of the performance caused by imperfect channel state information.
Highlights
Space-division multiplexing (SDM) based on multiple input-multiple output (MIMO) techniques emerged as a means of achieving high-capacity communications [1]
We focus on block diagonalization (BD)-based coordinated base station transmission (CBST) with different power constraints at the transmission side, with the aim of maximizing the weighted sum rate (WSR) of the García Armada et al EURASIP Journal on Wireless Communications and Networking 2011, 2011:125 http://jwcn.eurasipjournals.com/content/2011/1/125 users in a cellular network
It can be seen that the gap between the achievable rates obtained with WF and modified waterfilling (MWF) and the optimal solution convex optimization (CVX) is very narrow for the case of per base station constraints, while for the per antenna constraints, the difference between CVX and the waterfilling distributions becomes more noticeable
Summary
Space-division multiplexing (SDM) based on multiple input-multiple output (MIMO) techniques emerged as a means of achieving high-capacity communications [1]. With the per base station constraints, the solution of the problem is given by a point [P*, μ*] that satisfies the set of Nr +M equations: αi λij ln(2) (1 + λijPij)
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: EURASIP Journal on Wireless Communications and Networking
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.
