FLINT3.7.0-dev
/

_fft_small_mpn_mulmid_complex, _fft_small_mpn_sqrmid_complex

Synopsis#include <flint/fft_small.h>
int _fft_small_mpn_mulmid_complex(nn_ptr zr, nn_ptr zi, slong lo, slong hi, nn_srcptr ar, slong arn, int ar_sgn, nn_srcptr ai, slong ain, int ai_sgn, nn_srcptr br, slong brn, int br_sgn, nn_srcptr bi, slong bin, int bi_sgn)source
int _fft_small_mpn_sqrmid_complex(nn_ptr zr, nn_ptr zi, slong lo, slong hi, nn_srcptr ar, slong arn, int ar_sgn, nn_srcptr ai, slong ain, int ai_sgn)source

Write the limbs [lo,hi)[\mathit{lo}, \mathit{hi}) of the real and imaginary parts of the product, respectively the square, as two's complement windows of hi−lo\mathit{hi} - \mathit{lo} limbs. Each is within one unit of ⌊x/Blo⌋\lfloor x / B^{\mathit{lo}} \rfloor for the exact part xx, and exact (the residue modulo BhiB^{\mathit{hi}}) for lo=0\mathit{lo} = 0. Return 0 if no plan exists.

A part is given by a magnitude of the given length (0 for a zero part) and a sign bit (1 for negative). The window plan is used, with cyclic transforms when the window allows.

Cite this page

The FLINT team, “_fft_small_mpn_mulmid_complex, _fft_small_mpn_sqrmid_complex (fft_small.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fft_small/_fft_small_mpn_mulmid_complex.html (generated 2026-11-02).