# The arb-fft package

- '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.1.0.0, 0.2.0.0, 0.2.0.1, 0.2.0.2 |
---|---|

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 | GPL-3 |

Copyright | Copyright (2013) Ian Ross |

Author | Ian Ross |

Maintainer | ian@skybluetrades.net |

Category | Math |

Home page | https://github.com/ian-ross/arb-fft |

Source repository | head: git clone https://github.com/ian-ross/arb-fft |

Executables | profile-256 |

Uploaded | Sun Jan 26 09:08:37 UTC 2014 by IanRoss |

## Modules

*Numeric*

[Index]

## Downloads

- arb-fft-0.1.0.0.tar.gz [browse] (Cabal source package)
- Package description (included in the package)

#### Maintainers' corner

For package maintainers and hackage trustees