Safe Haskell	None
Language	Haskell2010

Data.Primitive.Contiguous.FFT

Description

This module exposes functions for performing Fast Fourier Transform (FFT) and Inverse Fast Fourier Transform (IFFT) over Contiguous data structures.

Synopsis

fft :: forall arr. (Contiguous arr, Element arr (Complex Double)) => arr (Complex Double) -> arr (Complex Double)
ifft :: forall arr. (Contiguous arr, Element arr (Complex Double)) => arr (Complex Double) -> arr (Complex Double)

Documentation

fft :: forall arr. (Contiguous arr, Element arr (Complex Double)) => arr (Complex Double) -> arr (Complex Double) Source #

Radix-2 decimation-in-time fast Fourier Transform. The given array must have a length that is a power of two.

ifft :: forall arr. (Contiguous arr, Element arr (Complex Double)) => arr (Complex Double) -> arr (Complex Double) Source #

Inverse fast Fourier transform.

Key	Shortcut
s	Open this search box
esc	Close this search box
↓,ctrl + j	Move down in search results
↑,ctrl + k	Move up in search results
↵	Go to active search result