Name
Abstract | ||
|---|---|---|
As technology grows, higher frequency signals are required to be processed in various applications. In order to digitize such signals, conventional analog to digital convertors are facing implementation challenges due to the higher sampling rates. Hence, lower sampling rates (i.e., sub-Nyquist) are considered to be cost efficient. A well-known approach is to consider sparse signals that have fewer nonzero frequency components compared to the highest frequency component. For the prior knowledge of the sparse positions, well-established methods already exist. However, there are applications where such information is not available. For such cases, a number of approaches have recently been proposed. In this paper, we propose several random sampling recovery algorithms which do not require any anti-aliasing filter. Moreover, we offer certain conditions under which these recovery techniques converge to the signal. Finally, we also confirm the performance of the above methods through extensive simulations. |
Year | Venue | Field |
|---|---|---|
2014 | CoRR | Mathematical optimization,Multi band,Computer science,Algorithm,Theoretical computer science,Sampling (statistics),Nyquist–Shannon sampling theorem,Cost efficiency |
DocType | Volume | Citations |
Journal | abs/1411.6587 | 0 |
PageRank | References | Authors |
0.34 | 12 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Amir Zandieh | 1 | 8 | 3.56 |
| Alireza Zareian | 2 | 0 | 0.34 |
| Masoumeh Azghani | 3 | 18 | 6.17 |
| Farokh Marvasti | 4 | 573 | 72.71 |