2000 character limit reached
Shannon's sampling theorem in a distributional setting (1208.6493v2)
Published 31 Aug 2012 in math.FA, cs.IT, and math.IT
Abstract: The classical Shannon sampling theorem states that a signal f with Fourier transform F in L2(R) having its support contained in (-\pi,\pi) can be recovered from the sequence of samples (f(n)){n in Z} via f(t)=\sum{n in Z} f(n) (sin(\pi (t -n)))/(\pi (t-n)) (t in R). In this article we prove a generalization of this result under the assumption that F is a compactly supported distribution with its support contained in (-\pi,\pi).
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.