检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:MAO JunLing GAO JinChun LIU YuanAn XIE Gang ZHANG Jian
机构地区:[1]School of Electronic Engineering,Beijing University of Posts and Telecommunications,Beijing 100876,China [2]School of Information and Communication Engineering,Beijing University of Posts and Telecommunications,Beijing 100876,China [3]Key Lab of Universal Wireless Communications,Ministry of Education,Beijing University of Posts and Telecommunications,Beijing 100876,China
出 处:《Science China(Information Sciences)》2012年第4期815-826,共12页中国科学(信息科学)(英文版)
基 金:supported in part by Sino-Swedish IMT-Advanced Cooperation Project (Grant No. 2008DFA11780);Canada-China Scientific and Technological Cooperation (Grant No. 2010DFA11320);National Natural Science Foundation of China (Grant Nos. 60802033,60873190);Fundamental Research Funds for the Central Universities(Grant Nos. 2009RC0308,G470209);Project ZRJJ-2010-1 by Key Lab of Universal Wireless Communications,Ministry of Education
摘 要:Robust multiuser multiple-input-multiple-output (MIMO) scheduling algorithms are proposed in this paper. With imperfect channel state information (CSI), traditional scheduling algorithms for the multiuser MIMO system based on the zero forcing precoding scheme will lose some performance due to the multi-user interference (MUI). In order to improve the system average throughput, we study the robust multiuser MIMO scheduling problem with imperfect CSI. From the average capacity formula, we derive a robust factor which can transform the robust multiuser MIMO scheduling problem into the traditional one, thus most existing non- robust scheduling algorithms can be robust if this factor is adopted. Simulation results show that compared with the traditional algorithms, the proposed robust algorithms can improve the system average throughput significantly under the CSI error environment.Robust multiuser multiple-input-multiple-output (MIMO) scheduling algorithms are proposed in this paper. With imperfect channel state information (CSI), traditional scheduling algorithms for the multiuser MIMO system based on the zero forcing precoding scheme will lose some performance due to the multi-user interference (MUI). In order to improve the system average throughput, we study the robust multiuser MIMO scheduling problem with imperfect CSI. From the average capacity formula, we derive a robust factor which can transform the robust multiuser MIMO scheduling problem into the traditional one, thus most existing non- robust scheduling algorithms can be robust if this factor is adopted. Simulation results show that compared with the traditional algorithms, the proposed robust algorithms can improve the system average throughput significantly under the CSI error environment.
关 键 词:multiuser MIMO (MU-MIMO) SCHEDULING ROBUST imperfect CSI
分 类 号:TN919.3[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15