论文信息 - Number-theoretic transforms of prescribed length

Number-theoretic transforms of prescribed length

A new constructive method for finding all convenient moduli m for a number-theoretic transform with given length N and given primitive Nth root of unity modulo m is presented. This method is based on the prime factorization of cyclotomic polynomials with integer-valued argument or on the primitive divisors of integers. Many known results can be obtained as simple corollaries.

Reiner Creutzburg | Manfred Tasche | M. Tasche | R. Creutzburg

[1] Reiner Creutzburg,et al. Number-theoretic transforms of prescribed length , 1986 .

[2] B. Rice. Some good fields and rings for computing number theoretic transforms , 1979 .

[3] Pierre Duhamel,et al. Number-theoretic transforms with 2 as a root of unity , 1982 .

[4] H. Nussbaumer. Relative evaluation of various number theoretic transforms for digital filtering applications , 1978 .

[5] Gabriele Steidl,et al. Number-theoretic Transforms in Rings of Cyclotomic Integers , 1988, J. Inf. Process. Cybern..

[6] C. Burrus,et al. Number theoretic transforms to implement fast digital convolution , 1975 .

[7] I. S. Reed,et al. Integer Convolutions over the Finite Field $GF( {3 \cdot 2^n + 1} )$ , 1977 .

[8] Peter J. Nicholson,et al. Algebraic Theory of Finite Fourier Transforms , 1971, Journal of computer and system sciences (Print).

[9] H. Nussbaumer. Fast Fourier transform and convolution algorithms , 1981 .

[10] J. Pollard,et al. The fast Fourier transform in a finite field , 1971 .