Two-Dimensional Convolution and DFT Computation
暂无分享，去创建一个
[1] Henri J. Nussbaumer,et al. Computation of Convolutions and Discrete Fourier Transforms by Polynomial Transforms , 1978, IBM J. Res. Dev..
[2] J. V. Armitage,et al. Introduction to Number Theory , 1966 .
[3] Henri J. Nussbaumer,et al. New algorithms for convolution and DFT based on polynomial transforms , 1978, ICASSP.
[4] H. J. Nussbaumer,et al. Digital filtering using polynomial transforms , 1977 .
[5] David J. Winter. The structure of fields , 1974 .
[6] C. Rader. Discrete Fourier transforms when the number of data samples is prime , 1968 .
[7] C. Burrus,et al. Number theoretic transforms to implement fast digital convolution , 1975 .
[8] J. Tukey,et al. An algorithm for the machine calculation of complex Fourier series , 1965 .
[9] J. Cooley,et al. New algorithms for digital convolution , 1977 .
[10] Charles M. Rader,et al. Digital processing of signals , 1983 .
[11] S. Winograd. On computing the Discrete Fourier Transform. , 1976, Proceedings of the National Academy of Sciences of the United States of America.