首页 | 本学科首页   官方微博 | 高级检索  
     检索      

协作机会波束成形门限算法及性能界分析
引用本文:王磊,张超,卫国.协作机会波束成形门限算法及性能界分析[J].中国科学技术大学学报,2011,41(8).
作者姓名:王磊  张超  卫国
作者单位:中国科学技术大学电子工程与信息科学系,安徽合肥,230027
基金项目:国家自然科学基金(60802008); 国家重点基础研究发展(973)计划(2007CB310602)资助
摘    要:节点参加协作波束成形会增加复杂度和能耗,因而中继处理方法和协作区域的选择对整个协作网络非常重要.协作机会波束成形算法,仅选择部分节点发送信号使得目的节点接收信号近似相干叠加,降低了实现复杂度,但最优节点选择矢量的计算复杂度随中继节点数呈指数增加.为了降低计算复杂度,提出了协作机会波束成形的门限算法,并讨论了最优协作区域的大小.理论分析表明,目的节点接收信噪比随节点密度线性增加,且最优协作区域仅覆盖源节点周边有限区域.

关 键 词:协作机会波束成形  协作网络  门限选择

Design of selective opportunistic collaborative beamforming and performance analysis
WANG Lei,ZHANG Chao,WEI Guo.Design of selective opportunistic collaborative beamforming and performance analysis[J].Journal of University of Science and Technology of China,2011,41(8).
Authors:WANG Lei  ZHANG Chao  WEI Guo
Institution:WANG Lei,ZHANG Chao,WEI Guo(Department of Electronic Engineering and Information Science,University of Science and Technology of China,Hefei 230027,China)
Abstract:Due to the complexity and energy needed by relay nodes in collaborative beamforming,it is very important to process signals at relay nodes and select the cooperative region.Opportunistic collaborative beamforming only selects a subset of relay nodes to transmit signals and allows for low-complexity relay node hardware.However,the computation of the optimal selection vector scales exponentially with the number of available relay nodes.Thus,a low-complexity sub-optimal relay selection rule is proposed based o...
Keywords:opportunistic collaborative beamforming  collaborative network  selection thresholds  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号