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]
Versions [RSS] [faq],,,,
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 GPL-3.0-only
Copyright Copyright (2013) Ian Ross
Author Ian Ross
Category Math
Home page
Source repo head: git clone
Uploaded by IanRoss at 2014-01-26T09:09:35Z
Distributions NixOS:
Executables profile-256
Downloads 3925 total (8 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Successful builds reported [all 1 reports]




Maintainer's Corner

For package maintainers and hackage trustees


Readme for arb-fft-

[back to package description]


Pure Haskell arbitrary length FFT library