DocumentCode
687633
Title
Exploiting hidden block sparsity: Interdependent matching pursuit for cyclic feature detection
Author
Yu Wang ; Wei Chen ; Wassell, Ian
Author_Institution
Comput. Lab., Univ. of Cambridge, Cambridge, UK
fYear
2013
fDate
9-13 Dec. 2013
Firstpage
1119
Lastpage
1124
Abstract
In this paper, we propose a novel Compressive Sensing (CS)-enhanced spectrum sensing approach for Cognitive Radio (CR) systems. The new framework enables cyclic feature detection with a significantly reduced sampling rate. We associate the new framework with a novel model-based greedy reconstruction algorithm: interdependent matching pursuit (IMP). For IMP, the hidden block sparsity owing to the symmetry present in the cyclic spectrum is exploited which effectively reduces the degree of freedom of problem. Compared with conventional CS with independent support selection, a remarkable spectrum reconstruction improvement is achieved by IMP.
Keywords
cognitive radio; compressed sensing; feature extraction; greedy algorithms; iterative methods; radio spectrum management; signal detection; time-frequency analysis; CR systems; CS-enhanced spectrum sensing; IMP; cognitive radio systems; compressive sensing; cyclic feature detection; cyclic spectrum; hidden block sparsity; independent support selection; interdependent matching pursuit; model-based greedy reconstruction algorithm; spectrum reconstruction; Cognitive radio; Correlation; Indexes; Matching pursuit algorithms; Sensors; Sparse matrices; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Communications Conference (GLOBECOM), 2013 IEEE
Conference_Location
Atlanta, GA
Type
conf
DOI
10.1109/GLOCOM.2013.6831224
Filename
6831224
Link To Document