The arb-fft package

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.



This library provides a pure Haskell complex-to-complex Fast Fourier Transform implementation for arbitrary length input vectors, using a mixed-radix decimation-in-time algorithm with specialised straight-line code for a range of base transform sizes, Rader's algorithm for prime length base transforms, and an empirical optimisation scheme to select a good problem decomposition.

This package is probably primarily of pedagogical interest (FFTW is about five times faster for most input sizes). There is a long series of blog articles describing the development of the package, indexed at

[Skip to ReadMe]


Change logNone available
Dependenciesarb-fft, base (>=4.6 && <5), containers (>= && <0.6), criterion (>= && <0.9), directory (>= && <1.3), filepath (>= && <1.4), primitive (>= && <0.6), transformers (>= && <0.4), vector (>= && <0.11) [details]
CopyrightCopyright (2013) Ian Ross
AuthorIan Ross
Home page
Source repositoryhead: git clone
UploadedSun Jan 26 09:08:37 UTC 2014 by IanRoss




Maintainers' corner

For package maintainers and hackage trustees

Readme for arb-fft-


Pure Haskell arbitrary length FFT library