Learning decision trees using the Fourier spectrum
SIAM Journal on Computing
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
Discrete-time signal processing (2nd ed.)
Discrete-time signal processing (2nd ed.)
Atomic Decomposition by Basis Pursuit
SIAM Journal on Scientific Computing
Near-optimal sparse fourier representations via sampling
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Spectrum-blind minimum-rate sampling and reconstruction of multiband signals
ICASSP '96 Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03
Scientific computing Kernels on the cell processor
International Journal of Parallel Programming
Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit
Foundations of Computational Mathematics
Blind multiband signal reconstruction: compressed sensing for analog signals
IEEE Transactions on Signal Processing
Compressed sensing of analog signals in shift-invariant spaces
IEEE Transactions on Signal Processing
High-resolution radar via compressed sensing
IEEE Transactions on Signal Processing
Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
SIAM Journal on Optimization
Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
SIAM Journal on Imaging Sciences
Compressive Sensing by Random Convolution
SIAM Journal on Imaging Sciences
Sampling Moments and Reconstructing Signals of Finite Rate of Innovation: Shannon Meets Strang–Fix
IEEE Transactions on Signal Processing
Sampling signals with finite rate of innovation
IEEE Transactions on Signal Processing
Data compression and harmonic analysis
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
IEEE Transactions on Information Theory
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
IEEE Transactions on Information Theory
Analog-to-digital converter survey and analysis
IEEE Journal on Selected Areas in Communications
A uniform uncertainty principle for Gaussian circulant matrices
DSP'09 Proceedings of the 16th international conference on Digital Signal Processing
Exact signal recovery from sparsely corrupted measurements through the pursuit of justice
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Regularized sampling of multiband signals
IEEE Transactions on Signal Processing
Intercept of frequency agility signal using coding Nyquist folding receiver
WSEAS Transactions on Signal Processing
Decentralized cooperative compressed spectrum sensing for block sparse signals
Proceedings of the 4th International Conference on Cognitive Radio and Advanced Spectrum Management
SloMo: downclockingWiFi communication
nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation
Deterministic under-sampling with error correction in OFDM systems
Proceedings of the 17th Panhellenic Conference on Informatics
Hi-index | 754.84 |
Wideband analog signals push contemporary analogto-digital conversion (ADC) systems to their performance limits. In many applications, however, sampling at the Nyquist rate is inefficient because the signals of interest contain only a small number of significant frequencies relative to the band limit, although the locations of the frequencies may not be known a priori. For this type of sparse signal, other sampling strategies are possible. This paper describes a new type of data acquisition system, called a random demodulator, that is constructed from robust, readily available components. Let K denote the total number of frequencies in the signal, and let W denote its band limit in hertz. Simulations suggest that the random demodulator requires just O(Klog(W/K) samples per second to stably reconstruct the signal. This sampling rate is exponentially lower than the Nyquist rate of W hertz. In contrast to Nyquist sampling, one must use nonlinear methods, such as convex programming, to recover the signal from the samples taken by the random demodulator. This paper provides a detailed theoretical analysis of the system's performance that supports the empirical observations.