Stability Results for Random Sampling of Sparse Trigonometric Polynomials
From MaRDI portal
Publication:3604925
DOI10.1109/TIT.2008.2006382zbMath1247.94010arXivmath/0609630MaRDI QIDQ3604925
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0609630
Trigonometric approximation (42A10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Numerical methods for discrete and fast Fourier transforms (65T50) Sampling theory in information and communication theory (94A20)
Related Items
Sparse high-dimensional FFT based on rank-1 lattice sampling, Sparse approximate solution of fitting surface to scattered points by MLASSO model, The restricted isometry property for time-frequency structured random matrices, Random Sampling and Reconstruction of Sparse Time- and Band-Limited Signals, Embracing off-the-grid samples, Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations, Restricted isometries for partial random circulant matrices, Compressive Sensing, The road to deterministic matrices with the restricted isometry property, Spark-level sparsity and the \(\ell_1\) tail minimization, Sparse approximation of fitting surface by elastic net, Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO, Sparse approximate solution of partial differential equations, Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms, Probabilistic spherical Marcinkiewicz-Zygmund inequalities, Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
Uses Software
