Saturday, 13 October 2007

Implementing the FFT in OCaml

The OCaml Journal just published an article describing a simple but efficient implementation of the Fast Fourier Transform:

"Writing an implementation of the Fourier transform is an excellent lesson in algorithm design and optimization. Moreover, the Fourier transform is one of the most essential tools in numerical computing, with applications ranging from spectral analysis in science to the multiplication of large integers in mathematics. This article describes the design, implementation and optimization of a high-performance FFT implementation in OCaml..."

To read this article and more, subscribe to The OCaml Journal today!

No comments: