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]

Warnings:

'ghc-options: -O2' is rarely needed. Check that it is giving a real benefit and not just imposing longer compile times on your users.

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.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 (>=0.8.0.0 && <0.9), directory (>=1.2.0.1 && <1.3), filepath (>=1.3.0.1 && <1.4), primitive (>=0.5.1.0 && <0.6), transformers (>=0.3.0.0 && <0.4), vector (>=0.10.9.1 && <0.11) [details]
License	BSD-3-Clause
Copyright	Copyright (2013) Ian Ross
Author	Ian Ross
Maintainer	ian@skybluetrades.net
Category	Math
Home page	https://github.com/ian-ross/arb-fft
Source repo	head: git clone https://github.com/ian-ross/arb-fft
Uploaded	by IanRoss at 2014-02-01T09:48:20Z