Numeric.Transform.Fourier.PFA

Prime Factor Algorithm

Documentation

fft_pfa

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]

Prime Factor Algorithm doing row FFT's then column FFT's