论文信息 - Implementation of Multiplication, Modulo a Prime Number, with Applications to Number Theoretic Transforms

Implementation of Multiplication, Modulo a Prime Number, with Applications to Number Theoretic Transforms

This paper discusses a technique for multiplying numbers, modulo a prime number, using look-up tables stored in read-only memories. The application is in the computation of number theoretic transforms implemented in a ring which is isomorphic to a direct sum of several Galois fields, parallel computations being performed in each field.

Graham A. Jullien | G. Jullien

[1] Graham A. Jullien,et al. Application of the residue number system to computer processing of digital signals , 1978, 1978 IEEE 4th Symposium onomputer Arithmetic (ARITH).

[2] C. Burrus,et al. Fast Convolution using fermat number transforms with applications to digital filtering , 1974 .

[3] Irene A. Stegun,et al. Handbook of Mathematical Functions. , 1966 .

[4] Richard I. Tanaka,et al. Residue arithmetic and its applications to computer technology , 1967 .

[5] Graham A. Jullien,et al. Residue Number Scaling and Other Operations Using ROM Arrays , 1978, IEEE Transactions on Computers.

[6] Trieu-Kien Truong,et al. The use of finite fields to compute convolutions , 1975, IEEE Trans. Inf. Theory.

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

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

[9] Anastasios N. Venetsanopoulos,et al. The Discrete Fourier Transform Over Finite Rings with Application to Fast Convolution , 1978, IEEE Transactions on Computers.

[10] Milton Abramowitz,et al. Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables , 1964 .