clutchfft
Newbie level 2
- Joined
- Mar 2, 2013
- Messages
- 2
- Helped
- 0
- Reputation
- 0
- Reaction score
- 0
- Trophy points
- 1,281
- Activity points
- 1,295
I am trying to improve the speed of an FFT algorithm for processing a sonar
bottom echo return signal. I implemented FFT for N = 8192 nodes. An FFT
algorithm has NLogN performance however we're investigating improving the
performance of the algorithm. There's a paper called Fast Approximate
Fourier Transform via Wavelet Transform which proposes linear performance :
https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.3984
Is anyone familiar with this concept? I am trying to understand how it
exactly works and I'm not too familiar with wavelets. Is it running an FFT
algorithm but using Wavelets for computation?
Any help is appreciated? Thanks
bottom echo return signal. I implemented FFT for N = 8192 nodes. An FFT
algorithm has NLogN performance however we're investigating improving the
performance of the algorithm. There's a paper called Fast Approximate
Fourier Transform via Wavelet Transform which proposes linear performance :
https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.3984
Is anyone familiar with this concept? I am trying to understand how it
exactly works and I'm not too familiar with wavelets. Is it running an FFT
algorithm but using Wavelets for computation?
Any help is appreciated? Thanks