Conjugate gradient projection approach for MIMO Gaussian broadcast channels

被引:6
作者
Liu, Jia [1 ]
Hou, Y. Thomas [1 ]
Kompella, Sastry [2 ]
Sherali, Hanif D. [3 ]
机构
[1] Virginia Tech, Dept Elect & Comp Engn, Blacksburg, VA 24061 USA
[2] US Naval Res Lab, Div Informat Technol, Washington, DC 20375 USA
[3] Virginia Tech, Dept Ind & Syst Engn, Blacksburg, VA 24061 USA
来源
2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7 | 2007年
基金
美国国家科学基金会;
关键词
D O I
10.1109/ISIT.2007.4557319
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Researchers have recently shown that the dirtypaper coding (DPC) is the optimal transmission strategy for multiple-input multiple-output Gaussian broadcast channels (MIMO BC). Moreover, by the channel duality, the nonconvex MIMO BC sum rate problem can be transformed to the convex dual MIMO multiple-access channel (MIMO MAC) problem with a sum power constraint. In this paper, we design an efficient algorithm based on conjugate gradient projection (CGP) to solve the MIMO BC maximum sum rate problem. Our proposed CGP algorithm solves the dual sum power MAC problem by utilizing the powerful concept of Hessian conjugate. We also develop a rigorous algorithm to solve the projection problem. We show that CGP enjoys provable convergence, scalability, and efficiency for large MIMO BC systems.
引用
收藏
页码:781 / +
页数:2
相关论文
共 15 条