dsp-0.2.1: Haskell Digital Signal Processing

Portabilityportable
Stabilityexperimental
Maintainerm.p.donadio@ieee.org

Numeric.Transform.Fourier.Rader

Description

Rader's Algorithm for computing prime length FFT's

Synopsis

Documentation

fft_rader1Source

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_rader2Source

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