Definition and Algorithm for Fast Fourier Transform

Question

2.00/5 (1 vote)

See more:

Can anyone explain me what is a Fast Fourier Transform?
Do you hav any algorithm for implementing it graphically?

Thanks in Advance..

Posted 26-Jan-13 23:20pm

Sharath 8536134

Updated 26-Jan-13 23:21pm

v2

Add a Solution

Comments

Ed Nutting 27-Jan-13 5:29am

Haha! Your really expect to get this answered in a "Quick Answer"? This topic has hundreds of long articles written about it! It's 2nd year degree level maths at least and to program it is just as hard. Aside from the FFT being hard to implement, implementing it "graphically" doesn't make much sense as a question given that it is a mathematical process to transform data from wave space to frequency space and back... This leads me to believe you don't really know much about what you are trying to do. I think you should read up on this a lot more (start with say, Wikipedia? At least the first few paragraphs?) before you try implementing anything.

If it's any consolation, I tried to do his a couple of years ago but gave up because 1) I was 14 so my maths was nothing like good enough and 2) It turned out there were loads of free bits of code already out there to do what I wanted. Perhaps you should try searching for some?

Ed

Andreas Gieriet 27-Jan-13 13:03pm

This is an ignorant and lazy question. See also solution #1. A simple search on Google gives you all the answers.
Andi
PS: Checking your other question on your profile shows that this is your general behavioural pattern. Please check Google before asking such useless questions here.

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

OriginalGriff · Answer 1 · 2013-01-26T23:29:00

Solution 1

Google is your friend: Be nice and visit him often. He can answer questions a lot more quickly than posting them here...

A very quick search gave:
Explanation: Wiki[^]
Implementation: How to implement the FFT algorithm[^] (Codeproject)

In future, please try to do at least basic research yourself, and not waste your time or ours.

Posted 26-Jan-13 23:29pm

OriginalGriff

Comments

Andreas Gieriet 27-Jan-13 13:01pm

That's the answer: use Google! Strange what people expect from CP...
The topic becomes interesting/challenging when it needs to be processed in real time on (limited) embedded systems... ;-)
My 5!
Andi