一种快速低复杂度宽带频谱压缩感知算法  

A Fast and Low Complexity Algorithm of Wideband Spectrum Compressive Sensing

作　　者：任建新[1] 朱翠涛[1] 李中捷[1] 汪汉新[1] 

机构地区：[1]中南民族大学电子信息工程学院,武汉430074

出　　处：《计算机工程》2015年第6期61-65,共5页Computer Engineering

基　　金：国家自然科学基金资助项目(61103248;61379028);湖北省自然科学基金资助项目(2013CFB448)

摘　　要：为提高双选择性衰落环境下的宽带频谱感知性能,提出一种快速低复杂度线性Bregman算法。利用该算法可实现基于循环谱估计的宽带压缩频谱检测。针对一般线性Bregman算法存在冗余迭代计算的缺陷,通过增加辅助变量,估计线性Bregman算法中余量保持不变过程的迭代次数,更新辅助变量值,跳出冗余迭代的过程,从而加速算法的收敛速度,同时降低算法复杂度。实验结果表明,与一般线性Bregman算法相比,该算法在双选衰落环境下的压缩采样重构效果、检测概率和收敛速度性能均有所提高。This paper presents a kind of fast and low complexity linear Bregman algorithm and lists the specific implementation steps of the algorithm in order to improve the performance of the wideband spectrum sensing in doubly selective fading environment, which is used for the process of testing wideband compressed spectrum based on cyclic spectrum estimation. This algorithm aims at the flaw of redundant iterative computation in general linear Bregman algorithm. It can accelerate the convergence speed by adding auxiliary variables to estimate iterations of residual staying almost constant in linear Bregman algorithm and updating auxiliary variables to step out the process of redundant iteration. At the same time,it reduces the complexity of the algorithm. As a result,compared with general linear Bregman algorithm,the effect of compressive sampling reconstruction, the detection probability and convergence speed of the modified algorithm are improved in doubly selective fading environment.

关 键 词：认知无线电 宽带频谱感知 压缩采样 线性Bregman算法 双选择性衰落信道 恒虚警率 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]