Re: Very large FFT
- From: Tom Dillon <tdillon@xxxxxxxxxxxxx>
- Date: 26 Apr 2007 22:18:03 -0700
Yes it is clear to me that this is the same Twiddle array that I previous
calculated that for increasing the speed of the FFT calc, but why is he
making it then again ?
It looks like
- FFT with twiddle
-Twiddle again (???)
- FFT with twiddle
-final answer
I noticed the same in a PhD thesis on radio astronomy in the appendix C
where the author made an extra Twiddle step. In the referenced
presentation from Dillon Engineering there was also this step.
What is the purpose of it? Is the 1D FFT calculated as 2D matrix really
that much different to the image processing 2D FFT ?
Without it you don't get a 1M FFT when you are done. It would be nice
not to have to do it, but if you don't do the extra twiddle multiply
you would have a 2D FFT 1k x 1k FFT and not a 1M FFT.
Tom
.
- Follow-Ups:
- Re: Very large FFT
- From: AdriaanB
- Re: Very large FFT
- References:
- Very large FFT
- From: AdriaanB
- Re: Very large FFT
- From: Rune Allnor
- Re: Very large FFT
- From: Marcel Müller
- Re: Very large FFT
- From: AdriaanB
- Re: Very large FFT
- From: glen herrmannsfeldt
- Re: Very large FFT
- From: AdriaanB
- Very large FFT
- Prev by Date: Re: Very large FFT
- Next by Date: Interpolation w/ cubic convolution kernel - boundary treatment?
- Previous by thread: Re: Very large FFT
- Next by thread: Re: Very large FFT
- Index(es):
Relevant Pages
|