Uncommon

Nyquist–Shannon sampling theorem

Sufficiency theorem for reconstructing signals from samples

Nyquist–Shannon sampling theorem

Uncommon card · No. 75266

The Nyquist–Shannon sampling theorem, or the sampling theorem, is a theorem in the field of signal processing which serves as a fundamental bridge between continuous-time signals and discrete-time signals. In the case of uniformly spaced (periodic) sampling, it establishes a sufficient condition on the sample rate that permits a discrete sequence of samples to capture all the information from a continuous-time signal of finite bandwidth, such that the original signal can be reconstructed exactly from those samples. Strictly speaking, the theorem only applies to a class of mathematical functions having a Fourier transform that is zero outside of a finite region of frequencies. Intuitively we expect that when one reduces a continuous function to a discrete sequence and interpolates back to a continuous function, the fidelity of the result depends on the density (or sample rate) of the original samples. The sampling theorem introduces the concept of a sample rate that is sufficient for perfect...

Read on Wikipedia · Image Original: Metacomet Vector: Editor at Large, Public domain

Open boosters, collect cards and trade them. Free to play.

Play for free
Nyquist–Shannon sampling theorem – Uncommon Wikipedia card | Wikiverse TCG