Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Fourier Transform #31

Open
GoogleCodeExporter opened this issue Mar 14, 2015 · 1 comment
Open

Fourier Transform #31

GoogleCodeExporter opened this issue Mar 14, 2015 · 1 comment

Comments

@GoogleCodeExporter
Copy link

I got impression(may be I am wrong) that in the QUEST we use "naive", written 
by hand Fourier transform.

If I am right, I it should be replaced by the Fast Fourier Transform. (There 
are number of libraries for fortran. For example http://www.netlib.org/fftpack/ 
or Intel MKL)

I believe that this is easy change in the code for someone who is comfortable 
with fortran.

Reasons for this are:
[1] Complexity of the algorithm will reduce from O(N^2) to O(N log N). In some 
cases it can give significant difference in the computation time.

[2] Number of lines in the QUEST code will go down. Less lines in QUEST => less 
bugs that we can have.

Original issue reported on code.google.com by iglovi...@gmail.com on 6 Mar 2014 at 8:20

@GoogleCodeExporter
Copy link
Author

Original comment by cxc639 on 8 Aug 2014 at 6:17

  • Added labels: Priority-Low
  • Removed labels: Priority-Medium

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant