dsp-0.2.2: Haskell Digital Signal Processing

Portabilityportable
Stabilityexperimental
Maintainerm.p.donadio@ieee.org
Safe HaskellSafe-Inferred

Numeric.Transform.Fourier.CT

Description

Cooley-Tukey algorithm for computing the FFT

Synopsis

Documentation

fft_ct1Source

Arguments

:: (Ix a, Integral a, RealFloat b) 
=> Array a (Complex b)

x[n]

-> a

nrows

-> a

ncols

-> (Array a (Complex b) -> Array a (Complex b))

FFT function

-> Array a (Complex b)

X[k]

Cooley-Tukey algorithm doing row FFT's then column FFT's

fft_ct2Source

Arguments

:: (Ix a, Integral a, RealFloat b) 
=> Array a (Complex b)

x[n]

-> a

nrows

-> a

ncols

-> (Array a (Complex b) -> Array a (Complex b))

fft function

-> Array a (Complex b)

X[k]

Cooley-Tukey algorithm doing column FFT's then row FFT's