An efficient algorithm for cyclic convolution based on fast-polynomial and fast-\(W\) transforms

DOI10.1007/BF01204923zbMath0994.65151MaRDI QIDQ5957034

Zeng-rong Jiang, Li-Zhi Cheng

Publication date: 25 June 2002

Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)

zbMATH Keywords

algorithmsfast convolutionarithmetic complexitycyclic convolutiondiscrete trigonometric transformdiscrete-\(W\) transformfast polynomial transformfast-\(W\) transform

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (1)

Notes on discrete Gaussian scale space

Cites Work

• Unnamed Item
• The discrete W transform
• Fast W transform. Algorithms and programs
• Fast polynomial transform algorithms for digital convolution
• Prime factor fast Hartley transform
• On the application of a fast polynomial transform and the Chinese remainder theorem to compute a two-dimensional convolution
• Fast polynominal transforms for two-dimensional convolution
• An improved FPT algorithm for computing two-dimensional cyclic convolutions
• A new algorithm to compute the discrete cosine Transform
• Computation of Convolutions and Discrete Fourier Transforms by Polynomial Transforms
• An analog architecture on parameter estimation of ARMA models
• A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
• An Algorithm for the Machine Calculation of Complex Fourier Series

This page was built for publication: An efficient algorithm for cyclic convolution based on fast-polynomial and fast-\(W\) transforms