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

@article{Lizhi2001AnEA,
  title={An efficient algorithm for cyclic convolution based on fast-polynomial and fast-W transforms},
  author={Chen Lizhi and Jiang Zeng-rong},
  journal={Circuits, Systems and Signal Processing},
  year={2001},
  volume={20},
  pages={77-88}
}
This paper first presents a fastW-transform (FWT) algorithm for computing one-dimensional cyclic and skew-cyclic convolutions. By using this FWT in conjunction with the fast polynomial transform (FPT), an efficient algorithm is then proposed for calculating the two-dimensional cyclic convolution (2D CC). Compared to the conventional row-column 2D discrete Fourier transform algorithm or the FPT Fast Fourier transform algorithm for 2D CC, the proposed algorithm achieves 65% or 40% savings in the… Expand
5 Citations
Discrete Deep Structure
  • 1
Notes on Discrete Gaussian Scale Space
  • 6

References

SHOWING 1-10 OF 15 REFERENCES
Improved Fourier and Hartley transform algorithms: Application to cyclic convolution of real data
  • 125
  • PDF
On the application of a fast polynomial transform and the Chinese remainder theorem to compute a two-dimensional convolution
  • 26
  • Highly Influential
  • PDF
A prime factor fast W transform algorithm
  • Z. Wang
  • Mathematics, Computer Science
  • IEEE Trans. Signal Process.
  • 1992
  • 25
Basis-vector-decomposition based two-stage computational algorithms for DFT and DHT
  • 4
Computation of Convolutions and Discrete Fourier Transforms by Polynomial Transforms
  • 55
Fast algorithms for the discrete cosine transform
  • 428
...
1
2
...