Haskell DSP LibrarySource codeParentContentsIndex
Numeric.Transform.Fourier.PFA
Portability portable
Stability experimental
Maintainer m.p.donadio@ieee.org
Description
Prime Factor Algorithm
Synopsis
fft_pfa :: (Ix a, Integral a, RealFloat b) => Array a (Complex b) -> a -> a -> (Array a (Complex b) -> Array a (Complex b)) -> Array a (Complex b)
Documentation
fft_pfa
:: (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
Produced by Haddock version 0.4