The arb-fft package

[Tags:bsd3, library, program]

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 http://www.skybluetrades.net/haskell-fft-index.html.


[Skip to Readme]

Properties

Versions 0.1.0.0, 0.2.0.0, 0.2.0.1, 0.2.0.2, 0.3.0.0
Change log CHANGELOG.markdown
Dependencies arb-fft, base (>=4.6 && <5), containers (>=0.5.0.0 && <0.6), criterion (==1.1.*), directory (>=1.2.0.1 && <1.3), filepath (>=1.3.0.1 && <1.5), primitive (>=0.5.1.0 && <0.7), transformers (>=0.3.0.0 && <0.5), vector (>=0.10.9.1 && <0.12) [details]
License BSD3
Copyright Copyright (2013) Ian Ross
Author Ian Ross
Maintainer ian@skybluetrades.net
Stability Unknown
Category Math
Home page https://github.com/ian-ross/arb-fft
Source repository head: git clone https://github.com/ian-ross/arb-fft
Uploaded Sun Apr 24 20:25:12 UTC 2016 by IanRoss
Distributions
Downloads 945 total (12 in the last 30 days)
Votes
0 []
Status Docs pending
Build status unknown [no reports yet]

Modules

  • Numeric
    • Numeric.FFT

Flags

NameDescriptionDefaultType
llvmUse LLVM build for better performanceDisabledAutomatic

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

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Readme for arb-fft

Readme for arb-fft-0.3.0.0

arb-fft

Pure Haskell arbitrary length FFT library