| Copyright | (c) Matthew Donadio 2003 |
|---|---|
| License | GPL |
| Maintainer | m.p.donadio@ieee.org |
| Stability | experimental |
| Portability | portable |
| Safe Haskell | Safe |
| Language | Haskell98 |
Numeric.Transform.Fourier.FFT
Description
FFT driver functions
- fft :: (Ix a, Integral a, RealFloat b) => Array a (Complex b) -> Array a (Complex b)
- ifft :: (Ix a, Integral a, RealFloat b) => Array a (Complex b) -> Array a (Complex b)
- rfft :: (Ix a, Integral a, RealFloat b) => Array a b -> Array a (Complex b)
- irfft :: (Ix a, Integral a, RealFloat b) => Array a (Complex b) -> Array a b
- r2fft :: (Ix a, Integral a, RealFloat b) => Array a b -> Array a b -> (Array a (Complex b), Array a (Complex b))
Documentation
This is the driver routine for calculating FFT's. All of the
recursion in the various algorithms are defined in terms of fft.
Inverse FFT, including scaling factor, defined in terms of fft
This is the algorithm for computing 2N-point real FFT with an N-point
complex FFT, defined in terms of fft
This is the algorithm for computing a 2N-point real inverse FFT with an
N-point complex FFT, defined in terms of ifft