Module lambdaworks_math::fft::cpu::ops

source ·

Functions§

  • fft
    Executes Fast Fourier Transform over elements of a two-adic finite field E and domain in a subfield F. Usually used for fast polynomial evaluation.