[Home] Module Microsoft.FSharp.Math.Primitives.FFT


FFT multiplication used by BigNat. Implements polynomial multiplication provided the coefficients of the result (and hence of the arguments too) fit inside Fp.

Type Definitions

TypeDescription
type fp fp is type for the finite field. Currently using p = 2^27.15+1 but do not rely on that. Also, do not rely on fp being represented as uint32. Note: an abbreviation for uint32

Values

ValueDescription
val computeFftPaddedPolynomialProduct :
  int -> int -> fp array -> fp array -> fp array
val computeFftPolynomialProduct :
  int -> int array -> int -> int array -> int array
val fp_of_int : int -> fp
val int_of_fp : fp -> int
val max_bits_inside_fp : int
"2^max_bits_inside_fp - 1" fits inside fp
val max_fp : fp
Maximum value in Fp is p-1.
val mone : fp
val mzero : fp

See Also

Microsoft.FSharp.Math.Primitives


Documentation for assembly FSharp.Core, version 1.9.4.19, generated using F# version 1.9.4.19