检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王超[1,2] 邓科[1] 庄丽莉[2] 喻晓玲[2]
机构地区:[1]西安交通大学电子与信息工程学院,西安710049 [2]中国太原卫星发射中心,忻州036300
出 处:《西安交通大学学报》2013年第12期84-89,共6页Journal of Xi'an Jiaotong University
基 金:国家自然科学基(60971113,61172093,61071216,61071125);国家科技重大专项资助项目(2010ZX03003-002)
摘 要:针对放大转发协作认知网络中信道信息快变导致主用户接收到的干扰功率不受控制的情况,提出了一种鲁棒的分布式波束形成(RDRB)算法。当次用户协作节点上的信道信息有估计误差时,RDRB算法通过设计次用户协作中继节点上的波束形成系数最大化目的节点的信噪比,同时保证了对主用户干扰功率和各个中继节点最大发射功率均不超过门限。RDRB算法通过二分法可以搜索到非凸的原问题的次优解,极大地降低了运算量,还可以在信道快变时控制主用户接收到的干扰功率。仿真结果表明,RDRB算法能严格地将主用户接收到的干扰功率控制在既定的干扰门限之下,低于非鲁棒算法2dB以上,从而有效地保护了主用户能正常通信不受干扰。A robust distributed relay beamforming (RDRB) algorithm is proposed to address the uncontrollable problem of the received interference power at the primary user (PU) caused by the fast varying channel state information (CSI) in amplify and forward cooperative cognitive radio networks. When there exists estimation error in CSI, the RDRB method maximizes the signal to noise ratio (SNR) of the secondary receive node under constraints of the maximum interference to PU and the maximum transmit power to each node by designing the distributed relay beamforming weights of cooperative secondary nodes. The RDRB algorithm finds the suboptimal solution of the non-convex original problem using the bisection search. This strategy reduces calculation cost significantly and controls the received interference power at the PU when channels are fast varying. Simulation results show that the RDRB algorithm controls the interference power at the PU under a given level strictly, at least 2 dB less than those of non- robust algorithms, and the communication of the PU is effectively protected.
分 类 号:TN929.5[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222