arb-fft: Pure Haskell arbitrary length FFT library

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.

[maintain] [Publish]


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 log CHANGELOG.markdown
Dependencies arb-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]
License BSD-3-Clause
Copyright Copyright (2013) Ian Ross
Author Ian Ross
Category Math
Home page
Source repo head: git clone
Uploaded by IanRoss at 2014-02-01T09:48:20Z




Automatic Flags

Use LLVM build for better performance


Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Readme for arb-fft-

[back to package description]


Pure Haskell arbitrary length FFT library