arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2204.05086eess.SP
收藏

基于盲正交最小二乘的压缩频谱感知

Blind Orthogonal Least Squares based Compressive Spectrum Sensing

Liyang Lu, Wenbo Xu, Yue Wang, Zhi Tian

AI总结:

针对压缩频谱感知依赖稀疏度或噪声先验的问题,提出B-OLS-CSS算法,利用概率恢复条件设计盲停止规则,并在理论与仿真中证明其信噪比重构要求优于OMP基准。

摘要:

作为认知无线电(CR)的一项使能技术,基于压缩感知(CS)的压缩频谱感知(CSS)能够利用亚奈奎斯特采样率,从宽频带中高效且准确地检测频谱机会。然而,现有大多数CSS的感知性能过度依赖频谱稀疏度或噪声方差等先验信息。因此,实际CSS中的一个关键挑战是:即使在缺乏此类信息的情况下,如何有效工作。本文提出一种基于盲正交最小二乘的CSS算法(B-OLS-CSS),该算法无需先验信息即可正常运行。具体而言,我们基于OLS算法的概率恢复条件,为其开发了一种新颖的盲停止规则。这一创新规则摆脱了对频谱稀疏度或噪声信息的需求,仅要求给定测量矩阵具有计算上可行的互不相干性。理论分析表明,与使用OMP算法的基准CSS相比,所提出的B-OLS-CSS在达到一定感知精度时所需的信噪比更为宽松,大量仿真结果验证了这一点。

英文摘要:

As an enabling technique of cognitive radio (CR), compressive spectrum sensing (CSS) based on compressive sensing (CS) can detect the spectrum opportunities from wide frequency bands efficiently and accurately by using sub-Nyquist sampling rate. However, the sensing performance of most existing CSS excessively relies on the prior information such as spectrum sparsity or noise variance. Thus, a key challenge in practical CSS is how to work effectively even in the absence of such information. In this paper, we propose a blind orthogonal least squares based CSS algorithm (B-OLS-CSS), which functions properly without the requirement of prior information. Specifically, we develop a novel blind stopping rule for the OLS algorithm based on its probabilistic recovery condition. This innovative rule gets rid of the need of the spectrum sparsity or noise information, but only requires the computational-feasible mutual incoherence property of the given measurement matrix. Our theoretical analysis indicates that the signal-to-noise ratio required by the proposed B-OLS-CSS for achieving a certain sensing accuracy is relaxed than that by the benchmark CSS using the OMP algorithm, which is verified by extensive simulation results.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