New algorithms for digital convolution

DOI10.1109/TASSP.1977.1162981zbMath0413.65087MaRDI QIDQ3048190

James W. Cooley, Ramesh C. Agarwal

Publication date: 1977

Published in: IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)

zbMATH Keywords

fast Fourier transformcyclic convolutionnumber-theoretic transforms

Mathematics Subject Classification ID

Trigonometric approximation (42A10) Congruences; primitive roots; residue systems (11A07) Convolution, factorization for one variable harmonic analysis (42A85) Numerical methods for trigonometric approximation and interpolation (65T40)

Related Items (14)

Matrix decompositions using displacement rank and classes of commutative matrix algebras ⋮ Polynomial Multiplication over Finite Fields in Time \( O(n \log n \) ⋮ Automatic derivation and implementation of fast convolution algorithms ⋮ Index transforms for multidimensional DFT's and convolutions ⋮ Matrix displacement decompositions and applications to Toeplitz linear systems ⋮ Integer multiplication in time \(O(n\log n)\) ⋮ Fast computation of convolution operations via low-rank approximation ⋮ Derivation and Analysis of Fast Bilinear Algorithms for Convolution ⋮ Realization of discrete Fourier transforms using a nesting algorithm ⋮ Faster polynomial multiplication over finite fields using cyclotomic coefficient rings ⋮ Numerical Fourier and Bessel transforms in logarithmic variables ⋮ Multiplicative complexity of bilinear algorithms for cyclic convolution over finite fields ⋮ Unnamed Item ⋮ Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\)

This page was built for publication: New algorithms for digital convolution