Automatic derivation and implementation of fast convolution algorithms

DOI10.1016/J.JSC.2002.06.001MaRDI QIDQ597062zbMATH OpenOpenAlexFDO

Authors Jeremy R. Johnson, Anthony F. Breitzman

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

Convolution algorithmsCyclic convolution

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3994906
• Fast algorithms for computing one- and two-dimensional convolution in integer polynomial rings
• Number theoretic transforms for the calculation of convolutions
• scientific article; zbMATH DE number 44502
• scientific article; zbMATH DE number 4115952

Cites work

• A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures
• An in-place, in-order prime factor FFT algorithm
• scientific article; zbMATH DE number 4170851 (Why is no real title available?)
• scientific article; zbMATH DE number 3810918 (Why is no real title available?)
• scientific article; zbMATH DE number 3967873 (Why is no real title available?)
• scientific article; zbMATH DE number 4054986 (Why is no real title available?)
• scientific article; zbMATH DE number 3688713 (Why is no real title available?)
• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• scientific article; zbMATH DE number 52125 (Why is no real title available?)
• scientific article; zbMATH DE number 53687 (Why is no real title available?)
• scientific article; zbMATH DE number 194139 (Why is no real title available?)
• scientific article; zbMATH DE number 1111784 (Why is no real title available?)
• scientific article; zbMATH DE number 4115952 (Why is no real title available?)
• Implementation of a self-sorting in-place prime factor FFT algorithm
• Multilinear algebra and parallel programming
• New algorithms for digital convolution
• Some bilinear forms whose multiplicative complexity depends on the field of constants

Cited in

(10)

• On-line computation of convolutions
• Multithreaded implicitly dealiased convolutions
• A new tensor product formulation for Toom's convolution algorithm
• Fast Convolution Method and Its Application in Mask Optimization for Intensity Calculation Using Basis Expansion
• scientific article; zbMATH DE number 3994906 (Why is no real title available?)
• scientific article; zbMATH DE number 4115952 (Why is no real title available?)
• Automatic derivation and implementation of signal processing algorithms
• Derivation and analysis of fast bilinear algorithms for convolution
• Two optimum algorithms for short convolutions
• On convolutions of algebraic curves

Describes a project that uses

Uses Software

• Maple
• FFTW
• SPIRAL

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q597062)