Fast multiplication of n polynomials. More...
#include "fnft__fft_wrapper_plan_t.h"
Include dependency graph for fnft__poly_fmult.h:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Functions | |
| FNFT_UINT | fnft__poly_fmult_two_polys_len (const FNFT_UINT deg) |
| Length of the FFTs used by fnft__poly_fmult_two_polys. | |
| FNFT_INT | fnft__poly_fmult_two_polys (const FNFT_UINT deg, FNFT_COMPLEX const *const p1, FNFT_COMPLEX const *const p2, FNFT_COMPLEX *const result, fnft__fft_wrapper_plan_t plan_fwd, fnft__fft_wrapper_plan_t plan_inv, FNFT_COMPLEX *const buf0, FNFT_COMPLEX *const buf1, FNFT_COMPLEX *const buf2, const FNFT_UINT mode) |
| Multiplies two polynomials. | |
| FNFT_INT | fnft__poly_fmult_two_polys2x2 (const FNFT_UINT deg, FNFT_COMPLEX const *const p1_11, const FNFT_UINT p1_stride, FNFT_COMPLEX const *const p2_11, const FNFT_UINT p2_stride, FNFT_COMPLEX *const result_11, const FNFT_UINT result_stride, fnft__fft_wrapper_plan_t plan_fwd, fnft__fft_wrapper_plan_t plan_inv, FNFT_COMPLEX *const buf0, FNFT_COMPLEX *const buf1, FNFT_COMPLEX *const buf2, const FNFT_UINT mode_offset) |
| Multiplies two 2x2 matrices of polynomials. | |
| FNFT_INT | fnft__poly_fmult_two_polys3x3 (const FNFT_UINT deg, FNFT_COMPLEX const *const p1_11, const FNFT_UINT p1_stride, FNFT_COMPLEX const *const p2_11, const FNFT_UINT p2_stride, FNFT_COMPLEX *const result_11, const FNFT_UINT result_stride, fnft__fft_wrapper_plan_t plan_fwd, fnft__fft_wrapper_plan_t plan_inv, FNFT_COMPLEX *const buf0, FNFT_COMPLEX *const buf1, FNFT_COMPLEX *const buf2, const FNFT_UINT sufficient_space_flag) |
| Multiplies two 3x3 matrices of polynomials. | |
| FNFT_UINT | fnft__poly_fmult_numel (const FNFT_UINT deg, const FNFT_UINT n) |
| Number of elements that the input p to fnft__poly_fmult should have. | |
| FNFT_INT | fnft__poly_fmult (FNFT_UINT *const d, FNFT_UINT n, FNFT_COMPLEX *const p, FNFT_INT *const W_ptr) |
| Fast multiplication of multiple polynomials of same degree. | |
| FNFT_UINT | fnft__poly_fmult2x2_numel (const FNFT_UINT deg, const FNFT_UINT n) |
| Number of elements that the inputs p and result to fnft__poly_fmult2x2 should have. | |
| FNFT_UINT | fnft__poly_fmult3x3_numel (const FNFT_UINT deg, const FNFT_UINT n) |
| Number of elements that the inputs p and result to fnft__poly_fmult3x3 should have. | |
| FNFT_INT | fnft__poly_fmult2x2 (FNFT_UINT *d, FNFT_UINT n, FNFT_COMPLEX *const p, FNFT_COMPLEX *const result, FNFT_INT *const W_ptr) |
| Fast multiplication of multiple 2x2 matrix-valued polynomials of the same degree. | |
| FNFT_INT | fnft__poly_fmult3x3 (FNFT_UINT *d, FNFT_UINT n, FNFT_COMPLEX *const p, FNFT_COMPLEX *const result, FNFT_INT *const W_ptr) |
| Fast multiplication of multiple 3x3 matrix-valued polynomials of the same degree. | |
Detailed Description
Fast multiplication of n polynomials.
