FFT-based filtering in SciPy - Cheat Sheet & Quick Revision

Recall & Review

beginner

What does FFT stand for in signal processing?

FFT stands for Fast Fourier Transform. It is a fast way to compute the Discrete Fourier Transform (DFT) of a signal.

beginner

Why do we use FFT-based filtering instead of time-domain filtering?

FFT-based filtering is often faster for large signals and allows easy removal or modification of specific frequency components by working in the frequency domain.

beginner

What is the basic step to filter a signal using FFT?

1. Compute FFT of the signal.
2. Modify the FFT coefficients to keep or remove frequencies.
3. Compute the inverse FFT to get the filtered signal back in time domain.

beginner

What Python library and function can you use to perform FFT?

You can use the scipy.fft module, especially the scipy.fft.fft() function to compute the FFT of a signal.

intermediate

How do you remove high frequencies from a signal using FFT-based filtering?

After computing the FFT, set the FFT coefficients corresponding to high frequencies to zero, then apply the inverse FFT to get a low-pass filtered signal.

What is the first step in FFT-based filtering?

A Plot the signal

B Apply a time-domain filter

C Compute the FFT of the signal

D Normalize the signal

The first step is to compute the FFT of the signal to transform it into the frequency domain.

Which Python function is used to compute the inverse FFT?

A scipy.fft.ifft()

B scipy.fft.fft()

C numpy.fft.fft()

D scipy.signal.filter()

The inverse FFT is computed using scipy.fft.ifft() to convert frequency data back to time domain.

What happens if you set some FFT coefficients to zero before inverse FFT?

A The signal becomes louder

B Those frequencies are removed from the signal

C The signal length doubles

D The signal is unchanged

Setting FFT coefficients to zero removes those frequency components from the signal.

FFT-based filtering is especially useful for which type of signals?

A Large signals with many samples

B Very short signals

C Signals without noise

D Signals with only one frequency

FFT-based filtering is efficient for large signals where frequency domain manipulation is faster.

Which of these is NOT a step in FFT-based filtering?

A Compute FFT

B Modify frequency components

C Apply inverse FFT

D Differentiate the signal

Differentiating the signal is not part of the FFT-based filtering process.

Explain the process of filtering a signal using FFT-based filtering.

Think about how you change the signal in the frequency domain and then go back to time domain.

Why might FFT-based filtering be preferred over time-domain filtering for large datasets?

Consider the speed and flexibility of working in frequency domain.

Practice

1. What is the main purpose of using FFT-based filtering in data analysis?

easy

A. To transform data into frequency domain for easier noise removal

B. To sort data values in ascending order

C. To calculate the average of data points

D. To convert data into text format

Solution

1. Step 1: Understand FFT transformation

   FFT converts data from time domain to frequency domain, revealing frequency components.

2. Step 2: Purpose of filtering in frequency domain

   Filtering in frequency domain allows easy removal of unwanted noise or frequencies.

3. Final Answer:

   To transform data into frequency domain for easier noise removal -> Option A

4. Quick Check:

   FFT filtering = frequency domain noise removal [OK]

Hint: FFT helps remove noise by working in frequency domain [OK]

Common Mistakes:

• Confusing FFT with sorting or averaging
• Thinking FFT changes data to text
• Assuming FFT directly cleans data without filtering

2. Which of the following is the correct way to compute the FFT of a 1D numpy array data using scipy?

easy

A. fft_data = scipy.fft_transform(data)

B. fft_data = scipy.fft(data)

C. fft_data = scipy.fft.fft(data)

D. fft_data = scipy.fft_fft(data)

Solution

1. Step 1: Identify correct scipy FFT function

   The scipy FFT module uses fft() to compute the Fast Fourier Transform.

2. Step 2: Check syntax correctness

   The correct syntax is scipy.fft.fft(data), other options are invalid function names.

3. Final Answer:

   fft_data = scipy.fft.fft(data) -> Option C

4. Quick Check:

   Correct FFT call = scipy.fft.fft(data) [OK]

Hint: Use scipy.fft.fft() to compute FFT of array [OK]

Common Mistakes:

• Using incorrect function names like fft_transform
• Omitting the .fft part after scipy.fft
• Confusing with numpy.fft functions

3. Given the code below, what will be the output of filtered_signal?

import numpy as np
from scipy.fft import fft, ifft

