TY - GEN
T1 - Joint transceiver design and user grouping in a MIMO interfering broadcast channel
AU - Razaviyayn, Meisam
AU - Baligh, Hadi
AU - Callard, Aaron
AU - Luo, Zhi-Quan
PY - 2011/6/6
Y1 - 2011/6/6
N2 - Consider a MIMO interfering broadcast channel (multi-cellular network) where each base station transmits signals to the users in its own cell. The basic problem is to design linear transmit/receive beamformers that can maximize the system throughput in the presence of both inter and intra cell interference. To ensure user fairness in the system, we consider the joint user grouping, power allocation and beamformer design problem by maximizing a system utility which aims to strike a suitable trade-off between the user fairness and system throughput. We propose a simple algorithm to solve this nonconcave utility maximization problem and establish its convergence. The simulation results show that the proposed algorithm significantly outperforms the SVD-MMSE method and some other approaches in terms of system throughput while respecting user fairness. The proposed algorithm exhibits fast convergence and is amenable to distributed implementation with limited information exchange.
AB - Consider a MIMO interfering broadcast channel (multi-cellular network) where each base station transmits signals to the users in its own cell. The basic problem is to design linear transmit/receive beamformers that can maximize the system throughput in the presence of both inter and intra cell interference. To ensure user fairness in the system, we consider the joint user grouping, power allocation and beamformer design problem by maximizing a system utility which aims to strike a suitable trade-off between the user fairness and system throughput. We propose a simple algorithm to solve this nonconcave utility maximization problem and establish its convergence. The simulation results show that the proposed algorithm significantly outperforms the SVD-MMSE method and some other approaches in terms of system throughput while respecting user fairness. The proposed algorithm exhibits fast convergence and is amenable to distributed implementation with limited information exchange.
UR - http://www.scopus.com/inward/record.url?scp=79957874707&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79957874707&partnerID=8YFLogxK
U2 - 10.1109/CISS.2011.5766122
DO - 10.1109/CISS.2011.5766122
M3 - Conference contribution
AN - SCOPUS:79957874707
SN - 9781424498475
T3 - 2011 45th Annual Conference on Information Sciences and Systems, CISS 2011
BT - 2011 45th Annual Conference on Information Sciences and Systems, CISS 2011
T2 - 2011 45th Annual Conference on Information Sciences and Systems, CISS 2011
Y2 - 23 March 2011 through 25 March 2011
ER -