9-Sampling Low Frequency

Title Tag

Aliasing in Fourier Space Explained Simply | Nyquist Sampling and Signal Processing

Meta Description

Learn what aliasing means in Fourier space using simple explanations, real-life examples, and a beginner-friendly Python example with signal sampling and the Nyquist theorem.

Aliasing in Fourier Space Explained in Simple Terms

If you’ve started learning about signal processing, Fourier transforms, or digital sampling, you’ve probably heard the word aliasing.

And honestly, it sounds more complicated than it needs to be.

At its core, aliasing happens when we sample a signal too slowly. When that happens, different frequencies start overlapping, and the original signal becomes impossible to reconstruct correctly.

This article explains:

  • what aliasing is
  • how sampling works
  • why the Nyquist sampling theorem matters
  • and how to visualize it with Python

We’ll keep things practical and beginner-friendly.


What Is Sampling?

Sampling means taking measurements from a continuous signal at fixed intervals.

For example:

  • recording audio digitally
  • capturing frames in a video
  • measuring temperature every second
  • converting analog music into MP3 format

Instead of storing the entire continuous signal, we only store selected points.

Imagine drawing dots on a smooth curve:

Continuous signal → • • • • •

Those dots are the samples.


A Simple Real-Life Example of Aliasing

Think about a spinning wheel in a movie.

Sometimes the wheel appears:

  • to spin slowly
  • backward
  • or even stand still

But the wheel is actually rotating normally.

This happens because the camera captures frames at a fixed frame rate. The sampling rate is too low to correctly capture the wheel’s true motion.

That’s aliasing.

The sampled version creates a false interpretation of the original signal.

This same idea happens in:

  • digital audio
  • image processing
  • computer vision
  • medical imaging
  • telecommunications


Understanding Fourier Space

Before talking about aliasing, we need a basic idea of Fourier space.

A Fourier transform converts a signal from:

  • the time or spatial domain
    to
  • the frequency domain

Instead of asking:

“What does the signal look like over time?”

we ask:

“Which frequencies make up this signal?”

For example:

  • low frequencies = slow changes
  • high frequencies = rapid changes


How Sampling Works in Fourier Space

In signal processing, sampling a signal means multiplying the signal by a comb function.

The comb function is basically a series of evenly spaced spikes:

|   |   |   |   |

When you multiply a continuous signal by this comb:

  • you keep only selected points
  • those become your samples

Now here’s the important part:

When multiplication happens in normal space, convolution happens in Fourier space.

That convolution duplicates the signal spectrum repeatedly.

If those repeated spectra overlap, aliasing occurs.


The Nyquist Sampling Theorem

The Nyquist theorem tells us how fast we need to sample a signal.

The rule is:

The sampling frequency must be at least twice the highest frequency in the signal.

Mathematically:

fs2fmaxf_s \geq 2f_{max}

Where:

  • fsf_s = sampling frequency
  • fmaxf_{max} = highest signal frequency

This minimum rate is called the Nyquist rate.


Why CDs Use 44.1 kHz Sampling

Human hearing typically reaches about 20 kHz.

According to Nyquist:

Minimum sampling rate = 2 × 20 kHz = 40 kHz

That’s why audio CDs use:

  • 44.1 kHz sampling rate

It gives enough room to accurately reproduce sounds humans can hear.


What Happens When Sampling Is Too Slow?

If the sampling rate is too low:

  • frequency copies overlap
  • high frequencies get misinterpreted
  • reconstruction fails

That overlap is aliasing.

In Fourier space, it looks like repeated frequency bands crashing into each other.


Python Example: Aliasing with a Built-in Dataset

Now let’s make this practical.

We’ll use Python with NumPy and Matplotlib to demonstrate:

  • a high-frequency signal
  • proper sampling
  • incorrect sampling that causes aliasing

This is beginner-friendly and uses standard scientific Python libraries.

Python Code Example

import numpy as np
import matplotlib.pyplot as plt

# Create a continuous time axis
t = np.linspace(0, 1, 1000)

# Original signal frequency (15 Hz)
frequency = 15

# Create the original sine wave
signal = np.sin(2 * np.pi * frequency * t)

# GOOD sampling rate (50 Hz)
sample_rate_good = 50
t_good = np.linspace(0, 1, sample_rate_good)
samples_good = np.sin(2 * np.pi * frequency * t_good)

# BAD sampling rate (20 Hz)
sample_rate_bad = 20
t_bad = np.linspace(0, 1, sample_rate_bad)
samples_bad = np.sin(2 * np.pi * frequency * t_bad)

# Plot original signal
plt.figure(figsize=(10, 6))
plt.plot(t, signal, label="Original Signal")

# Plot correctly sampled points
plt.scatter(t_good, samples_good, label="Good Sampling")

# Plot badly sampled points
plt.scatter(t_bad, samples_bad, label="Aliased Sampling")

plt.xlabel("Time")
plt.ylabel("Amplitude")
plt.title("Aliasing Example in Signal Sampling")
plt.legend()
plt.show()


What This Python Example Shows

