A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Sampling Theorem and Nyquist Sampling Rate

Graduate Depth 80 in the knowledge graph ☐ I know this ☆ Set as goal
29topics build on this
355prerequisites beneath it
See this on the map →
Fourier Transform: Definition and PropertiesSignal Classification: Continuous vs. Discrete Time→→Aliasing, Anti-Aliasing Filters, and Signal ReconstructionAnti-Aliasing Filters and Pre-Sampling Design+5 more
sampling nyquist discrete-time

Core Idea

The Nyquist sampling theorem states that a bandlimited signal with maximum frequency f_max must be sampled at f_s ≥ 2·f_max to avoid losing information. If this condition is violated, aliasing—overlap of frequency components—corrupts the discrete signal and makes reconstruction impossible.

Explainer

From your work with the Fourier transform, you know that any signal can be decomposed into sinusoidal components at specific frequencies. A bandlimited signal is one where all energy is confined to frequencies below some maximum value f_max — there are no components above that cutoff. The Nyquist theorem is a statement about what it takes to perfectly capture that signal in a sequence of discrete samples.

Here is the core intuition. When you sample a continuous signal at rate f_s, you are essentially multiplying it by a train of impulses spaced 1/f_s apart in time. In the frequency domain (recall from your Fourier transform prerequisite), multiplication in time corresponds to convolution with another impulse train — one spaced f_s apart in frequency. This creates copies of the original spectrum centered at every multiple of f_s. If f_s ≥ 2·f_max, those copies are spaced far enough apart that they don't overlap, and a lowpass filter can cleanly isolate the original spectrum, perfectly reconstructing the signal. If f_s < 2·f_max, the copies overlap — this is aliasing.

Aliasing is irreversible: once the frequency images overlap, you cannot tell which contribution came from the original signal and which from the copy. A concrete example: suppose you have a 3 kHz tone and sample at 5 kHz. The copy centered at 5 kHz places an image at 5 − 3 = 2 kHz, which lands right inside your signal band. Your reconstructed signal will contain a spurious 2 kHz tone that was never present in the original. The Nyquist rate 2·f_max is the minimum sampling frequency that prevents this — in practice, engineers sample at higher rates and use analog anti-aliasing filters before sampling to ensure no energy remains above f_s/2, the Nyquist frequency.

The theorem has a powerful converse: if the Nyquist criterion is met, the original continuous signal can be recovered *exactly* from its samples using ideal sinc interpolation. This is the bridge between your two prerequisite concepts — the discrete-time samples you classified earlier and the Fourier representation of continuous signals. Sampling is not an approximation; it is a lossless representation when the bandwidth condition is satisfied.

Understanding the Nyquist rate is the foundation for everything that comes next in digital signal processing. The DFT and FFT you'll encounter later operate on finite blocks of samples, and aliasing issues re-emerge at the block boundary. Reconstruction filters, audio codecs, communications systems, and medical imaging all depend on correctly honoring the Nyquist condition — or deliberately exploiting its violation in techniques like undersampling of narrowband signals centered at high frequencies.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Dividing Integers → Unit Rates → Proportions → Percent Concept → Converting Between Fractions, Decimals, and Percents → Operations with Rational Numbers → Two-Step Equations → Solving Multi-Step Equations → Equations with Variables on Both Sides → Angle Pairs: Complementary, Supplementary, and Vertical → Parallel Lines and Transversals → Corresponding Angles → Alternate Interior Angles → Triangle Angle Sum Theorem → Exterior Angle Theorem → Triangle Inequality Theorem → Similar Triangles: AA Similarity → Similar Triangles: SSS and SAS Similarity → Proportions in Similar Triangles → Right Triangle Trigonometry Introduction → Sine, Cosine, and Tangent Ratios → Trigonometric Ratios Review → Radian Measure → Converting Between Degrees and Radians → The Unit Circle → Pythagorean Trigonometric Identities → Fourier Series Representation of Periodic Signals → Fourier Transform: Definition and Properties → Sampling Theorem and Nyquist Sampling Rate

Longest path: 81 steps · 355 total prerequisite topics

Prerequisites (2)

Leads To (7)