New algorithms for convolution and DFT based on polynomial transforms
作者： H. Nussbaumer
DOI: 10.1109/ICASSP.1978.1170580
关键词: Discrete-time Fourier transform 、 Discrete Fourier transform 、 Polynomial 、 Discrete Hartley transform 、 Algorithm 、 Overlap–add method 、 Convolution 、 Mathematics 、 Discrete sine transform 、 Algebra 、 Fast Fourier transform
摘要: Discrete transforms, defined in rings of polynomials, have been introduced recently. These polynomial transforms the convolution property and can be computed ordinary arithmetic, without multiplications. We show that, by combining transform approach with a split nesting technique, multidimensional convolutions very efficiently general purpose computers. This computation method also used for evaluation one-dimensional discrete Fourier (DFT's).
sci-hub.se 参考文章(4)
S. Winograd, A new method for computing DFT international conference on acoustics, speech, and signal processing. ,vol. 2, pp. 366- 368 ,(1977) , 10.1109/ICASSP.1977.1170234
H. J. Nussbaumer, P. Quandalle, Computation of convolutions and discrete Fourier transforms by polynomial transforms Ibm Journal of Research and Development. ,vol. 22, pp. 134- 144 ,(1978) , 10.1147/RD.222.0134
H.J. Nussbaumer, Digital filtering using polynomial transforms Electronics Letters. ,vol. 13, pp. 386- 387 ,(1977) , 10.1049/EL:19770280
R. Agarwal, J. Cooley, New algorithms for digital convolution international conference on acoustics, speech, and signal processing. ,vol. 2, pp. 360- 362 ,(1977) , 10.1109/ICASSP.1977.1170246