fft_small_plan_init_nmod_cyclic
Synopsis
#include <flint/fft_small.h>int fft_small_plan_init_nmod_cyclic(fft_small_plan_t P, mpn_ctx_t R, ulong depth, ulong zh, ulong len_bound, ulong prod_bits, nmod_t mod)sourceInitialises P for cyclic convolutions modulo x^N - 1, N = 2^d with d = depth \ge 4, writing the coefficients [0, z_h), where z_h \le N. len_bound and prod_bits are as for fft_small_plan_init_nmod; a full cyclic product accumulates up to N products. Returns 0 if more than eight primes would be needed.
Guides#
Cite this page
The FLINT team, “fft_small_plan_init_nmod_cyclic (fft_small.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fft_small/fft_small_plan_init_nmod_cyclic.html (generated 2026-10-20).
@misc{flint-doc-fft-small-fft-small-plan-init-nmod-cyclic,
author = {{The FLINT team}},
title = {{fft\_small\_plan\_init\_nmod\_cyclic (fft\_small.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fft_small/fft_small_plan_init_nmod_cyclic.html},
note = {Generated 2026-10-20}
}