认知MIMO MAC最优迭代注水算法  

Optimum iterative water-filling algorithm for cognitive MIMO MAC

作　　者：魏飞[1] 杨震[1] 

机构地区：[1]南京邮电大学宽带无线通信与传感网技术教育部重点实验室,江苏南京210003

出　　处：《通信学报》2011年第11期133-139,共7页Journal on Communications

基　　金：国家重点基础研究发展计划("973"计划)基金资助项目(2011CB302903);国家自然科学基金资助项目(60971129;61071092);国家自然科学青年基金资助项目(61001077)~~

摘　　要：研究发送功率以及干扰温度约束下的认知多入多出多址接入信道(MIMO MAC)的速率和最大化问题。通过部分对偶分解技术松弛干扰温度约束,原始问题被分解为较易处理的子问题,并提出一种迭代算法,通过交替进行对偶变量更新与迭代注水运算求解使得速率和最大的最优发送协方差矩阵。最后通过仿真表明算法的有效性。The sum-rate maximization problem of the cognitive multiple-input multiple-output multiple access channel（MIMO MAC） under transmit power and interference temperature constraints was addressed.By exploiting the partial dual decomposition technique to relax the interference temperature constraint,the original problem was decomposed into more tractable subproblems.An iterative algorithm,in which the dual variable update and the iterative water-filling com-putation were performed alternately,was proposed to obtain the optimum transmit covariance matrices that achieved the maximum sum-rate.Finally,simulation results have been presented to verify the effectiveness of the algorithm.

关 键 词：认知无线电 多址接入信道 迭代注水 干扰温度 部分对偶分解 

分 类 号：TN92[电子电信—通信与信息系统]