Blind Orthogonal Least Squares Based Compressive Spectrum Sensing

Liyang Lu, Wenbo Xu, Yue Wang, Zhi Tian

TL;DR

Researchers have developed a "blind" version of the Orthogonal Least Squares (OLS) algorithm for wideband spectrum sensing in cognitive radios. Unlike traditional methods that require prior knowledge of signal sparsity or noise levels, this new algorithm (B-OLS-CSS) uses a novel stopping rule based on the mathematical properties of the measurement matrix itself, outperforming existing blind techniques in noisy and complex environments.

What Problem Does This Paper Address?

In the world of vehicular communications and the Internet of Things, radio frequency spectrum is a scarce resource. Cognitive Radio (CR) is a solution that allows "secondary users" to borrow unused spectrum from "primary users." To do this efficiently, we use Compressive Spectrum Sensing (CSS), which allows us to scan wide frequency bands using much lower sampling rates than traditionally required (sub-Nyquist sampling).

The catch? Most CSS algorithms are like a hiker who needs to know exactly how many miles the trail is (signal sparsity, $K$) or exactly how much fog is in the air (noise variance, $\sigma^2$) to know when to stop. In real-world vehicular networks, these variables change constantly and are rarely known beforehand. Existing "blind" algorithms, like Blind Orthogonal Matching Pursuit (B-OMP), often fail when the measurement matrices are "coherent"—meaning the different sensing perspectives are too similar to distinguish clearly.

Methods

The authors introduce B-OLS-CSS (Blind Orthogonal Least Squares based Compressive Spectrum Sensing). The core innovation is a blind stopping rule that doesn't rely on signal or noise statistics.

Key technical components include:

  • Tighter Mapping Factor Bounds: The authors derived new, mathematically tighter bounds for the "mapping factor" in OLS. This factor essentially describes how well the algorithm can distinguish between a true signal component and noise.
  • Probabilistic Stopping Rule: They formulated a threshold ($Q$) based on a target recovery probability ($P_{min}$) and the Mutual Incoherence Property (MIP) of the measurement matrix. Since the measurement matrix is something the system designer chooses, its properties are known, making the algorithm truly "blind" to the incoming signal's specifics.
  • Iterative Refinement: The algorithm selects atoms (potential signal components) one by one. The new stopping rule ensures it keeps going until it is statistically confident that all signal components have been captured, even in the presence of noise.

Datasets

The study relies on extensive numerical simulations rather than a static physical dataset. The evaluation environment includes:

  • Measurement Matrices: Standard Gaussian random matrices and a more challenging "hybrid" measurement matrix designed to test performance under unsatisfactory (high) coherence conditions.
  • Signal Model: Sparse spectrum signals where the locations of active sub-bands are random, and their amplitudes follow a Gaussian distribution $\mathcal{N}(1, 0.01)$.
  • Noise: Additive White Gaussian Noise (AWGN) across various Signal-to-Noise Ratio (SNR) levels.
  • Benchmarks: The algorithm was compared against OMP, CoSaMP, MOLS, and the existing state-of-the-art Blind OMP.

Key Insights and Ideas

  • OLS vs. OMP: While OMP is popular for its simplicity, OLS is more robust. OLS looks at the "contribution" of an atom to the residual more holistically, which helps it perform better when the sensing matrix isn't perfect.
  • Matrix Properties over Signal Priors: The "Aha!" moment here is realizing that we can trade unknown signal information for known matrix information. By deeply analyzing the probability of recovery based on the matrix's coherence ($\mu$), we can set a reliable "exit condition" for the algorithm.
  • SNR Efficiency: Theoretical analysis proved that B-OLS-CSS requires a lower SNR to achieve the same accuracy as B-OMP. In other words, it can "see" signals in much noisier environments.

Key Results

  • Accuracy: B-OLS-CSS achieves nearly the same performance as "informed" OLS (which knows the exact sparsity and noise levels).
  • Robustness: In tests using the "hybrid" matrix (high coherence), standard OMP-based methods failed to provide reliable recovery. B-OLS-CSS, however, maintained high recovery probability even as the number of signal components ($K$) increased.
  • Sensitivity: The algorithm proved to be insensitive to the specific choice of its internal parameter $\omega$ over a wide range, making it practical for real-world deployment where fine-tuning is difficult.

Limitations and Future Work

  • Computational Complexity: OLS is generally more computationally demanding than OMP because it involves more complex projections in each iteration. While the authors mention "fast implementation," the trade-off between speed and accuracy in hardware remains a factor.
  • Parameter Selection: Although "blind" to the signal, the user still needs to define a target recovery probability ($P_{min}$). While $0.95$ or $0.99$ are standard, the optimal choice might vary by application.
  • Real-world Validation: The results are currently based on Monte Carlo simulations. Future work would benefit from testing the algorithm on real-world radio hardware (like USRPs) in dynamic vehicular environments to account for non-Gaussian noise or fading effects.

Summary updated

Abstract

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.
BibTeX
@article{lu2023blind,
  author = {Liyang Lu and Wenbo Xu and Yue Wang and Zhi Tian},
  title = {{Blind Orthogonal Least Squares Based Compressive Spectrum Sensing}},
  journal = {IEEE Transactions on Vehicular Technology},
  year = {2023},
  doi = {10.1109/tvt.2023.3290093},
}

Loading related content...

Figure