High-level interface to FFTW (Fast Fourier Transform) based on comfort-array
|LTS Haskell 20.24:||0.0.0.1|
|Stackage Nightly 2023-06-04:||0.0.0.1|
|Latest on Hackage:||0.0.0.1|
This version can be pinned in stack with:
Module documentation for 0.0.0.1
Depends on 6 packages(full list with versions):
FFTW claims to be the fastest Fourier Transform in the West.
This is a high-level interface to
We re-use the type classes from
Support of one (audio), two (image), three (video) dimensional data, as well as n-dimensional one.
Support for batched transformations e.g. for block-wise Fourier transform.
No normalization like in plain
fftw. This is because I see no universally best place to apply normalization.
The use of
comfort-array enables to use array shapes tailored
to Fourier transforms:
- for data where the
n-1-th element can also be accessed via index
- for complex data of a real-to-complex Fourier transform. It saves you from case distinction between even and odd data length and according mistakes.
- for real-to-real Sine and Cosine transforms. They assert that you will always use the appropriate kind for back transformation.
For rather simple examples
see the packages
See also package