Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronic Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

Register Log in

DFT + FFT Flowchart (Algorithm)

Status
Not open for further replies.

ChepRidwan

Newbie level 5
Joined
Nov 20, 2005
Messages
9
Helped
0
Reputation
0
Reaction score
0
Trophy points
1,281
Activity points
1,356
fft flowchart

I want to know the difference of both (DFT+FFT). You can show with flowchart or Algorithm or anything is easy to understand...
 

brahma

Advanced Member level 4
Joined
Sep 29, 2005
Messages
110
Helped
15
Reputation
30
Reaction score
1
Trophy points
1,298
Activity points
2,191
flowchart fft

u can get a better understaning if u study DSP by proakis
 

shameem

Member level 5
Joined
Oct 27, 2005
Messages
92
Helped
5
Reputation
10
Reaction score
3
Trophy points
1,288
Activity points
2,042
flowchart fast fourier transform

Hi,
There is no differennce between DFT and FFT. Both operations do the same thing, but FFT is faster in computation than DFT. Actually, in FFT, a divide and conquer approach is used to calculate the DFT. The algo for calculating FFT is as follows:

For a length N complex sequence , , the discrete Fourier transform (DFT) is defined by
N-1
X(f)=i/N∑x(n)e^(-j2Πkn/N) where k=0,1,2----------N-1;
n=0
We are now in a position to have a full understanding of the transform kernel:
The kernel consists of samples of a complex sinusoid at discrete frequencies uniformly spaced between 0 and the sampling rate . All that remains is to understand the purpose and function of the summation over of the pointwise product of times each complex sinusoid. This can be interpreted as an inner product operation which computes the coefficient of projection of the signal onto the complex sinusoid . As such, , the DFT at frequency , is a measure of the amplitude and phase of the complex sinusoid which is present in the input signal at that frequency. This is the basic function of all linear transform summations (in discrete time) and integrals (in continuous time) and their kernels.

if we have to evaluate N point DFT, and if done in the obvious way clearly takes N^2 multiplications.

It is possible to calculate the DFT more efficiently than this, using the fast Fourier transform or FFT algorithm, which reduces the number of operations to O(NlogN).
 

nlulani

Junior Member level 3
Joined
Nov 29, 2004
Messages
26
Helped
2
Reputation
2
Reaction score
0
Trophy points
1,281
Activity points
313
flowchart for fastb ffourier transform

hi,

Hope the file attached here will help you to understand DFT and FFT more clearly.

thanks and regards,
 

    V

    points: 2
    Helpful Answer Positive Rating
Status
Not open for further replies.
Toggle Sidebar

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Top