Crate p3_dft

This crate contains some DFT implementations.

Structs

DifButterfly

DitButterfly

NaiveDft

Radix2Bowers

The Bowers G FFT algorithm. See: “Improved Twiddle Access for Fast Fourier Transforms”

Radix2Dit

The DIT FFT algorithm.

Radix2DitParallel

A parallel FFT algorithm which divides a butterfly network’s layers into two halves.

TwiddleFreeButterfly

Butterfly with twiddle factor 1 (works in either DIT or DIF).

Traits

Butterfly

TwoAdicSubgroupDft

Functions

bit_reversed_zero_pad

Append zeros to the “end” of the given matrix, except that the matrix is in bit-reversed order, so in actuality we’re interleaving zero rows.

divide_by_height

Divide each coefficient of the given matrix by its height.