Recognition: unknown
Discrete uncertainty principles and sparse signal processing
classification
💻 cs.IT
math.FAmath.IT
keywords
principlessparsesparsitydiscretefunctionsnumericalprocessingsignal
read the original abstract
We develop new discrete uncertainty principles in terms of numerical sparsity, which is a continuous proxy for the 0-norm. Unlike traditional sparsity, the continuity of numerical sparsity naturally accommodates functions which are nearly sparse. After studying these principles and the functions that achieve exact or near equality in them, we identify certain consequences in a number of sparse signal processing applications.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Large values in time series and additive combinatorics
When the Fourier ratio of a time series is small, its largest values can be additively generated by a small set using only coefficients from {-1,0,1}.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.