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.


Properties

Versions0.1.0.0, 0.2.0.0, 0.2.0.1, 0.2.0.2
Dependenciesarb-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)
LicenseBSD3
CopyrightCopyright (2013) Ian Ross
AuthorIan Ross
Maintainerian@skybluetrades.net
CategoryMath
Home pagehttps://github.com/ian-ross/arb-fft
Source repositoryhead: git clone https://github.com/ian-ross/arb-fft
Executablesprofile-256
UploadedSat Feb 1 09:55:48 UTC 2014 by IanRoss
Downloads426 total (27 in last 30 days)
StatusDocs available [build log]
Successful builds reported [all 1 reports]

Modules

[Index]

Flags

NameDescriptionDefault
llvmUse LLVM build for better performanceEnabled

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

Downloads

Maintainers' corner

For package maintainers and hackage trustees