Implementation of Multiplication, Modulo a Prime Number, with Applications to Number Theoretic Transforms
- 1 October 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-29 (10), 899-905
- https://doi.org/10.1109/tc.1980.1675473
Abstract
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.Keywords
This publication has 7 references indexed in Scilit:
- Application of the residue number system to computer processing of digital signalsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- The Discrete Fourier Transform Over Finite Rings with Application to Fast ConvolutionIEEE Transactions on Computers, 1978
- Residue Number Scaling and Other Operations Using ROM ArraysIEEE Transactions on Computers, 1978
- The use of finite fields to compute convolutionsIEEE Transactions on Information Theory, 1975
- Fast Convolution using fermat number transforms with applications to digital filteringIEEE Transactions on Acoustics, Speech, and Signal Processing, 1974
- Algebraic theory of finite fourier transformsJournal of Computer and System Sciences, 1971
- The Fast Fourier Transform in a Finite FieldMathematics of Computation, 1971