References

• 1. 1)
     • Cooley, J.W., Tukey, J.W.: `An algorithm for machine calculation of complex Fourier series', Math. Comput., 1966, 19, p. 297-301
  2. • 1 onward links are available for this reference.
     • CrossRef
  3. 2)
     • Pollard, J.M.: `The fast Fourier transform in a finite field', Math. Comput., 1971, 25, p. 365-374
  4. • 1 onward links are available for this reference.
     • CrossRef
  5. 3)
     • Rader, C.M.: `Discrete convolution via Mersenne transforms', IEEE Trans., 1972, p. 1269-1273
  6. 4)
     • Agarwal, R.C., Burrus, C.S.: `Number theoretic transforms to implement fast digital convolution', Proc. IEEE, 1975, 63, p. 550-560
  7. • 1 onward links are available for this reference.
     • CrossRef
  8. 5)
     • Nussbaumer, H.J.: `Digital filtering using complex Mersenne transforms', IBM J. Res. & Der., 1976, 20, p. 498-504
  9. • 1 onward links are available for this reference.
     • CrossRef
  10. 6)
      • Nagell, T.: , Introduction to number theory, 1964, (Chelsea Publishing Co., New York), p. 68-131
  11. 7)
      • Winograd, S.: `The effect of the field of constants on the number ol multiplications', Proceedings of 16th symposium of Found. Comput. Science, 1975, p. 1–2
  12. 8)
      • Winograd, S.: `On computing the discrete Fourier transform', Proc. Nat. Acad. Sci. USA, 1976, 73, p. 1005-1006
  13. • 1 onward links are available for this reference.
      • CrossRef
  14. 9)
      • Agarwal, R.C., Burrus, C.S.: `Fast one-dimensional digital convolution by multidimensional techniques', IEEE Trans., 1974, p. 1-10