English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

The random sampling and reconstruction algorithm of sparse time- and band-limited signals, which stem from bandlimited functions, is studied in this paper. For time- and band-limited signals, considering the projection on a finite-dimensional solution space, the reconstruction algorithm can therefore be described by a matrix. Especially, we study the case of the finite-dimensional spaces with regard to time- and band-limited signals. First, as the cardinality of the sample valueis not less than the dimension of solution space, we prove that the coefficient matrix has full rank. Second, as sample valueis insufficient, especially spare time- and band-limited signals, based on the Restricted Isometry Property (RIP) condition and the concentration inequality of a probability distribution for random sampling, we present areconstruction from few randomly chosen samples onFinally, numerical experiments show that with high probability the time- and band-limited signals can be approximately recovered provided  τ -sparsity of non-vanishing coefficients  a k.

Random Sampling and Reconstruction of Sparse Time- and Band-Limited Signals