Why Fourier transforms reveal frequencies in SciPy

Introduction

Fourier transforms help us find the hidden repeating patterns (frequencies) inside any signal or data. This is useful because many real-world signals are made of different waves combined together.

You want to find the main tones in a sound recording.

You need to analyze the heartbeat signals to check for irregularities.

You want to detect repeating patterns in stock market prices.

You want to filter out noise from sensor data by focusing on certain frequencies.

You want to understand the rhythm or cycles in weather data.

Syntax

SciPy

from scipy.fft import fft

# fft(data) computes the Fourier transform of the data array

The input data should be a list or array of numbers representing the signal over time.

The output is a complex array showing amplitude and phase for each frequency component.

Examples

This finds the frequency components of a 5 Hz sine wave sampled 100 times over 1 second.

SciPy

from scipy.fft import fft
import numpy as np

# Simple sine wave
x = np.sin(2 * np.pi * 5 * np.linspace(0, 1, 100, endpoint=False))
result = fft(x)

This signal combines 3 Hz and 10 Hz waves. Fourier transform will show peaks at these frequencies.

SciPy

from scipy.fft import fft
import numpy as np

# Signal with two frequencies
x = np.sin(2 * np.pi * 3 * np.linspace(0, 1, 100, endpoint=False)) + 0.5 * np.sin(2 * np.pi * 10 * np.linspace(0, 1, 100, endpoint=False))
result = fft(x)

Sample Program

This program creates a signal with two known frequencies, finds its Fourier transform, and prints the main frequencies with their strengths.

SciPy

from scipy.fft import fft, fftfreq
import numpy as np
import matplotlib.pyplot as plt

# Create a signal with two frequencies: 5 Hz and 20 Hz
sampling_rate = 100  # samples per second
T = 1 / sampling_rate  # sample spacing
x = np.linspace(0.0, 1.0, sampling_rate, endpoint=False)
signal = np.sin(2.0 * np.pi * 5.0 * x) + 0.5 * np.sin(2.0 * np.pi * 20.0 * x)