In this example:

  • the original signal frequency is 15 Hz
  • 50 Hz sampling works correctly
  • 20 Hz sampling is too low

Because 20 Hz is below the Nyquist requirement:

  • the sampled signal becomes misleading
  • the waveform appears distorted

This is aliasing in action.


Key Takeaways About Aliasing

Here are the main ideas:

1. Sampling Converts Continuous Signals into Discrete Data

Digital systems can only store sampled values.


2. Fourier Space Shows Frequency Information

Signals can be analyzed by their frequency components.


3. Aliasing Happens When Frequencies Overlap

If sampling is too slow, signal copies overlap in Fourier space.


4. Nyquist Prevents Aliasing

Sample at least twice the highest frequency.


Common Applications of Aliasing Concepts

Aliasing matters in many fields:

  • digital audio
  • image processing
  • computer graphics
  • MRI scans
  • telecommunications
  • machine learning preprocessing
  • computer vision


Suggested Internal Links

You could internally link this article to:

  • “Introduction to Fourier Transform for Beginners”
  • “What Is Convolution in Signal Processing?”
  • “Digital Signal Processing Basics”
  • “Understanding Frequency Domain Analysis”
  • “Image Sampling and Resolution Explained”


Suggested Image Alt Text

If you include diagrams or plots, use descriptive alt text like:

  • “Illustration of signal aliasing in Fourier space”
  • “Comparison of proper and improper signal sampling”
  • “Nyquist sampling theorem frequency diagram”
  • “Python plot showing aliasing effect in sine wave sampling”


Final Thoughts

Aliasing sounds technical at first, but the core idea is simple:

If you don’t sample fast enough, your digital system misunderstands the signal.

That misunderstanding shows up as distortion, incorrect frequencies, or strange artifacts.

And once you visualize repeated frequency spectra overlapping in Fourier space, the idea becomes much easier to understand.

For the discussion about aliasing, though, I'm just going to talk about this in 1D, because it's a lot easier to draw the pictures and to make it clear. So, hang on, what we're going to do is, we're going to now talk about aliasing in the Fourier space, and we're going to talk about sampling a signal.

And we'll first talk about sampling a low frequency signal, and then a high frequency signal. Here we have a function, so here we have some nice function f. And it's a nice smooth function, let's say, all right. And it has some Fourier spectrum like this, F of u. And you'll notice that it's kind of limited, right, it doesn't go, it doesn't have very high frequency components, like, no high frequency components, very, very low. And here's our comb function pulse train, okay. And, as we said before, the Fourier transform of that pulse train is another pulse train. And if the separation of that pulse train in, in space is M, then in frequency it's 1 over M. Now comes the point that's not so obvious. Suppose I want to take samples of a continuous function, right, I want to take a sample here, and a sample here, and a sample here, and a sample here, and a sample here, et cetera, and I wanted to do it with a spacing of M. How would I do that? I actually have what I need here, I just multiply this times this, and I get this. All right? That is, here is just the set of samples, multiplied by f. Okay? So sampling is just multiplying your continuous signal by this discrete comb. This is is why we had to introduce the notion of multiplying functions, and the notion of a comb. Sampling is the multiplication of your signal by a comb. Now, when I multiply in space, what do I do in frequency? I convolve. Remember, convolution in space is multiply in frequency, and multiply in space is convolution in frequency. So what I'm going to do is, I'm going to convolve the Fourier transform of f with the Fourier transform of the comb, I'm just showing the power here, and I get that. Okay, so this is the convolution, and you'll see, if I just take this function and I slide it along, I can re, I'll reconstruct it here, reconstruct it here, reconstruct it there, and that's what this is showing you, okay. So that's the Fourier transform of the multiplication of the comb times the function. Just copying that bottom row. If this function is limited, in fact, I can show it down here like this, all right, then if I could pull out that part of the signal, the part of the signal that's frequency is just within some range. Then I would be able to get back what I wanted, right. I would be able to get back the original spectrum, which would give me back the original function. So this is no problem if this outer edge is small enough, that is, that the, the maximum frequency of my signal is low enough for the comb filter that I used. Exactly what is that small enough? Well, here it's written like this, okay? If my comb filter is spacing M, so then the comb of my Fourier of that, of the Fourier of the comb is 1 over M, half this distance here is 1 over 2M, okay.

If the maximum frequency of that function, let's say is W, for bandwidth, is W, if that's less than 1 over 2M, then I can reconstruct that original signal by looking at just this part, that is, nothing has contaminated that inner part. So if there's no overlap, if W is less than 1 over 2M, the original signal can be recovered from its samples by low-pass filtering, which we'll talk about in a minute. So those of you that know something about Nyquist sampling, so you know that if I want to recover, say, something up to 20 kilohertz, right, 20 kilohertz, about the, the extent of human hearing, I would need to sample at least 40 kilohertz. By the way, CDs, like we used to, were talking about, sample at 44 kilohertz, why? So that we can recover everything up to 22 kilohertz, which is the extent of human hearing.

Last modified: Saturday, 23 May 2026, 7:48 AM