scientific article; zbMATH DE number 123830

MaRDI QIDQ4025522zbMATH OpenFDO

Authors Pinneng Yu, Zeng-rong Jiang

Publication date 18 February 1993

zbMATH Keywords

FPT algorithmiteration algorithmfast polynomial transformfast number theoretic transformFNT algorithmhyperlarge scale 2-dimensional cyclic convolutions

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• An improved FPT algorithm for computing two-dimensional cyclic convolutions
• scientific article; zbMATH DE number 3980375
• An efficient algorithm for cyclic convolution based on fast-polynomial and fast-\(W\) transforms
• scientific article; zbMATH DE number 1174541
• scientific article; zbMATH DE number 7385986
• Fast 2D Convolutions and Cross-Correlations Using Scalable Architectures
• scientific article; zbMATH DE number 527497
• A new recursive algorithm for multidimensional convolution
• Improved fast polynomial transform algorithm for cyclic convolutions
• Two-dimensional FFT algorithms on hypercube and mesh machines

Cited in

(2)

• An improved FPT algorithm for computing two-dimensional cyclic convolutions
• Improved fast polynomial transform algorithm for cyclic convolutions

This page was built for publication:

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