检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]解放军信息工程大学导航与空天目标工程学院,河南郑州450002
出 处:《通信学报》2015年第8期153-160,共8页Journal on Communications
基 金:国家科技重大专项基金资助项目(2011ZX03003-003-02);国家高技术研究发展计划("863"计划)基金资助项目(2012AA01A502;2012AA01A505)~~
摘 要:在K?1用户认知MIMO干扰网络中,传统算法区分对待主/次用户干扰,将其对齐压缩到不同的干扰空间上,导致空间自由度的浪费。从复用干扰空间的角度出发,推导了新的自由度上界及其必要条件。为了验证其合理性和正确性,设计了联合干扰对齐指标,并结合范数理论和Rayleigh-Ritz定理提出一种协作联合干扰对齐算法,并对算法的有效性进行了分析。理论分析和仿真结果表明,新的自由度上界突破了已有文献所给上界,且可通过所提算法达到。In (K+l)-user cognitive MIMO interference network, conventional algorithms distinguish the interference of primary users and secondary users by aligning them to the different interference space, separately. Therefore, it leads to the loss of spatial degrees of freedom (DoF). From the perspective of multiplexing the interference space, a new upper bound of DoF and its necessary condition was deduced. Furthermore, to verify the rationality and validity of the new up- per bound, a cooperative joint interference alignment algorithm, in which a joint interference alignment indicator was de- signed and proposed based on norm theory and Rayleigh-Ritz theorem. The effectiveness of the algorithm was analyzed. Theoretical analysis and simulation results show that the new upper bound of DoF breaks upper bound given in the exist- ing papers, and it can be achieved by the proposed algorithm.
分 类 号:TN92[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.42