• We’re currently investigating an issue related to the forum theme and styling that is impacting page layout and visual formatting. The problem has been identified, and we are actively working on a resolution. There is no impact to user data or functionality, this is strictly a front-end display issue. We’ll post an update once the fix has been deployed. Thanks for your patience while we get this sorted.

Fast Fourier Transform

Originally posted by: Matthias99
Please learn to search.

The 'regular' one would be a 'Discrete Fourier Transform'. Generally when you come up with something you don't name it "Slow", at least until you realize there's actually a faster way to do it. 😛
Click to expand...

By "slow" I meant "slower." I thought that was given.

Anyway, sorry to waste your time.
 
Google for FFTW..."Fastest Fourier Transform [in the] West" lol

It was developed by Frigo & Johnson at MIT...I've met the latter.

Now that's a fast fourier transform 😉

Edit: but really, unless you're going to delve deep into how these advanced algorithms work, the basic cooley-tukey (sp) algorithm is a good baseline to read & understand. Anything more than that is really overkill...because well, you're not going to write something faster than say FFTW anytime soon 😛
 
You must log in or register to reply here.

TRENDING THREADS

Back
Top