A Simplified Binary Arithmetic for the Fermat Number Transform

IEEE Transactions on Acoustics, Speech, and Signal Processing

Volumn 24, Issue 5, 1976, Pages 356-359

  Leibowitz, Lawrence M ^a  

^a NAVAL RESEARCH LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TRANSFORMATIONS;

EID: 0017010342     PISSN: 00963518     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASSP.1976.1162834     Document Type: Article

References (6)

1. J. M. Pollard, “The fast Fourier transform in a finite field,” Math. Comput., vol. 25, pp. 365-374, Apr. 1971.
2. C. M. Rader, “Discrete convolutions via Mersenne transforms,” IEEE Trans. Comput., vol. C-21, pp. 1269-1273, Dec. 1972.
3. R. C. Agarwal and C. S. Burrus, “Fast convolution using Fermat number transforms with applications to digital filtering,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-22, pp. 87-97, Apr. 1974.
4. C. M. Rader, “Convolution and correlation using number theoretic transforms,” in Theory and Application of Digital Signal Processing, L. R. Rabiner and B. Gold. Englewood Cliffs, NJ: Prentice-Hall, 1975, sect. 6.19.
5. J. W. Cooley and J. W. Tukey, “An algorithm for the machine calculation of complex Fourier series,” Math. Comput., vol. 19, pp. 297-301, Apr. 1965.
6. J. H. McClellan, “Hardware for the Fermat number transform,” Lincoln Laboratory, Mass. Inst. Technol., Lexington, Tech. Note ESD-TR-75-149, Apr. 1975.