2022
DOI: 10.1007/978-981-16-8546-0_20
|View full text |Cite
|
Sign up to set email alerts
|

Compressive Spectrum Sensing for Wideband Signals Using Improved Matching Pursuit Algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

2023
2023
2025
2025

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 12 publications
0
3
0
Order By: Relevance
“…The reduced data matrix and the estimated number of active frequency bands are then used in the next stage to find out the sparse problem solution through a greedy algorithm, such as OMP (orthogonal matching pursuit) [ 22 , 23 ], or an optimization-based one, such as LASSO (least absolute shrinkage and selection operator) [ 24 , 25 ]. In [ 26 ], the authors showed that LASSO was a suitable choice for compressive spectrum sensing and recovery in wideband 5G cognitive radio networks.…”
Section: Introductionmentioning
confidence: 99%
“…The reduced data matrix and the estimated number of active frequency bands are then used in the next stage to find out the sparse problem solution through a greedy algorithm, such as OMP (orthogonal matching pursuit) [ 22 , 23 ], or an optimization-based one, such as LASSO (least absolute shrinkage and selection operator) [ 24 , 25 ]. In [ 26 ], the authors showed that LASSO was a suitable choice for compressive spectrum sensing and recovery in wideband 5G cognitive radio networks.…”
Section: Introductionmentioning
confidence: 99%
“…Unlike convex optimization, which minimizes the objective function, greedy optimization determines the location of the non-zero sampling points of the sparse channel by multiple iterations. Orthogonal matching pursuit (OMP) [27], block OMP (BOMP) [28], and compressive sampling matching pursuit (CoSaMP) [29] are the most commonly used CS algorithms. Jiang et al [30] proposed a separable CoSaMP (SCoSaMP) algorithm based on the introduction of backtracking idea.…”
Section: Introductionmentioning
confidence: 99%
“…Its channel recovery performance is significantly improved under the sparse channel model with the same partial support sets. However, the above CS algorithms [27][28][29][30][31][32] usually require a large number of iterations to reduce the approximation error, which brings high complexity. Moreover, channel estimation methods based on CS algorithms require a known number of channel common support sets to achieve optimal performance, which limits their scope of application.…”
Section: Introductionmentioning
confidence: 99%