dsp-0.2.4.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.Rader

Description

Rader's Algorithm for computing prime length FFT's

Synopsis

fft_rader1 :: (Ix a, Integral a, RealFloat b) => Array a (Complex b) -> a -> Array a (Complex b)
fft_rader2 :: (Ix a, Integral a, RealFloat b) => Array a (Complex b) -> a -> (Array a (Complex b) -> Array a (Complex b)) -> Array a (Complex b)

Documentation

fft_rader1 Source #

Arguments

:: (Ix a, Integral a, RealFloat b)
=> Array a (Complex b)	x[n]
-> a	N
-> Array a (Complex b)	X[k]

Rader's Algorithm using direct convolution

fft_rader2 Source #

Arguments

:: (Ix a, Integral a, RealFloat b)
=> Array a (Complex b)	x[n]
-> a	N
-> (Array a (Complex b) -> Array a (Complex b))	FFT function
-> Array a (Complex b)	X[k]

Rader's Algorithm using FFT convolution