Name
Abstract | ||
|---|---|---|
In this paper, the problem of reconstruction of Spectral Correlation Function (SCF) from sub-Nyquist samples is studied. We will first propose a novel formulation for the problem and then employ two two-dimensional greedy like sparse signal recovery algorithms, namely Compressive Sampling Matching Pursuit (CoSaMP) and Iterative Hard Thresholding (IHT), for the recovery of the sparse SCF. The achievable resolution of the proposed methods is shown to be significantly higher than the existing methods and therefore the methods can be applied to signals with fine frequency components. Comprehensive simulation results shows that the method can efficiently reconstruct the SCF of a signature-embedded OFDM signal, which has applications in cognitive radio systems. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/SPAWC.2013.6612050 | Signal Processing Advances in Wireless Communications |
Keywords | Field | DocType |
compressed sensing,greedy algorithms,iterative methods,signal reconstruction,signal resolution,signal sampling,CoSaMP,IHT,cognitive radio systems,compressive sampling matching pursuit,frequency components,high-resolution cyclic spectrum reconstruction,iterative hard thresholding,signature-embedded OFDM signal,sparse SCF recovery,spectral correlation function,subNyquist samples,two-dimensional greedy like sparse signal recovery algorithms | Matching pursuit,Mathematical optimization,Iterative method,Computer science,Electronic engineering,Greedy algorithm,Nyquist–Shannon sampling theorem,Thresholding,Orthogonal frequency-division multiplexing,Signal reconstruction,Compressed sensing | Conference |
ISSN | Citations | PageRank |
1948-3244 | 7 | 0.48 |
References | Authors | |
12 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Seyed Alireza Razavi | 1 | 42 | 7.77 |
| Mikko Valkama | 2 | 1567 | 175.51 |
| Danijela Cabric | 3 | 795 | 101.37 |