Transceiver designs with matrix-version water-filling architecture under mixed power constraints  

作　　者：Chengwen XING Zesong FEI Yiqing ZHOU Zhengang PAN Hualei WANG 

机构地区：[1]School of Information and Electronics, Beijing Institute of Technology, Beijing 100081, China [2]Wireless Communication Research Center, Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190, China [3]China Mobile Research Institute, Beijing 100053, China

出　　处：《Science China(Information Sciences)》2016年第10期165-176,共12页中国科学（信息科学）（英文版）

基　　金：supported by National Natural Science Foundation of China (Grant No. 61421001);111 Project of China (Grant No. B14010);National High Technology Research and Development Program of China (Grant No. 2014AA01A701);China Mobile Research Institute (Grant No. [2014]451)

摘　　要：In this paper, we investigate the multiple-input multiple-output （MIMO） transceiver design under an interesting power model named mixed power constraints. In the considered power model, several antenna subsets are constrained by sum power constraints while the other antennas are subject to per-antenna power constraints. This kind of transceiver designs includes both the transceiver designs under sum power constraint and per-antenna power constraint as its special cases. This kind of designs is of critical importance for distributed antenna systems （DASs） with heterogeneous remote radio heads （RRHs） such as cloud radio access networks （C-RANs）. In our work, we try to solve the optimization problem in an analytical way instead of using some famous software packages e.g., CVX or SeDuMi. In our work, to strike tradeoffs between performance and complexity, both iterative and non-iterative solutions are proposed. Interestingly the non-iterative solution can be interpreted as a matrix-version water-filling solution extended from the well-known and extensively studied vector version. Finally, simulation results demonstrate the accuracy of our theoretical results.In this paper, we investigate the multiple-input multiple-output （MIMO） transceiver design under an interesting power model named mixed power constraints. In the considered power model, several antenna subsets are constrained by sum power constraints while the other antennas are subject to per-antenna power constraints. This kind of transceiver designs includes both the transceiver designs under sum power constraint and per-antenna power constraint as its special cases. This kind of designs is of critical importance for distributed antenna systems （DASs） with heterogeneous remote radio heads （RRHs） such as cloud radio access networks （C-RANs）. In our work, we try to solve the optimization problem in an analytical way instead of using some famous software packages e.g., CVX or SeDuMi. In our work, to strike tradeoffs between performance and complexity, both iterative and non-iterative solutions are proposed. Interestingly the non-iterative solution can be interpreted as a matrix-version water-filling solution extended from the well-known and extensively studied vector version. Finally, simulation results demonstrate the accuracy of our theoretical results.

关 键 词：convex optimization MIMO matrix-version water-filling transceiver designs mix power constraints. 

分 类 号：TN859[电子电信—信息与通信工程] TN919.3