@hackage accelerate-fft1.0.0.0

FFT using the Accelerate library

Categories
License
BSD-3-Clause
Maintainer
Trevor L. McDonell <tmcdonell@cse.unsw.edu.au>
Links
Versions
- 1.3.0.0 Fri, 28 Aug 2020
- 1.2.0.0 Tue, 30 Apr 2019
- 1.1.0.0 Thu, 21 Sep 2017
- 1.0.0.0 Fri, 18 Aug 2017
- 0.15.1.0 Wed, 22 Mar 2017
- 0.15.0.0 Mon, 15 Sep 2014

Rank-polymorphic discrete Fourier transform (DFT), computed with a fast Fourier transform (FFT) algorithm using the Accelerate library. Note that optimised implementations are available via foreign libraries, but must be explicitly enabled.

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

Installation
In your cabal file:
Tested Compilers
- 9.10.1
- 9.8.1
- 9.6.3
- 9.6.2
- 9.6.1
- 9.4.8
- 9.4.7
- 9.4.6
- 9.4.5
- 9.4.4
- 9.4.3
- 9.4.2
- 9.4.1
- 9.2.8
- 9.2.7
- 9.2.6
- 9.2.5
- 9.2.4
- 9.2.3
- 9.2.2
- 9.2.1
- 9.0.2
- 9.0.1
- 8.10.7
- 8.10.6
- 8.10.5
- 8.10.4
- 8.10.3
- 8.10.2
- 8.10.1
- 8.8.4
- 8.8.3
- 8.8.2
- 8.8.1
- 8.6.5
- 8.6.4
- 8.6.3
- 8.6.2
- 8.6.1
- 8.4.4
- 8.4.3
- 8.4.2
- 8.4.1
- 8.2.2
- 8.0.2
- 7.10.3
Dependencies (0)
Dependents (1)
@hackage/accelerate-examples

Package Flags

cuda

(off by default)

Use CUFFT-based implementation in the CUDA backend

llvm-ptx

(on by default)

Use CUFFT-based implementation in the LLVM.PTX backend

llvm-cpu

(on by default)

Use FFTW-based implementation in the LLVM.Native backend

@hackage accelerate-fft1.0.0.0

Categories

License

Maintainer

Links

Versions

Installation

Tested Compilers

Dependencies (0)

Dependents (1)

Package Flags