New Algorithms for Digital Convolution

IEEE Transactions on Acoustics, Speech, and Signal Processing

Volumn 25, Issue 5, 1977, Pages 392-410

  Agarwal, Ramesh C ^a   Cooley, James W ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; FOURIER TRANSFORMATION; IMAGE PROCESSING; METHODOLOGY; THEORETICAL STUDY;

COMPUTER METATHEORY;

DIGITAL CONVOLUTION;

MATHEMATICAL TECHNIQUES;

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

References (19)

1. R. C. Agarwal and C. S. Burrus, “Fast one-dimensional digital convolution by multidimensional techniques,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-22, pp. 1-10, Feb. 1974.
2. 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–99, Apr. 1974.
3. R. C. Agarwal and C. S. Burrus, “Number theoretic transforms to implement fast digital convolution,” Proc. IEEE, vol. 63, pp. 550–560, Apr. 1975.
4. G. D. Bergland, “A fast Fourier transform algorithm using base 8 iterations,” Math. Comput., vol. 22, pp. 275–279, Apr. 1968.
5. J. W. Cooley, P. A. W. Lewis, and P. D. Welch, “Historical notes on the fast Fourier transform,” IEEE Trans. Audio Electro acoust., vol. AU-15, pp. 76–79, June 1967.
6. J. W. Cooley, P. A. W. Lewis, and P. D. Welch, “The fast Fourier transform: Programming considerations in the calculation of sine, cosine and Laplace transforms,” J. Sound vib., vol, 22, pp. 315–337, July 1970.
7. I. J. Good, “The interaction algorithm and practical Fourier analysis,” J. Royal Statist. Soc., ser. B. vol. 20, pp. 361–372, 1958; addendum, vol. 22, 1960, pp. 372–375, (MR 21 1674; MR 23 A4231).
8. J. H. Griesmer, R. D. Jenks, and D. Y. Y. Yun, “SCRATCHPAD user's manual,” IBM Res. Rep. RA 70, IBM Watson Res. Cen., Yorktown Heights, NY, June 1975; and SCRATCHPAD Technical Newsletter No.1, Nov. 15, 1975.
9. D. E. Knuth, “Seminumerical algorithms,” in The Art of Computer Programming, vol. 2. Reading, MA: Addision-Wesley, 1971.
10. T. Nagell, Introduction to Number Theory. New York: Wiley, 1951.
11. P. J. Nicholson, “Algebraic theory of finite Fourier transforms,” J. Comput. Syst. Sci., vol. 5, pp. 524–527, Oct. 1971.
12. J. M. Pollard, “The fast Fourier transform in a finite field,” Math. Comput., vol, 25, no. 114, pp. 365–374, Apr. 1971.
13. C. M. Rader, “Discrete convolutions via Mersenne transforms,” IEEE Trans. Comput., vol, C-21, pp. 1269–1273, Dec. 1972.
14. I. S. Reed and T. K. Truong, “The use of finite fields to compute convolutions,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 208–213, Mar. 1975.
15. I. S. Reed and T. K. Truong, “Complex integer convolutions over a direct sum of Galois fields,” ‘IEEE Trans. Inform. Theory, vol. IT-21, pp. 657–661, Nov. 1975.
16. R. C. Singleton, “An algorithm for computing the mixed radix fast Fourier transform,” IEEE Trans. Audio Electroacoust., vol. AU-17, pp. 93–103, June 1969.
17. L. H. Thomas, “Using a computer to solve problems in physics,” in Applications of Digital Computers. Boston, MA: Ginn and Co., 1963.
18. S. Winograd, “Some bilinear forms whose multiplicative complexity depends on the field of constants,” IBM Res. Rep. RC 5669, IBM Watson Research Cen., Yorktown Heights, NY, Oct. 10, 1975.
19. S. Winograd, “On computing the discrete Fourier transform,” Proc. Nat. Acad. Sci. USA, vol, 73, no. 4, pp. 1005–1006, Apr. 1976.