Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 28 tok/s
Gemini 2.5 Pro 40 tok/s Pro
GPT-5 Medium 16 tok/s Pro
GPT-5 High 13 tok/s Pro
GPT-4o 103 tok/s Pro
Kimi K2 197 tok/s Pro
GPT OSS 120B 471 tok/s Pro
Claude Sonnet 4 38 tok/s Pro
2000 character limit reached

Achieving Autonomous Compressive Spectrum Sensing for Cognitive Radios (1502.06029v1)

Published 20 Feb 2015 in cs.IT and math.IT

Abstract: Compressive sensing (CS) technologies present many advantages over other existing approaches for implementing wideband spectrum sensing in cognitive radios (CRs), such as reduced sampling rate and computational complexity. However, there are two significant challenges: 1) choosing an appropriate number of sub-Nyquist measurements, and 2) deciding when to terminate the greedy recovery algorithm that reconstructs wideband spectrum. In this paper, an autonomous compressive spectrum sensing (ACSS) framework is presented that enables a CR to automatically choose the number of measurements while guaranteeing the wideband spectrum recovery with a small predictable recovery error. This is realized by the proposed measurement infrastructure and the validation technique. The proposed ACSS can find a good spectral estimate with high confidence by using only a small testing subset in both noiseless and noisy environments. Furthermore, a sparsity-aware spectral recovery algorithm is proposed to recover the wideband spectrum without requiring knowledge of the instantaneous spectral sparsity level. Such an algorithm bridges the gap between CS theory and practical spectrum sensing. Simulation results show that ACSS can not only recover the spectrum using an appropriate number of measurements, but can also considerably improve the spectral recovery performance compared with existing CS approaches. The proposed recovery algorithm can autonomously adopt a proper number of iterations, therefore solving the problems of under-fitting or over-fitting which commonly exist in most greedy recovery algorithms.

Citations (40)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.