Complex integer convolutions over a direct sum of Galois fields
- 1 November 1975
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 21 (6), 657-661
- https://doi.org/10.1109/tit.1975.1055471
Abstract
In this paper, the dynamic range of Fourier-like transforms over the Galois fieldGF(q^2), whereqis a Mersenne prime, is extended. It is shown that transforms over a direct sum of such Galois fields can be used to compute quite accurately discrete Fourier transforms of complex numbers without roundoff error.Keywords
This publication has 5 references indexed in Scilit:
- Number theoretic transforms to implement fast digital convolutionProceedings of the IEEE, 1975
- The use of finite fields to compute convolutionsIEEE Transactions on Information Theory, 1975
- Discrete Convolutions via Mersenne TransformsIEEE Transactions on Computers, 1972
- The Fast Fourier Transform in a Finite FieldMathematics of Computation, 1971
- Rings and IdealsCarus Mathematical Monographs, 1948