Parameter Determination for Complex Number-Theoretic Transforms Using Cyclotomic Polynomials

DOI10.2307/2008663zbMath0675.94002OpenAlexW4245749764MaRDI QIDQ3830938

Reiner Creutzburg, Manfred Tasche

Publication date: 1989

Full work available at URL: https://doi.org/10.2307/2008663

zbMATH Keywords

discrete Fourier transformcyclotomic polynomialsGaussian integerscyclic convolutioncomplex number theoretic transformprimitive roots modulo a Mersenne prime

Mathematics Subject Classification ID

General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Polynomials (irreducibility, etc.) (11R09) Application of orthogonal and other special functions (94A11) Algebraic numbers; rings of algebraic integers (11R04)

Related Items

Even faster integer multiplication, Discrete Weighted Transforms and Large-Integer Arithmetic

Cites Work

• Prime factorization for values of cyclotomic polynomials in \({\mathbb Z}[i\)]
• Fast Fourier transform and convolution algorithms
• Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
• The generalized discrete Fourier transform in rings of algebraic integers
• Number-Theoretic Transforms of Prescribed Length
• A new algorithm for computing primitive elements in the field of Gaussian complex integers modulo a Mersenne prime
• Relative evaluation of various number theoretic transforms for digital filtering applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item