accelerate-fft: FFT using the Accelerate library

[ accelerate, bsd3, library, math ] [ Propose Tags ]

Rank-polymorphic discrete Fourier transform (DFT), computed with a fast Fourier transform (FFT) algorithm using the Accelerate library

Refer to the main Accelerate package for more information: http://hackage.haskell.org/package/accelerate

Flags

Automatic Flags
NameDescriptionDefault
cuda

Enable support for using CUFFT via the CUDA backend's FFI

Enabled

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

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 0.13.0.0, 0.14.0.0, 0.15.0.0, 0.15.1.0, 1.0.0.0, 1.1.0.0, 1.2.0.0, 1.3.0.0
Dependencies accelerate (>=0.13 && <0.14), accelerate-cuda (>=0.13 && <0.14), base (>=4 && <5), cuda (>=0.5 && <0.6), cufft (>=0.1 && <0.2) [details]
License BSD-3-Clause
Author Manuel M T Chakravarty, Gabriele Keller, Trevor L. McDonell
Maintainer Manuel M T Chakravarty <chak@cse.unsw.edu.au>
Category Compilers/Interpreters, Concurrency, Data, Parallelism
Home page https://github.com/AccelerateHS/accelerate-fft
Bug tracker https://github.com/AccelerateHS/accelerate/issues
Source repo head: git clone git://github.com/AccelerateHS/accelerate-fft.git
Uploaded by TrevorMcDonell at 2013-05-11T09:01:30Z
Distributions
Reverse Dependencies 2 direct, 0 indirect [details]
Downloads 7185 total (22 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user [build log]
All reported builds failed [all 1 reports]