Automatic derivation and implementation of fast convolution algorithms

DOI10.1016/j.jsc.2002.06.001zbMath1074.68079OpenAlexW2061681121MaRDI QIDQ597062

Anthony F. Breitzman, Jeremy R. Johnson

Publication date: 6 August 2004

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2002.06.001

zbMATH Keywords

Cyclic convolutionConvolution algorithms

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (2)

Derivation and Analysis of Fast Bilinear Algorithms for Convolution ⋮ On convolutions of algebraic curves

Uses Software

• Maple
• SPIRAL
• FFTW

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures
• Implementation of a self-sorting in-place prime factor FFT algorithm
• Multilinear algebra and parallel programming
• An in-place, in-order prime factor FFT algorithm
• New algorithms for digital convolution
• Some bilinear forms whose multiplicative complexity depends on the field of constants

This page was built for publication: Automatic derivation and implementation of fast convolution algorithms