Multidimensional mapping techniques for convolution
暂无分享,去创建一个
[1] S. Winograd. Arithmetic complexity of computations , 1980 .
[2] Yechezkel Zalcstein,et al. A Note on Fast Cyclic Convolution , 1971, IEEE Transactions on Computers.
[3] C. S. Burrus,et al. Automating the design of prime length FFT programs , 1992, [Proceedings] 1992 IEEE International Symposium on Circuits and Systems.
[4] H. Nussbaumer,et al. Fast polynomial transform algorithms for digital convolution , 1980 .
[5] J. Cooley,et al. New algorithms for digital convolution , 1977 .
[6] J. Cooley,et al. New algorithms for digital convolution , 1977 .
[7] C. Burrus,et al. Fast one-dimensional digital convolution by multidimensional techniques , 1974 .
[8] H. Nussbaumer. Fast Fourier transform and convolution algorithms , 1981 .
[9] David King,et al. Knowledge-based FFT and convolution synthesis for any number of points , 1989 .