# Compute Fourier transform
yf = fft(signal)
xf = fftfreq(sampling_rate, T)[:sampling_rate // 2]

# Get magnitude of frequencies
magnitude = 2.0 / sampling_rate * np.abs(yf[0:sampling_rate // 2])

# Print main frequencies and their magnitudes
for freq, mag in zip(xf, magnitude):
    if mag > 0.1:
        print(f"Frequency: {freq:.1f} Hz, Magnitude: {mag:.2f}")

Important Notes

The Fourier transform output is complex because it contains both amplitude and phase information.

Only half of the output frequencies are unique for real signals, so we usually look at the first half.

Higher magnitude means stronger presence of that frequency in the signal.

Summary

Fourier transforms break down signals into their frequency parts.

This helps us see which frequencies make up the signal.

It is useful for analyzing sounds, vibrations, and many other real-world data.

Practice

1. Why does a Fourier transform help us understand a signal better?

easy

A. Because it averages the signal values over time

B. Because it removes noise from the signal

C. Because it changes the signal into a longer time series

D. Because it shows the different frequencies inside the signal

Solution

1. Step 1: Understand what a Fourier transform does

   A Fourier transform breaks a signal into its frequency parts, showing which frequencies are present.

2. Step 2: Compare options to this understanding

   Only Because it shows the different frequencies inside the signal correctly states that it reveals the different frequencies inside the signal.

3. Final Answer:

   Because it shows the different frequencies inside the signal -> Option D

4. Quick Check:

   Fourier transform = frequency breakdown [OK]

Hint: Fourier transform = signal to frequency parts [OK]

Common Mistakes:

• Thinking Fourier transform removes noise
• Confusing time and frequency domains
• Believing it averages signal values

2. Which of the following is the correct way to import the Fourier transform function from scipy?

easy

A. import scipy.fftpack.fft

B. from scipy.fft import fft

C. from scipy import fourier_transform

D. import fft from scipy

Solution

1. Step 1: Recall the correct scipy module for Fourier transforms

   The modern scipy module for Fourier transforms is scipy.fft, and the function is fft.

2. Step 2: Check each import statement

   Only 'from scipy.fft import fft' is valid Python syntax and correct module usage.

3. Final Answer:

   from scipy.fft import fft -> Option B

4. Quick Check:

   Correct import = from scipy.fft import fft [OK]

Hint: Use scipy.fft for Fourier transforms in recent versions [OK]

Common Mistakes:

• Using scipy.fftpack which is older
• Wrong import syntax causing errors
• Assuming function name is fourier_transform

3. What is the output of this code snippet?

import numpy as np
from scipy.fft import fft

signal = np.array([1, 0, -1, 0])
result = fft(signal)
print(np.round(result, 2))

medium

A. [0.+0.j 2.+0.j 0.+0.j 2.+0.j]

B. [0.+0.j 2.+0.j 0.-0.j 2.-0.j]

C. [0.+0.j 1.+0.j 0.+0.j 1.+0.j]

D. [0.+0.j 0.+0.j 0.+0.j 0.+0.j]

Solution

1. Step 1: Understand the input signal and FFT output

   The signal is [1, 0, -1, 0], a simple wave. FFT returns complex numbers representing frequency components.

2. Step 2: Calculate FFT and round results

   FFT of this signal is [0.+0.j 2.+0.j 0.+0.j 2.+0.j]. Rounding to 2 decimals keeps these values.

3. Final Answer:

   [0.+0.j 2.+0.j 0.+0.j 2.+0.j] -> Option A

4. Quick Check:

   FFT output matches [0.+0.j 2.+0.j 0.+0.j 2.+0.j] [OK]

Hint: FFT output shows complex frequency components [OK]

Common Mistakes:

• Ignoring complex part signs
• Confusing zeros with small imaginary parts
• Misreading array values

4. Identify the error in this code that tries to compute the Fourier transform:

import numpy as np
from scipy.fft import fft

signal = [1, 2, 3, 4]
result = fft(signal, n=2)
print(result)

medium

A. fft does not accept the parameter n

B. The signal must be a numpy array, not a list

C. The parameter n=2 truncates the signal incorrectly

D. The import statement is incorrect

Solution

1. Step 1: Check fft function parameters

   The fft function accepts n, which sets the length of the transform. Setting n=2 truncates or pads the signal to length 2.

2. Step 2: Understand effect of n=2 on signal length

   The original signal length is 4, but n=2 means fft uses only first 2 elements, effectively truncating the signal.

3. Final Answer:

   The parameter n=2 truncates the signal incorrectly -> Option C

4. Quick Check:

   n parameter changes transform length [OK]

Hint: n parameter sets FFT length, can truncate signal [OK]

Common Mistakes:

• Thinking fft requires numpy array input
• Believing fft does not accept n parameter
• Assuming import is wrong

5. You have a noisy signal composed of two sine waves at 5 Hz and 20 Hz. How can Fourier transform help you separate these frequencies?

hard

A. By converting the signal to frequency domain, peaks at 5 Hz and 20 Hz appear clearly

B. By filtering the signal in time domain before transform

C. By averaging the signal values over time to remove noise

D. By applying inverse Fourier transform directly

Solution

1. Step 1: Understand the purpose of Fourier transform on noisy signals

   Fourier transform converts time signals into frequency domain, showing frequency peaks clearly.

2. Step 2: Identify how frequency peaks help separate components

   In frequency domain, the 5 Hz and 20 Hz sine waves appear as distinct peaks, allowing separation despite noise.

3. Final Answer:

   By converting the signal to frequency domain, peaks at 5 Hz and 20 Hz appear clearly -> Option A

4. Quick Check:

   Frequency peaks reveal signal components [OK]

Hint: Fourier transform reveals frequency peaks in noisy signals [OK]

Common Mistakes:

• Thinking noise is removed before transform
• Confusing time and frequency domain filtering
• Using inverse transform without frequency analysis