dsp-0.1: Haskell Digital Signal Processing
Contents
Index
Numeric.Transform.Fourier.FFTHard
Portability
portable
Stability
experimental
Maintainer
m.p.donadio@ieee.org
Description
Hard-coded FFT transforms
Synopsis
fft'2
:: (Ix a,
Integral
a,
RealFloat
b) => Array a (
Complex
b) -> Array a (
Complex
b)
fft'3
:: (Ix a,
Integral
a,
RealFloat
b) => Array a (
Complex
b) -> Array a (
Complex
b)
fft'4
:: (Ix a,
Integral
a,
RealFloat
b) => Array a (
Complex
b) -> Array a (
Complex
b)
Documentation
fft'2
:: (Ix a,
Integral
a,
RealFloat
b)
=> Array a (
Complex
b)
x[n]
-> Array a (
Complex
b)
X[k]
Length 2 FFT
fft'3
:: (Ix a,
Integral
a,
RealFloat
b)
=> Array a (
Complex
b)
x[n]
-> Array a (
Complex
b)
X[k]
Length 3 FFT
fft'4
:: (Ix a,
Integral
a,
RealFloat
b)
=> Array a (
Complex
b)
x[n]
-> Array a (
Complex
b)
X[k]
Length 4 FFT
Produced by
Haddock
version 0.8