Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronics 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.

What is the fast Fourier transform (FFT)?

Status
Not open for further replies.

sudarshan_onkar

Junior Member level 1
Joined
Sep 3, 2006
Messages
15
Helped
2
Reputation
4
Reaction score
0
Trophy points
1,281
Activity points
1,359
Re: WHAT IS FFT

FFT is an algorithm which computes DFT very fast by utilizing properties of Nth roots of unity.

But please be specific on what really u want to in FFT .
 

vandelay

Advanced Member level 4
Joined
Aug 16, 2007
Messages
119
Helped
6
Reputation
12
Reaction score
4
Trophy points
1,298
Location
Norway
Activity points
2,351
Re: WHAT IS FFT

Wikipedia said:
A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. FFTs are of great importance to a wide variety of applications, from digital signal processing and solving partial differential equations to algorithms for quick multiplication of large integers.

You can read up on the article on Wikipedia.
 

andre_teprom

Super Moderator
Staff member
Joined
Nov 7, 2006
Messages
9,253
Helped
1,151
Reputation
2,321
Reaction score
1,133
Trophy points
1,403
Location
Brazil
Activity points
53,875
Re: WHAT IS FFT

Summarizing :

The major goal of DFT against FFT is that it reduces the order of matrix calculus in minor order matrices, reducing allmost exponentially processing time needed.


+++
 

rakesh_vnit

Member level 3
Joined
Sep 4, 2007
Messages
54
Helped
4
Reputation
8
Reaction score
1
Trophy points
1,288
Location
india
Activity points
1,714
Re: WHAT IS FFT

FFT gives the same result as DFT....
but FFT does the same work in N *log N iterations where as if u try t implement the DFT in the same way u would end up with N^2 iterations....

this is all that i can tell u for ur questions....if u can tell me wat exactly u want, i can help u further...
 

viralv11

Newbie level 3
Joined
Aug 31, 2007
Messages
4
Helped
0
Reputation
0
Reaction score
0
Trophy points
1,281
Activity points
1,295
Re: WHAT IS FFT

FFT is an algorithm for computing DFT n is "fast fourier transform".
It can be understood in detail frm book":eek:ppeinheim n schafer"
 

Status
Not open for further replies.

Similar threads

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Top