arb-fft: Pure Haskell arbitrary length FFT library

[ bsd3, library, math, program ] [ Propose Tags ]

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]


[Last Documentation]

  • Numeric
    • Numeric.FFT


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


Versions [RSS],,,,
Change log CHANGELOG.markdown
Dependencies arb-fft, base (>=4.6 && <5), containers (>= && <0.6), criterion (>=1.1 && <1.2), directory (>= && <1.3), filepath (>= && <1.5), primitive (>= && <0.7), transformers (>= && <0.5), vector (>= && <0.12) [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 2016-04-24T20:25:12Z
Reverse Dependencies 1 direct, 0 indirect [details]
Executables profile-256
Downloads 4299 total (13 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2016-10-26 [all 3 reports]

Readme for arb-fft-

[back to package description]


Pure Haskell arbitrary length FFT library