Weighted sum rate optimization for downlink multiuser MIMO coordinated base station systems: Centralized and distributed algorithms
Saved in:
| Title: | Weighted sum rate optimization for downlink multiuser MIMO coordinated base station systems: Centralized and distributed algorithms |
|---|---|
| Authors: | Bogale, Tadilo Endeshaw, Vandendorpe, Luc |
| Contributors: | UCL - SST/ICTM/ELEN - Pôle en ingénierie électrique |
| Source: | IEEE Transactions on Signal Processing, Vol. 60, no. 4, p. 1876-1889 (2012) |
| Publication Year: | 2012 |
| Collection: | DIAL@USL-B (Université Saint-Louis, Bruxelles) |
| Subject Terms: | Distributed optimization and convex optimization, Matrix fractional minimization, Global optimum, Iterative algorithm, Linear algorithms, Linear transceiver, Local optima, Minimum mean-square-errors (MMSE), Multi-user, Multi-user MIMO, Multiple-input-multiple-output systems, Multiuser multiple-input-multiple-output (MIMO), Optimal receiver, Optimization variables, Power constraints, Precoders, Rate, Single antenna, Weighted sum-rate, Antennas, Base stations, Channel estimation, Convex optimization, Matrix algebra, Mean square error, Optimization, Telecommunication repeaters, Algorithms, Centralized algorithms, Closed-form expression |
| Description: | This paper considers the joint linear transceiver design problem for the downlink multiuser multiple-input-multiple-output (MIMO) systems with coordinated base stations (BSs). We consider maximization of the weighted sum rate with per BS antenna power constraint problem. We propose novel centralized and computationally efficient distributed iterative algorithms that achieve local optimum to the latter problem. These algorithms are described as follows. First, by introducing additional optimization variables, we reformulate the original problem into a new problem. Second, for the given precoder matrices of all users, the optimal receivers are computed using minimum mean-square-error (MMSE) method and the optimal introduced variables are obtained in closed form expressions. Third, by keeping the introduced variables and receivers constant, the precoder matrices of all users are optimized by using second-order-cone programming (SOCP) and matrix fractional minimization approaches for the centralized and distributed algorithms, respectively. Finally, the second and third steps are repeated until these algorithms converge. We have shown that the proposed algorithms are guaranteed to converge. We also show that the proposed algorithms require less computational cost than that of the existing linear algorithm. All simulation results demonstrate that our distributed algorithm achieves the same performance as that of the centralized algorithm. Moreover, the proposed algorithms outperform the existing linear algorithm. In particular, when each of the users has single antenna, we have observed that the proposed algorithms achieve the global optimum. © 2011 IEEE. |
| Document Type: | article in journal/newspaper |
| Language: | English |
| Relation: | boreal:110340; http://hdl.handle.net/2078.1/110340 |
| DOI: | 10.1109/TSP.2011.2179538 |
| Availability: | http://hdl.handle.net/2078.1/110340 https://doi.org/10.1109/TSP.2011.2179538 |
| Rights: | info:eu-repo/semantics/restrictedAccess |
| Accession Number: | edsbas.92E24A5D |
| Database: | BASE |
Nájsť tento článok vo Web of Science Be the first to leave a comment!