dsp-0.2.5.1: Haskell Digital Signal Processing

Copyright	(c) Matthew Donadio 2003
License	GPL
Maintainer	m.p.donadio@ieee.org
Stability	experimental
Portability	portable
Safe Haskell	Safe
Language	Haskell98

Numeric.Transform.Fourier.PFA

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 Source #

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