DocumentCode
2808854
Title
A new method to compute optimal periodic sampling patterns
Author
Owrang, Arash ; Viberg, Mats ; Nosratinia, Mohsen ; Rashidi, Moslem
Author_Institution
Dept. of Signals & Syst., Chalmers Univ. of Technol., Gothenburg, Sweden
fYear
2011
fDate
4-7 Jan. 2011
Firstpage
259
Lastpage
264
Abstract
It is possible to reconstruct a signal from cyclic nonuniform samples and thus take advantage of a lower sampling rate than the Nyquist rate. However, this has the potential drawback of amplifying signal perturbations, e.g. due to noise and quantization. We propose an algorithm based on sparse reconstruction techniques, which is able to find the sparsest sampling pattern that permits perfect reconstruction of the sampled signal. The result of our algorithm with a proper constraint values is a sparse subset of samples that results in an ideal condition number for its equivalent sub-DFT matrix. Besides, our algorithm has low complexity in terms of computation. The method is illustrated by simulations for a sparse multi band signal.
Keywords
discrete Fourier transforms; quantisation (signal); set theory; signal reconstruction; signal sampling; sparse matrices; Nyquist rate; cyclic nonuniform sample; equivalent subDFT matrix; optimal periodic sampling pattern; quantization; signal amplification; signal perturbation; signal reconstruction; sparse reconstruction; sparse subset; Cost function; Discrete Fourier transforms; Least squares approximation; Niobium; Sparse matrices; Basis Pursuit; Sparse approximation; condition number; greedy search; nonuniform sampling;
fLanguage
English
Publisher
ieee
Conference_Titel
Digital Signal Processing Workshop and IEEE Signal Processing Education Workshop (DSP/SPE), 2011 IEEE
Conference_Location
Sedona, AZ
Print_ISBN
978-1-61284-226-4
Type
conf
DOI
10.1109/DSP-SPE.2011.5739222
Filename
5739222
Link To Document