Struct Radix2Dit 

pub struct Radix2Dit<F: TwoAdicField> { /* private fields */ }

The DIT FFT algorithm.

Trait Implementations

impl<F: Clone + TwoAdicField> Clone for Radix2Dit<F>

fn clone(&self) -> Radix2Dit<F>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<F: Debug + TwoAdicField> Debug for Radix2Dit<F>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<F: Default + TwoAdicField> Default for Radix2Dit<F>

fn default() -> Radix2Dit<F>

Returns the “default value” for a type.

impl<F: TwoAdicField> TwoAdicSubgroupDft<F> for Radix2Dit<F>

type Evaluations = DenseMatrix<F>

fn dft_batch(&self, mat: RowMajorMatrix<F>) -> RowMajorMatrix<F>

Compute the discrete Fourier transform (DFT) of each column in mat. This is the only method an implementer needs to define, all other methods can be derived from this one.

fn dft(&self, vec: Vec<F>) -> Vec<F>

Compute the discrete Fourier transform (DFT) vec.

fn coset_dft(&self, vec: Vec<F>, shift: F) -> Vec<F>

Compute the “coset DFT” of vec. This can be viewed as interpolation onto a coset of a multiplicative subgroup, rather than the subgroup itself.

fn coset_dft_batch(&self, mat: RowMajorMatrix<F>, shift: F) -> Self::Evaluations

Compute the “coset DFT” of each column in mat. This can be viewed as interpolation onto a coset of a multiplicative subgroup, rather than the subgroup itself.

fn idft(&self, vec: Vec<F>) -> Vec<F>

Compute the inverse DFT of vec.

fn idft_batch(&self, mat: RowMajorMatrix<F>) -> RowMajorMatrix<F>

Compute the inverse DFT of each column in mat.

fn coset_idft(&self, vec: Vec<F>, shift: F) -> Vec<F>

Compute the “coset iDFT” of vec. This can be viewed as an inverse operation of “coset DFT”, that interpolates over a coset of a multiplicative subgroup, rather than subgroup itself.

fn coset_idft_batch( &self, mat: RowMajorMatrix<F>, shift: F, ) -> RowMajorMatrix<F>

Compute the “coset iDFT” of each column in mat. This can be viewed as an inverse operation of “coset DFT”, that interpolates over a coset of a multiplicative subgroup, rather than the subgroup itself.

fn lde(&self, vec: Vec<F>, added_bits: usize) -> Vec<F>

Compute the low-degree extension of vec onto a larger subgroup.

fn lde_batch( &self, mat: RowMajorMatrix<F>, added_bits: usize, ) -> Self::Evaluations

Compute the low-degree extension of each column in mat onto a larger subgroup.

fn coset_lde(&self, vec: Vec<F>, added_bits: usize, shift: F) -> Vec<F>

Compute the low-degree extension of each column in mat onto a coset of a larger subgroup.

fn coset_lde_batch( &self, mat: RowMajorMatrix<F>, added_bits: usize, shift: F, ) -> Self::Evaluations

Compute the low-degree extension of each column in mat onto a coset of a larger subgroup.