Scribd
Upload
10 views12 pages

Fourier Transform

The Fourier Transform is a mathematical operation that converts a function of time into a function of frequency, essential for signal and image processing. It includes types like DFT and FFT, with FFT being a more efficient algorithm for computing DFT. The document also provides code examples for generating signals and computing their Fourier Transform using Python libraries.

Uploaded by

Micheal Moheb
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
10 views12 pages

Fourier Transform

The Fourier Transform is a mathematical operation that converts a function of time into a function of frequency, essential for signal and image processing. It includes types like DFT and FFT, with FFT being a more efficient algorithm for computing DFT. The document also provides code examples for generating signals and computing their Fourier Transform using Python libraries.

Uploaded by

Micheal Moheb
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 12

FOURIER

TRANSFORM

{
• WHAT IS FOURIER TRANSFORM
• WHY DO WE NEED IT
• CODE
INTRODUCTIO
N

The Fourier
Transform is a
mathematical

{
operation that
transforms a
function of time
(or space) into a
function of
frequency
Types of Fourier

DFT
{FFT
• Used for • An efficient
digital algorithm for
signals with computing
discrete data the dft.
points. • Faster,
• Slower , requires less
requires memory
more
{
WHY
• Signal Processing: Analyze and filter
signals in electronics and
communications.
• Image Processing: Remove noise or

{
enhance features in images.
• Shazam , JPEG
CODE ;
1. Import Libraries

numpy provides functions for

{
creating arrays, generating
signals, and performing FFT.
matplotlib.pyplot is used to
create plots for visualizing the
signal in time and frequency
domains.
2. Generate a
Signal

{• sampling_rate: The number of samples collected per


second.
• T: The total duration of the signal in seconds.
• np.linspace(0, T, int(sampling_rate * T),
endpoint=False):Creates a time vector t from 0 to T,
with sampling_rate * T points (excluding the endpoint).
• endpoint (optional, default = True):If True, the stop
value is included in the sequence.
If False, the sequence ends before stop.
3. Create a Sine
Wave

{• freq1: The frequency of the sine wave (50 Hz


in this example).
• np.sin(2 * np.pi * freq1 * t):
Computes the sine wave values using the formula
sin⁡(2πft)\sin(2\pi f t)sin(2πft), where:
fff is the frequency (freq1).
ttt is the time vector.
• The result is a discrete-time sine wave with 50
oscillations per second.
4. Compute
Fourier Transform

{• np.fft.fft(signal):
Computes the Discrete Fourier Transform (DFT) using the Fast
Fourier Transform (FFT) algorithm.
The result, fft_result, contains complex numbers representing
the amplitude and phase of each frequency component.
• np.fft.fftfreq(len(fft_result), 1 / sampling_rate):
Computes the frequency values corresponding to the FFT result.
len(fft_result) specifies the number of points in the FFT.
• 1 / sampling_rate is the time step between samples (inverse
of the sampling rate).
5. Visualize the
Results

{
Thanks, the
end

{
Made by: Michael Moheb
Abdelrahman Ahmed

References: code
cambridge
wikipedia

You might also like