Generalized Fermat-Mersenne Number Theoretic Transform

IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing

Volumn 41, Issue 2, 1994, Pages 133-139

  Dimitrov, Vassil S ^a   Cooklev, Todor V ^b   Donevsky, Borislav D ^a  

^a TECHNICAL UNIVERSITY OF SOFIA   (Bulgaria)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DIFFERENTIAL EQUATIONS; DIGITAL ARITHMETIC; INVERSE PROBLEMS; NUMBER THEORY; SIGNAL PROCESSING; THEOREM PROVING;

COMPOSITE NUMBER; COMPUTATIONAL EFFICIENCY; DYNAMIC RANGE; FERMAT MERSENNE NUMBER THEORETIC TRANSFORMS; INTEGER SEQUENCES; TRANSFORM LENGTH;

Z TRANSFORMS;

EID: 0028375151     PISSN: 10577130     EISSN: None     Source Type: Journal    
DOI: 10.1109/82.281844     Document Type: Article

References (33)

1. J. M. Pollard, “The fast Fourier transform over finite fields,” Math. Comput., vol. 25, pp. 365–374, 1971.
2. C. M. Rader, “Discrete convolutions via Mersenne transform,” IEEE Trans. Computers, vol. C-21, 1269–1273, 1972.
3. R. C. Agarwal and C. S. Burrus, “Fast convolution using Fermat number transform with application to digital filtering,” IEEE Trans. Acoust. Speech, Signal Proc., vol. 22, 87–97. 1974.
4. W. Li and A. M. Peterson, “FIR filtering by the modified Fermat number transform,” IEEE Trans. Acoust. Speech, Signal Proc., vol. 38, pp. 1641–1645, 1990.
5. Y. C. Lee, B. K. Min, and M. Suk, “Realization of adaptive digital filtering using the Fermat number transform,” IEEE Trans. Acoust. Speech, Signal Proc., vol. ASSP-33, pp. 1036–1039, 1985.
6. J. B. Martens and M. C. Vanwormhondt, “Convolution of long integer sequences by means of number-theoretic transform over residue class polynomial ring.” IEEE Trans. Acoust. Speech, Signal Proc. vol. 31, pp. 1125–1134, 1983.
7. J. B. Martens and M. C. Vanwormhondt, “Convolution using a conjugate symmetry property for number theoretic transform over rings of regular integers.” IEEE Trans. Acoust. Speech, Signal Proc., vol. ASSP-31, 1121–1125, 1983.
8. J. B. Martens, “Two-dimensoinal convolutions by means of number theoretic transform over residue class polynomial ring.” IEEE Trans. Acoust. Speech, Signal Proc., vol. ASSP-32, 862–871, 1984.
9. J. B. Martens, “Number-theoretic transforms for the calculations of convolutions.” IEEE Trans. Acoust. Speech, Signal Proc., vol. ASSP-31, pp. 969–978, 1983.
10. A. E. Yagle, “Number-theoretic fast algorithms for bilinear and other generalized transforms,” IEEE Trans. Auto. Cont., vol. 35, pp. 1275–1276, 1990.
11. S. Boussakta and A. G. J. Holt, “Fast multidimensional discrete Hartley transform using Fermat number transform,” IEEE Proc., Pt. E, vol. 135, pp. 253–257, 1988.
12. I. S. Reed, T. K. Truong, and L. R. Welch, “The fast decoding of Reed-Solomon code using Fermat number theoretic transforms,” IEEE Trans. Info. Theory, vol. 24, pp. 497–499, 1978.
13. Y. W. Eastwood and C. R. Jasshope, “The solution of elliptic partial differential equations using number theoretic transforms with application to narrow of limited computer hardware,” Comput. Physics Comm., vol. 13, pp. 233–239, 1977.
14. J. M. Pollard, “Implementation of number theoretic transforms.” Electronics Letters, vol. 12, pp. 378–379, 1976.
15. K. Y. Liu, I. S. Reed, and T. K. Truong, “Fast number theoretic transforms for digital filtering,” Electronics Letters, vol. 12, pp. 644-646 1976.
16. E. Dubois and A. N. Venetsanopoulos. “Fast integer convolution using rings of algebraic integers,” IEEE Trans. Acoust. Speech, Signal Proc., vol. ASSP-28, pp. 169–175, 1980.
17. S. W. Golomb, I. S. Reed, and T. K. Truong, “Integer convolutions over the finite fields GF(3 + 2n+ 1),” SIAM J. Applied Math., vol. 32, pp. 356–365, 1977.
18. R. M. Robinson, “A report on primes of the form k-2n+1 and on factors of Fermat numbers.” Proc. Amer. Math. Soc., vol. 9, pp. 673–681, 1958.
19. S. W. Golomb, “Properties of the sequences 3. 2n +1,” Math. Comput., vol. 30, 657–663, 1976.
20. N. J. Nussbaumer, “Digital filtering using pseudo-Fermat number transforms,” IEEE Trans. Acoust. Speech, Signal Proc., vol. ASSP-26, pp. 79–83, 1977.
21. N. J. Nussbaumer, “Digital filtering using complex Mersenne transforms,” IBM J. Research Devel., vol. 20, pp. 498–504, 1976.
22. H. Lu and S. Lee, “A new approach to solve the sequence-length constraint problem in circular convolutions using number-theoretic transform,” IEEE Transactions on Signal Proc., vol. 39, pp. 1314–1321, 1991.
23. L. E. Dixon, History of the theory of numbers, vol. I, Washington, D.C.: Carnegie Institute, 1919, p. 376.
24. D. Y. Y. Yun and C. N. Zhang, “Binary paradigm and systolic array implementation for residue arithmetic,” Technical Report 84-CSE-21, Department of Computer Science and Engineering, Southern Methodist University, Dallas, Texas, 1984.
25. A. Karatsuba and Yu. Ofman, “Multiplication of multidigit numbers on automata,” Soviet Physics Dokl., vol. 7, pp. 595–596, 1963.
26. A. Schonhage and V. Strassen, “Fast multiplication of integers.” (in German), Computing, vol. 7, pp. 281–292, 1971.
27. L. M. Leibowitz, “A simplified binary arithmetic for the Fermat number transform,” IEEE Trans. Acoust. Speech, Signal Proc., vol. ASSP-24, pp. 356–359, 1976.
28. G. H. Hardy and E. M. Wright, An introduction to the theory of the numbers, London, Oxford University Press, 1968, ch. 5.
29. S. Winograd, “On computing the discrete Fourier transform,” Math. Comput., vol. 32, pp. 175–195, 1978.
30. R. Creutzburg and G. Steidl, “Number theoretic transforms in rings of cyclotomic integers,” J. Info. Proc. Cybernetics, vol. 11–12, pp. 573–584, 1988.
31. J. B. Martens, “Recursive cyclotomic factorization—a new algorithm for calculating the discrete Fourier transform,” IEEE Trans. Acoust. Speech, Signal Proc., vol. ASSP-32, pp. 750–760, 1984.
32. W. Singleton, “An algorithm for computing the mixed radix fast Fourier transform,” IEEE Trans. AU, vol. 17, 1969.
33. S. Ligh and P. Jones, “Generalized Fermat and Mersenne numbers,” Fibonacci Quarterly, vol. 20, pp. 12–16, 1982.