Bird
Raised Fist0
SciPydata~5 mins

Real FFT (rfft) in SciPy

Choose your learning style10 modes available
Introduction

Real FFT helps us find the frequency parts of a signal that has only real numbers. It is faster and simpler than the full FFT when the input is real.

Analyzing sound waves recorded as real numbers to find their main tones.
Checking vibrations in machines using sensor data that is real-valued.
Studying heartbeats from real-valued ECG signals to find patterns.
Finding repeating patterns in temperature data collected over time.
Syntax
SciPy
scipy.fft.rfft(x, n=None, axis=-1, norm=None, workers=None, overwrite_x=False)

x is the input array of real numbers.

n is the length of the FFT. If not given, it uses the length of x.

Examples
Basic use of rfft on a small real array.
SciPy
from scipy.fft import rfft
import numpy as np
x = np.array([1, 2, 3, 4])
result = rfft(x)
print(result)
Using rfft on a sine wave to see the main frequency components.
SciPy
from scipy.fft import rfft
import numpy as np
x = np.sin(2 * np.pi * 5 * np.linspace(0, 1, 100))
result = rfft(x)
print(result[:5])
Sample Program

This program creates a signal with two sine waves at 3 Hz and 7 Hz. It uses rfft to find the frequency parts and prints their amplitudes.

SciPy
from scipy.fft import rfft, rfftfreq
import numpy as np
import matplotlib.pyplot as plt

# Create a sample signal: 3 Hz and 7 Hz sine waves added
sampling_rate = 50  # samples per second
T = 1 / sampling_rate
t = np.linspace(0, 1, sampling_rate, endpoint=False)
signal = 0.7 * np.sin(2 * np.pi * 3 * t) + 0.3 * np.sin(2 * np.pi * 7 * t)

# Compute the real FFT
fft_result = rfft(signal)

# Get the frequencies for the FFT result
freqs = rfftfreq(len(signal), T)

# Print the frequencies and their amplitudes
for f, amp in zip(freqs, np.abs(fft_result)):
    print(f"Frequency: {f:.1f} Hz, Amplitude: {amp:.2f}")
OutputSuccess
Important Notes

rfft returns only the positive frequency parts because the input is real, so the negative frequencies are mirror images.

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

Use rfftfreq to get the frequency values that match the rfft output.

Summary

Real FFT (rfft) finds frequency parts of real-valued signals efficiently.

It returns only half the spectrum because real signals have mirrored negative frequencies.

Use it to analyze real-world signals like sound, vibrations, or sensor data.

Practice

(1/5)
1. What does the scipy.fft.rfft function compute when applied to a real-valued signal?
easy
A. The full complex Fourier transform including negative frequencies
B. The positive frequency components of the signal's Fourier transform
C. The inverse Fourier transform of the signal
D. The time-domain signal filtered by a low-pass filter

Solution

  1. Step 1: Understand the input type

    rfft is designed for real-valued input signals.
  2. Step 2: Analyze the output of rfft

    It returns only the positive frequency components because the negative frequencies are mirror images for real signals.
  3. Final Answer:

    The positive frequency components of the signal's Fourier transform -> Option B
  4. Quick Check:

    Real input -> half spectrum output [OK]
Hint: Real signals -> use rfft for positive frequencies only [OK]
Common Mistakes:
  • Confusing rfft with full fft output
  • Thinking rfft returns time-domain data
  • Assuming rfft returns negative frequencies
2. Which of the following is the correct way to import and use rfft from SciPy's FFT module?
easy
A. import scipy.fft as rfft result = rfft.rfft(signal)
B. import scipy.rfft result = scipy.rfft(signal)
C. from scipy.fft import rfft result = rfft(signal)
D. from scipy import rfft result = rfft.fft(signal)

Solution

  1. Step 1: Recall correct import syntax

    The rfft function is in scipy.fft, so import it directly from there.
  2. Step 2: Check usage

    Calling rfft(signal) after import is the correct usage.
  3. Final Answer:

    from scipy.fft import rfft\nresult = rfft(signal) -> Option C
  4. Quick Check:

    Correct import and call syntax [OK]
Hint: Import rfft directly from scipy.fft for simple use [OK]
Common Mistakes:
  • Trying to import rfft from scipy directly
  • Using wrong module names
  • Calling rfft as a method of scipy.fft without import
