Scribd
Upload
4 views

Unit 3P2

The document explains the Fast Fourier Transform (FFT) as an efficient algorithm for computing the Discrete Fourier Transform (DFT) of a function, specifically using the example of f(x) = e^(−x^2). It outlines the basics of the Fourier Transform, the DFT, and the advantages of using FFT, which reduces computational complexity. An algorithm for implementing FFT on a given function is also provided, detailing the steps from defining the function to plotting the results.

Uploaded by

uanuj040
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
4 views

Unit 3P2

The document explains the Fast Fourier Transform (FFT) as an efficient algorithm for computing the Discrete Fourier Transform (DFT) of a function, specifically using the example of f(x) = e^(−x^2). It outlines the basics of the Fourier Transform, the DFT, and the advantages of using FFT, which reduces computational complexity. An algorithm for implementing FFT on a given function is also provided, detailing the steps from defining the function to plotting the results.

Uploaded by

uanuj040
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Unit 3:-

Program 2:- Fast Fourier Transform of given function in tabulated or mathematical form e.g function
exp(-x2 ).

Theory:- The Fast Fourier Transform (FFT) is an efficient algorithm for computing the Discrete Fourier
Transform (DFT) of a sequence, or its inverse. Here's a breakdown of the theory of FFT with an example
of applying it to the function f(x) = e^(−x^2) :

1. Fourier Transform Basics

The Fourier Transform of a continuous function f(x) is defined as: F (k )= ∫ f (x )e(−2 πikx dx ) ; x=−∞ ¿ ∞

where:

 F(k) represents the frequency domain,


 f(x) represents the time or spatial domain.

For f(x) = e^(−x^2), the Fourier Transform has an analytical solution.

2. Discrete Fourier Transform (DFT)

In practice, we often deal with discrete data. The DFT of a discrete sequence f[n] of N points is:

(−2 πikn / N)
F [k ]=∑ f [n]. e ; n=0 ¿ N −1

where k = 0,1,…, N−1 represents the frequency components.

3. Fast Fourier Transform (FFT)

The FFT is an optimized algorithm for calculating the DFT, reducing the complexity from O(N^2) to O(N
log(N)). It is especially useful for large datasets, as it significantly speeds up computation by using
symmetries in the Fourier Transform.

Algorithm:-

1. Import necessary modules.


2. Define the function on which we want to apply Fast Fourier Transform (FFT) and also define
its domain and number of data points.
3. Perform FFT on the given function.
4. Shift the FFT result towards the centre.
5. Get the frequencies for the given range of x values for the FFT.
6. Shift the frequencies towards the centre.
7. Plot a graph between x and the Gaussian function [epx(-x^2)].
8. Plot a graph between the frequency and the magnitude of the FFT.

You might also like