Open Collections

Blind multiband sampling algorithms

Banff International Research Station for Mathematical Innovation and Discovery

For fixed A, N, L > 0, consider the set M of all L2 functions (signals) on the real line whose spectrum (i.e. support of the Fourier transform) is contained in the interval [-A, A] and simultanuosly in a sum of N intervals, each of length at most L (which can be positioned anywhere inside the interval [-A, A]). Blind multiband sampling deals with the problem of existence of a (stable) sampling set for M, i.e. a discrete subset of the real line, such that the signal from M is uniquely determined by its values on this set. During the talk I would present effective (yet, in general, not providing perfect reconstruction) algorithms for blind multiband sampling proposed by Y. Eldar and C. Mishali, which are based on the idea of compressed sensing.

Mathematics; Dynamical systems and ergodic theory; Global analysis, analysis on manifolds; Dynamical systems

video/mp4

Author affiliation: University of Warsaw

2018-01-21

Attribution-NonCommercial-NoDerivatives 4.0 International

http://hdl.handle.net/2429/64433

Unreviewed

http://creativecommons.org/licenses/by-nc-nd/4.0/