fft ( seq -- seq' )

Vocabulary

math.transforms.fft

Inputs

seq	a sequence

Outputs

seq'	a sequence

Word description

Computes the forward discrete Fourier transform of a nonempty sequence of real or complex numbers. The input is not modified. Even lengths are split recursively using a radix-2 FFT; odd subproblems use a direct DFT. Power-of-two lengths take O(N log N) work, while odd lengths take O(N²) work.

Definition

USING: math.transforms.fft.private sequences ;

IN: math.transforms.fft

: fft ( seq -- seq' ) [ not-enough-data ] [ f (fft) ] if-empty ;