SDR.FFT

Fast FFTs using FFTW

Windows

fftFixup

Arguments

:: (Vector v n, Num n)

=> Int

The length of the Vector

-> v n

Compute a vector of alternating 1s and 0s of the given size.

hamming

Arguments

:: (Floating n, Vector v n)

=> Int

The length of the window

-> v n

Compute a Hamming window.

hanning

Arguments

:: (Floating n, Vector v n)

=> Int

The length of the window

-> v n

Compute a Hanning window.

blackman

Arguments

:: (Floating n, Vector v n)

=> Int

The length of the window

-> v n

Compute a Blackman window.

FFTs

fftw

Arguments

:: Vector v (Complex CDouble)

=> Int

The size of the input and output buffers

-> IO (Pipe (v (Complex CDouble)) (Vector (Complex CDouble)) IO ())

Creates a Pipe that performs a complex to complex DFT.

fftwReal

Arguments

:: Vector v CDouble

=> Int

The size of the input Vector

-> IO (Pipe (v CDouble) (Vector (Complex CDouble)) IO ())

Creates a pipe that performs a real to complex DFT.

fftwParallel

Arguments

:: Vector v (Complex CDouble)

=> Int

The number of threads to use

-> Int

The size of the input Vector

-> IO (Pipe (v (Complex CDouble)) (Vector (Complex CDouble)) IO ())

Creates a pipe that uses multiple threads to perform complex to complex DFTs in a pipelined fashion. Each time a buffer is consumed, it is given to a pool of threads to perform the DFT. Then, if a thread has finished performing a previous DFT, the result is yielded.