poulpy-hal 0.6.0

A crate providing layouts and a trait-based hardware acceleration layer with open extension points, matching the API and types of spqlios-arithmetic.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19

/// Abstract precomputed table for the negacyclic (reim) FFT and its inverse.
///
/// Implementors hold precomputed twiddle factors for ring degree `m` and expose
/// in-place forward (`fft`) and inverse (`ifft`) transforms over a data slice of
/// length `2m` in the real/imaginary interleaved layout.
pub trait NegacyclicFFT<F> {
    fn m(&self) -> usize;
    fn fft(&self, data: &mut [F]);
    fn ifft(&self, data: &mut [F]);
}

/// Extension of [`NegacyclicFFT`] that also provides a constructor.
///
/// Separated from the base trait so that generic bounds can distinguish between
/// "needs a precomputed table" (`NegacyclicFFTNew`) and "just needs to call fft/ifft"
/// (`NegacyclicFFT`).
pub trait NegacyclicFFTNew<F>: NegacyclicFFT<F> + Sized {
    fn new(m: usize) -> Self;
}