• Study Resource
  • Explore
    • Arts & Humanities
    • Business
    • Engineering & Technology
    • Foreign Language
    • History
    • Math
    • Science
    • Social Science

    Top subcategories

    • Advanced Math
    • Algebra
    • Basic Math
    • Calculus
    • Geometry
    • Linear Algebra
    • Pre-Algebra
    • Pre-Calculus
    • Statistics And Probability
    • Trigonometry
    • other →

    Top subcategories

    • Astronomy
    • Astrophysics
    • Biology
    • Chemistry
    • Earth Science
    • Environmental Science
    • Health Science
    • Physics
    • other →

    Top subcategories

    • Anthropology
    • Law
    • Political Science
    • Psychology
    • Sociology
    • other →

    Top subcategories

    • Accounting
    • Economics
    • Finance
    • Management
    • other →

    Top subcategories

    • Aerospace Engineering
    • Bioengineering
    • Chemical Engineering
    • Civil Engineering
    • Computer Science
    • Electrical Engineering
    • Industrial Engineering
    • Mechanical Engineering
    • Web Design
    • other →

    Top subcategories

    • Architecture
    • Communications
    • English
    • Gender Studies
    • Music
    • Performing Arts
    • Philosophy
    • Religious Studies
    • Writing
    • other →

    Top subcategories

    • Ancient History
    • European History
    • US History
    • World History
    • other →

    Top subcategories

    • Croatian
    • Czech
    • Finnish
    • Greek
    • Hindi
    • Japanese
    • Korean
    • Persian
    • Swedish
    • Turkish
    • other →
 
Profile Documents Logout
Upload
Full text
Full text

Not Always Buried Deep
Not Always Buried Deep

pse14 VanLong  19108260 en
pse14 VanLong 19108260 en

An introduction to the Smarandache Square
An introduction to the Smarandache Square

arXiv:math/0510054v2 [math.HO] 17 Aug 2006
arXiv:math/0510054v2 [math.HO] 17 Aug 2006

Introduction to analytic number theory
Introduction to analytic number theory

numbers and uniform ergodic theorems
numbers and uniform ergodic theorems

Distribution of Prime Numbers
Distribution of Prime Numbers

Theory of L-functions - Institut für Mathematik
Theory of L-functions - Institut für Mathematik

Additive decompositions of sets with restricted prime factors
Additive decompositions of sets with restricted prime factors

Exponential Sums and Diophantine Problems
Exponential Sums and Diophantine Problems

Lectures on Sieve Methods - School of Mathematics, TIFR
Lectures on Sieve Methods - School of Mathematics, TIFR

Informed RRT*: Optimal Sampling-based Path Planning Focused via
Informed RRT*: Optimal Sampling-based Path Planning Focused via

Graduate Texts in Mathematics 232
Graduate Texts in Mathematics 232

Sieve Methods
Sieve Methods

FACTORING IN QUADRATIC FIELDS 1. Introduction √
FACTORING IN QUADRATIC FIELDS 1. Introduction √

Vector Calculus
Vector Calculus

Large gaps between consecutive prime numbers
Large gaps between consecutive prime numbers

Math 13 — An Introduction to Abstract Mathematics
Math 13 — An Introduction to Abstract Mathematics

Sequences, Series, and the Binomial Theorem
Sequences, Series, and the Binomial Theorem

THE p–ADIC ORDER OF POWER SUMS, THE ERD
THE p–ADIC ORDER OF POWER SUMS, THE ERD

Math 784: algebraic NUMBER THEORY
Math 784: algebraic NUMBER THEORY

Did I get it right? COS 326 Andrew W. Appel Princeton University
Did I get it right? COS 326 Andrew W. Appel Princeton University

Elliptic Curves and The Congruent Number Problem
Elliptic Curves and The Congruent Number Problem

41(3)
41(3)

1 2 3 4 5 ... 26 >

Nyquist–Shannon sampling theorem



In the field of digital signal processing, the sampling theorem is a fundamental bridge between continuous-time signals (often called ""analog signals"") and discrete-time signals (often called ""digital signals""). It establishes a sufficient condition for a sample rate that permits a discrete sequence of samples to capture all the information from a continuous-time signal of finite bandwidth.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 (see Fig 1). 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 fidelity for the class of functions that are bandlimited to a given bandwidth, such that no actual information is lost in the sampling process. It expresses the sufficient sample rate in terms of the bandwidth for the class of functions. The theorem also leads to a formula for perfectly reconstructing the original continuous-time function from the samples.Perfect reconstruction may still be possible when the sample-rate criterion is not satisfied, provided other constraints on the signal are known. (See § Sampling of non-baseband signals below, and Compressed sensing.)In some cases (when the sample-rate criterion is not satisfied), utilizing additional constraints allows for approximate reconstructions. The fidelity of these reconstructions can be verified and quantified utilizing Bochner's theorem.The name Nyquist–Shannon sampling theorem honors Harry Nyquist and Claude Shannon. The theorem was also discovered independently by E. T. Whittaker, by Vladimir Kotelnikov, and by others. It is thus also known by the names Nyquist–Shannon–Kotelnikov, Whittaker–Shannon–Kotelnikov, Whittaker–Nyquist–Kotelnikov–Shannon, and cardinal theorem of interpolation.
  • studyres.com © 2025
  • DMCA
  • Privacy
  • Terms
  • Report