Numeric.Transform.Fourier.CT

Cooley-Tukey algorithm for computing the FFT

Documentation

fft_ct1

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_ct2

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