New algorithms for digital convolution

作者: R. Agarwal , J. Cooley

DOI: 10.1109/TASSP.1977.1162981

关键词:

摘要: … convolution to a multi-dimensional convolution which is cyclic in all dimensions. Then, special algorithms are developed which, compute the relatively short convolutions in … convolutions …

参考文章(14)
R. Agarwal, C. Burrus, Fast one-dimensional digital convolution by multidimensional techniques IEEE Transactions on Acoustics, Speech, and Signal Processing. ,vol. 22, pp. 1- 10 ,(1974) , 10.1109/TASSP.1974.1162532
C.M. Rader, Discrete Convolutions via Mersenne Transrorms IEEE Transactions on Computers. ,vol. C-21, pp. 1269- 1273 ,(1972) , 10.1109/T-C.1972.223497
Peter J. Nicholson, Algebraic theory of finite fourier transforms Journal of Computer and System Sciences. ,vol. 5, pp. 524- 547 ,(1971) , 10.1016/S0022-0000(71)80014-4
J.W. Cooley, P.A.W. Lewis, P.D. Welch, The fast Fourier transform algorithm: Programming considerations in the calculation of sine, cosine and Laplace transforms☆ Journal of Sound and Vibration. ,vol. 12, pp. 315- 337 ,(1970) , 10.1016/0022-460X(70)90075-1
S. Winograd, On computing the Discrete Fourier Transform. Proceedings of the National Academy of Sciences of the United States of America. ,vol. 73, pp. 1005- 1006 ,(1976) , 10.1073/PNAS.73.4.1005
J. M. Pollard, The fast Fourier transform in a finite field Mathematics of Computation. ,vol. 25, pp. 365- 374 ,(1971) , 10.1090/S0025-5718-1971-0301966-0
R. Singleton, An algorithm for computing the mixed radix fast Fourier transform IEEE Transactions on Audio and Electroacoustics. ,vol. 17, pp. 93- 103 ,(1969) , 10.1109/TAU.1969.1162042
R.C. Agarwal, C.S. Burrus, Number theoretic transforms to implement fast digital convolution Proceedings of the IEEE. ,vol. 63, pp. 550- 560 ,(1975) , 10.1109/PROC.1975.9791
R. Agarwal, C. Burrus, Fast Convolution using fermat number transforms with applications to digital filtering IEEE Transactions on Acoustics, Speech, and Signal Processing. ,vol. 22, pp. 87- 97 ,(1974) , 10.1109/TASSP.1974.1162555
G. D. Bergland, A fast Fourier transform algorithm using base 8 iterations Mathematics of Computation. ,vol. 22, pp. 275- 279 ,(1968) , 10.1090/S0025-5718-1968-0226899-X