data = np.array([1, 2, 3, 4])
fft_data = fft(data)
mask = np.array([1, 0, 0, 1])
filtered_fft = fft_data * mask
filtered_signal = ifft(filtered_fft).real
print(np.round(filtered_signal, 2))

medium

A. [1. 0. 0. 4.]

B. [2. 2. 3. 3.]

C. [1.5 0. 0. 3.5]

D. [2. 0. 0. 2.]

Solution

1. Step 1: Compute FFT and apply mask

   FFT of data is computed, then multiplied by mask [1,0,0,1], zeroing middle frequencies.

2. Step 2: Compute inverse FFT and round

   Inverse FFT of masked data gives filtered signal; rounding to 2 decimals yields [2. 0. 0. 2.].

3. Final Answer:

   [2. 0. 0. 2.] -> Option D

4. Quick Check:

   Mask zeros middle frequencies, inverse FFT smooths signal [OK]

Hint: Mask zeros frequencies, inverse FFT returns filtered signal [OK]

Common Mistakes:

• Forgetting to multiply FFT by mask
• Not taking real part after inverse FFT
• Rounding incorrectly or not at all

4. Identify the error in the following FFT-based filtering code snippet:

import numpy as np
from scipy.fft import fft, ifft

data = np.array([1, 2, 3, 4])
fft_data = fft(data)
mask = np.array([1, 0, 0])
filtered_fft = fft_data * mask
filtered_signal = ifft(filtered_fft).real
print(filtered_signal)

medium

A. Data array should be complex type

B. Mask length does not match FFT data length

C. Using ifft instead of fft

D. Missing import for numpy

Solution

1. Step 1: Check mask and FFT data lengths

   FFT of data has length 4, but mask length is 3, causing shape mismatch error.

2. Step 2: Identify error cause

   Multiplying arrays of different lengths raises an error; mask must match FFT length.

3. Final Answer:

   Mask length does not match FFT data length -> Option B

4. Quick Check:

   Mask length must equal FFT length [OK]

Hint: Mask length must match FFT output length [OK]

Common Mistakes:

• Using mask shorter than FFT result
• Confusing ifft with fft usage
• Assuming data must be complex initially

5. You have a noisy signal sampled at 1000 Hz stored in signal. You want to remove frequencies above 100 Hz using FFT-based filtering. Which code snippet correctly implements this filter?

hard

A. import numpy as np
from scipy.fft import fft, ifft
N = len(signal)
freqs = np.fft.fftfreq(N, 1/1000)
fft_signal = fft(signal)
mask = np.abs(freqs) <= 100
filtered_fft = fft_signal * mask
filtered_signal = ifft(filtered_fft).real

B. import numpy as np
from scipy.fft import fft, ifft
N = len(signal)
freqs = np.fft.fftfreq(N)
fft_signal = fft(signal)
mask = freqs < 100
filtered_fft = fft_signal * mask
filtered_signal = ifft(filtered_fft).real

C. import numpy as np
from scipy.fft import fft, ifft
N = len(signal)
freqs = np.fft.fftfreq(N, 1/1000)
fft_signal = fft(signal)
mask = freqs > 100
filtered_fft = fft_signal * mask
filtered_signal = ifft(filtered_fft).real

D. import numpy as np
from scipy.fft import fft, ifft
N = len(signal)
freqs = np.fft.fftfreq(N, 1/1000)
fft_signal = fft(signal)
mask = np.abs(freqs) >= 100
filtered_fft = fft_signal * mask
filtered_signal = ifft(filtered_fft).real

Solution

1. Step 1: Calculate frequency bins correctly

   Use np.fft.fftfreq(N, 1/1000) to get frequencies in Hz for sampling rate 1000 Hz.

2. Step 2: Create mask to keep frequencies ≤ 100 Hz

   Mask should be np.abs(freqs) <= 100 to keep low frequencies and remove higher ones.

3. Step 3: Apply mask and inverse FFT

   Multiply FFT by mask, then apply inverse FFT and take real part for filtered signal.

4. Final Answer:

   mask = np.abs(freqs) <= 100 with freqs = np.fft.fftfreq(N, 1/1000) -> Option A

5. Quick Check:

   Mask keeps frequencies ≤ 100 Hz [OK]

Hint: Use np.abs(freqs) ≤ cutoff for low-pass mask [OK]

Common Mistakes:

• Ignoring sampling rate in frequency calculation
• Using wrong comparison operators in mask
• Not taking absolute value of frequencies