The latest version of arb-fft is 0.3.0.0-0.

arb-fft

Version 0.2.0.0 revision 0 uploaded by IanRoss.

Package meta

Synopsis
Pure Haskell arbitrary length FFT library
Description

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.

Author
Ian Ross
Bug reports
n/a
Category
Math
Copyright
Copyright (2013) Ian Ross
Homepage
https://github.com/ian-ross/arb-fft
Maintainer
ian@skybluetrades.net
Package URL
n/a
Stability
n/a

Components