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

基于压缩感知和最小二乘的分布式协作频谱感知
引用本文:杨亚旗,姚彦鑫.基于压缩感知和最小二乘的分布式协作频谱感知[J].国际商务研究,2017,57(7).
作者姓名:杨亚旗  姚彦鑫
作者单位:北京信息科技大学 信息与通信工程学院,北京 100101,北京信息科技大学 信息与通信工程学院,北京 100101
基金项目:国家自然科学基金资助项目(61302073);北京市自然科学基金资助项目(4172021,Z160002);北京市教育委员会科技发展计划面上项目(KM201711232010)
摘    要:针对认知无线电(CR)集中式频谱感知算法对融合中心要求高,而且对节点失效的容忍性也不高等缺点,提出了一种基于压缩感知的分布式多节点协作算法。认知无线电网络中每个CR节点在接收信号频谱后,首先根据压缩采样理论在本地获取压缩采样测量值,然后利用l1范数约束的最小二乘算法在本节点估计频谱,把在此节点估计的频谱传给下一相邻节点,以此进行迭代优化直到算法收敛。理论分析和仿真结果表明,所提算法不仅计算复杂度低,收敛速度快,而且精确重构性能好,可靠性较高。

关 键 词:认知无线电  压缩感知  协作频谱感知  最小二乘

Distributed cooperative spectrum sensing based on compressed sensing and least squares
YANG Yaqi and YAO Yanxin.Distributed cooperative spectrum sensing based on compressed sensing and least squares[J].International Business Research,2017,57(7).
Authors:YANG Yaqi and YAO Yanxin
Abstract:For the shortcomings that centralized cognitive radio(CR) spectrum estimation sets strict requirement for fusion centers and has poor tolerance for node failure,this paper proposes a distributed multi-node cooperative algorithm based on compressed sensing. Each node of CR networks obtains the local compressed sampling according to compressed sampling theory firstly,then recovers the spectrum by exploiting l1 norm constrained algorithm. Finally,the spectrum estimated at the node is delivered to the next neighboring node until the algorithm converges. The theoretical analysis and simulation results show that this algorithm has not only low computational complexity and fast convergence speed,but also high accuracy and high reliability.
Keywords:
点击此处可从《国际商务研究》浏览原始摘要信息
点击此处可从《国际商务研究》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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