A Constrained Random Demodulator for Sub-Nyquist Sampling

Robert Calderbank, Waheed U. Bajwa, Andrew Harms

Code and Data Abstract

The code can be used to reproduce the simulations presented in the associated paper or to run similar simulations. The code uses SpaRSA to calculate the Lasso solution and YALL1 to calculate the basis pursuit solution to finding spectral coefficients.

Paper Abstract

This paper presents a significant modification to the Random Demodulator (RD) of Tropp et al. for sub-Nyquist sampling of frequency-sparse signals. The modification, termed constrained random demodulator, involves replacing the random waveform, essential to the operation of the RD, with a constrained random waveform that has limits on its switching rate because fast switching waveforms may be hard to generate cleanly. The result is a relaxation on the hardware requirements with a slight, but manageable, decrease in the recovery guarantees. The paper also establishes the importance of properly choosing the statistics of the constrained random waveform. If the power spectrum of the random waveform matches the distribution on the tones of the input signal (i.e., the distribution is proportional to the power spectrum), then recovery of the input signal tones is improved. The theoretical guarantees provided in the paper are validated through extensive numerical simulations and phase transition plots.

Robert Calderbank, Waheed U. Bajwa, Andrew Harms, et al. "A Constrained Random Demodulator for Sub-Nyquist Sampling." IEEE Transactions on Signal Processing (2013).     Retrieved 10/23/2018 from researchcompendia.org/compendia/2013.286/

Page Owner

sheila@codersquid.com

created 11/12/2013

modified 01/16/2014

blog comments powered by Disqus

rmc id