3. What is the output of the following code?
import numpy as np
from scipy.fft import rfft
signal = np.array([1, 0, -1, 0])
result = rfft(signal)
print(np.round(result, 2))
medium
A. [0.+0.j 1.+0.j 0.+0.j]
B. [0.+0.j 0.+0.j 0.+0.j]
C. [0.+0.j -2.+0.j 0.+0.j]
D. [0.+0.j 2.+0.j 0.+0.j]

Solution

  1. Step 1: Understand the input signal

    The signal is [1, 0, -1, 0], a simple 4-point real array.
  2. Step 2: Compute rfft manually or recall pattern

    rfft returns N/2+1 = 3 complex values for length 4 input. The values correspond to DC, positive frequency, and Nyquist frequency components. The result is approximately [0.+0.j, 2.+0.j, 0.+0.j].
  3. Final Answer:

    [0.+0.j 2.+0.j 0.+0.j] -> Option D
  4. Quick Check:

    rfft length 4 -> 3 outputs, middle value 2 [OK]
Hint: rfft output length = input//2 + 1 [OK]
Common Mistakes:
  • Expecting output length same as input
  • Ignoring complex number format
  • Misreading the signal values
4. Identify the error in this code snippet using rfft and fix it:
import numpy as np
from scipy.fft import rfft
signal = [1, 2, 3, 4]
result = rfft(signal, n=2)
print(result)
medium
A. The parameter n is smaller than signal length; use n=4 instead
B. The input signal must be a NumPy array, not a list
C. rfft does not accept the parameter n
D. The import statement is incorrect; use import scipy.fftpack

Solution

  1. Step 1: Check the n parameter usage

    The n parameter sets the length of the FFT. Here, n=2 is less than the signal length 4, so the signal is truncated.
  2. Step 2: Fix the parameter to match or exceed signal length

    Using n=4 ensures the full signal is transformed without truncation.
  3. Final Answer:

    The parameter n is smaller than signal length; use n=4 instead -> Option A
  4. Quick Check:

    FFT length must cover signal length [OK]
Hint: Set n ≥ signal length to avoid truncation [OK]
Common Mistakes:
  • Passing list instead of array (allowed but less efficient)
  • Ignoring effect of n parameter truncation
  • Wrong import module for rfft
5. You have a real sensor signal sampled at 100 Hz with 1000 points. You want to find the frequency with the highest amplitude using rfft. Which code snippet correctly computes this frequency?
hard
A. import numpy as np from scipy.fft import rfft, rfftfreq signal = np.random.rand(1000) fft_vals = rfft(signal) freqs = rfftfreq(len(signal), 1/100) peak_freq = freqs[np.argmax(np.abs(fft_vals))] print(peak_freq)
B. import numpy as np from scipy.fft import fft signal = np.random.rand(1000) fft_vals = fft(signal) freqs = np.fft.fftfreq(len(signal), 1/100) peak_freq = freqs[np.argmax(np.abs(fft_vals))] print(peak_freq)
C. import numpy as np from scipy.fft import rfft signal = np.random.rand(1000) fft_vals = rfft(signal) peak_freq = np.argmax(np.abs(fft_vals)) print(peak_freq)
D. import numpy as np from scipy.fft import rfft, rfftfreq signal = np.random.rand(1000) fft_vals = rfft(signal) freqs = rfftfreq(len(signal), 100) peak_freq = freqs[np.argmax(np.abs(fft_vals))] print(peak_freq)

Solution

  1. Step 1: Use rfft and rfftfreq correctly

    For real signals, rfft computes the positive frequencies, and rfftfreq gives the corresponding frequency bins. The sampling interval is 1/100 seconds.
  2. Step 2: Find the peak frequency

    Calculate the absolute values of FFT coefficients, find the index of the max, then map to frequency using freqs.
  3. Final Answer:

    Code snippet A correctly computes the peak frequency -> Option A
  4. Quick Check:

    Use rfft + rfftfreq with correct sampling interval [OK]
Hint: Use rfftfreq with 1/sampling_rate for correct frequencies [OK]
Common Mistakes:
  • Using fft and fftfreq for real signals (less efficient)
  • Wrong sampling interval in rfftfreq
  • Not mapping peak index to frequency
Recommended

Ready to prove it?

Pass the test and this pattern moves unknown strong while earning +1 Grip toward your certificate.

10 questions~5 mineasy hard