English
Related papers

Related papers: Shannon's sampling theorem in a distributional set…

200 papers

We develop a novel sampling theorem on the sphere and corresponding fast algorithms by associating the sphere with the torus through a periodic extension. The fundamental property of any sampling theorem is the number of samples required to…

Information Theory · Computer Science 2012-01-18 J. D. McEwen , Y. Wiaux

With the advent of massive data outputs at a regular rate, admittedly, signal processing technology plays an increasingly key role. Nowadays, signals are not merely restricted to physical sources, they have been extended to digital sources…

Information Theory · Computer Science 2015-07-28 Yi Lu

Reconstructing continuous signals from a small number of discrete samples is a fundamental problem across science and engineering. In practice, we are often interested in signals with 'simple' Fourier structure, such as bandlimited,…

Data Structures and Algorithms · Computer Science 2018-12-24 Haim Avron , Michael Kapralov , Cameron Musco , Christopher Musco , Ameya Velingker , Amir Zandieh

Let $f: {\mathbb Z}_N^d \to {\mathbb C}$ be a signal with the Fourier transform $\widehat{f}: \Bbb Z_N^d\to \Bbb C$. A classical result due to Matolcsi and Szucs (\cite{MS73}), and, independently, to Donoho and Stark (\cite{DS89}) states if…

Classical Analysis and ODEs · Mathematics 2024-12-02 G. Garza , K. Gurevich , A. Iosevich , A. Mayeli , K. Nguyen , N. Shaffer

We consider multi-variate signals spanned by the integer shifts of a set of generating functions with distinct frequency profiles and the problem of reconstructing them from samples taken on a random periodic set. We show that such a…

Functional Analysis · Mathematics 2023-10-13 Jorge Antezana , Diana Carbajal , José Luis Romero

We isolate and generalize a technique implicit in many quantum algorithms, including Shor's algorithms for factoring and discrete log. In particular, we show that the distribution sampled after a Fourier transform over ${\mathbb Z}_p$ can…

Quantum Physics · Physics 2007-05-23 Lisa Hales , Sean Hallgren

This report mainly focused on the basic concepts and the recovery methods for the random sampling. The recovery methods involve the orthogonal matching pursuit algorithm and the gradient-based total variation strategy. In particular, a fast…

Information Theory · Computer Science 2016-09-08 Xiao Z. Wang , Wei E. I. Sha

We consider the problem of spatiotemporal sampling in which an initial state $f$ of an evolution process $f_t=A_tf$ is to be recovered from a combined set of coarse samples from varying time levels $\{t_1,\dots,t_N\}$. This new way of…

Other Computer Science · Computer Science 2014-12-04 Akram Aldroubi , Jacqueline Davis , Ilya Krishtal

In a previous paper, the author constructed frames and oversampling formulas for band-limited functions, in the framework of the theory of shift-invariant spaces. In this article we study the problem of recovering missing samples. We find a…

Functional Analysis · Mathematics 2009-01-17 Vincenza Del Prete

The Special Affine Fourier Transformation(SAFT), which generalizes several well-known unitary transformations, has been demonstrated as a valuable tool in signal processing and optics. In this paper, we explore the multivariate dynamical…

Functional Analysis · Mathematics 2024-09-16 Meng Ning , Li-Ping Wu , Qing-yue Zhang , Bei Liu

In the field of signal processing, the sampling theorem plays a fundamental role for signal reconstruction as it bridges the gap between analog and digital signals. Following the celebrated Nyquist-Shannon sampling theorem, generalizing the…

Information Theory · Computer Science 2024-07-23 Zhexuan Zeng , Jun Liu , Ye Yuan

A function $f:\mathbb{Z}_n \to \mathbb{C}$ can be represented as a linear combination $f(x)=\sum_{\alpha \in \mathbb{Z}_n}\widehat{f}(\alpha) \chi_{\alpha,n}(x)$ where $\widehat{f}$ is the (discrete) Fourier transform of $f$. Clearly, the…

Classical Analysis and ODEs · Mathematics 2016-10-27 Joel Laity , Barak Shani

Sampling theory in fractional Fourier Transform (FrFT) domain has been studied extensively in the last decades. This interest stems from the ability of the FrFT to generalize the traditional Fourier Transform, broadening the traditional…

Information Theory · Computer Science 2024-04-30 Václav Pavlíček , Ayush Bhandari

In a series of recent papers (Adcock, Hansen and Poon, 2013, Appl. Comput. Harm. Anal. 45(5):3132-3167), (Adcock, Gataric and Hansen, 2014, SIAM J. Imaging Sci. 7(3):1690-1723) and (Adcock, Hansen, Kutyniok and Ma, 2015, SIAM J. Math. Anal.…

Numerical Analysis · Mathematics 2016-03-08 Milana Gataric , Clarice Poon

A new scheme to sample signals defined in the nodes of a graph is proposed. The underlying assumption is that such signals admit a sparse representation in a frequency domain related to the structure of the graph, which is captured by the…

Social and Information Networks · Computer Science 2016-04-20 Antonio G. Marques , Santiago Segarra , Geert Leus , Alejandro Ribeiro

This paper presents a tutorial for CS applications in communications networks. The Shannon's sampling theorem states that to recover a signal, the sampling rate must be as least the Nyquist rate. Compressed sensing (CS) is based on the…

Networking and Internet Architecture · Computer Science 2014-02-07 Hong Huang , Satyajayant Misra , Wei Tang , Hajar Barani , Hussein Al-Azzawi

Shannon in his 1949 paper suggested the use of derivatives to increase the W*T product of the sampled signal. Use of derivatives enables improved reconstruction particularly in the case of non-uniformly sampled signals. An FM-AM…

Information Theory · Computer Science 2009-05-05 Nirmal B. Chakrabarti

We survey a new paradigm in signal processing known as "compressive sensing". Contrary to old practices of data acquisition and reconstruction based on the Shannon-Nyquist sampling principle, the new theory shows that it is possible to…

History and Overview · Mathematics 2009-03-13 Olga Holtz

Suppose $1 < p < \infty$. Carleson's Theorem states that the Fourier series of any function in $L^p[-\pi, \pi]$ converges almost everywhere. We show that the Schnorr random points are precisely those that satisfy this theorem for every $f…

Logic · Mathematics 2016-03-16 Johanna Franklin , Timothy McNicholl , Jason Rute

This paper studies several aspects of signal reconstruction of sampled data in spaces of bandlimited functions. In the first part, signal spaces are characterized in which the classical sampling series uniformly converge, and we investigate…

Information Theory · Computer Science 2014-10-23 Holger Boche , Volker Pohl