 | dsp-0.1: Haskell Digital Signal Processing | Contents | Index |
| Numeric.Transform.Fourier.PFA |
|
| 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) |
| :: (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 | |