Skip to main content
SpringerLink
Log in

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

  • Published:
Circuits, Systems and Signal Processing Aims and scope Submit manuscript

Abstract

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 number of multiplications, respectively. The number of additions required is also reduced considerably.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. E. Blahut,Fast Algorithms for Diginal Signal Processing, Addision-Wesley, Reading, MA, 1984.

    Google Scholar 

  2. J. W. Cooley and J. W. Tukey, An algorithm for machine computation of complex Fourier series,Math. Comp., vol. 19, 297–301, 1965.

    Google Scholar 

  3. P. Duhamel et al., Improved Fourier and Hartley transform algorithm: applications to cyclic convolution of real data,IEEE Trans. Acoust. Speech Signal Process., vol. ASSP-36, 818–824, 1987.

    Google Scholar 

  4. E. Feigs and S. Winograd, Fast algorithms for the discrete cosine transform,IEEE Trans. Signal Process., vol. 40, 2374–2393, 1992.

    Google Scholar 

  5. T. K. Kroung, I. S. Reed, R. G. Lips, and C. Wu, On the application of a fast polynomial transform and the Chinese remainder theorem to compute a two-dimensional convolution,IEEE Trans. Acoust. Speech Signal Process., vol. ASSP-29, 91–97, 1981.

    Google Scholar 

  6. B. G. Lee, A new algorithm to compute the discrete cosine transform,IEEE Trans. Acoust. Speech Signal Process., vol. ASSP-32, 1243–1245, 1984.

    Google Scholar 

  7. J. B. Martens, Fast polynomial transforms for two-dimensional convolution,IEEE Trans. Acoust. Speech Signal Process., vol. ASSP-30, 1007–1010, 1982.

    Google Scholar 

  8. H. J. Nussbaumer, Fast polynomial transform for digital convolution.IEEE Trans. Acoust. Speech Signal Process., vol. ASSP-28, 205–215, 1980.

    Google Scholar 

  9. H. J. Nussbaumer,Fast Fourier Transform and Convolution, Springer-Verlag, Berlin, Heidelberg, New York, 1981.

    Google Scholar 

  10. H. J. Nussbaumer and P. Quandalle, Computation of convolution and discrete transform by polynomial transform.IBM J. Res. Develop., vol. 22, 2, 134–144, 1978.

    Google Scholar 

  11. X. N. Ran and K. J. Ray Liu, Fast algorithm for 2-D circular convolutions and number theoretic transforms based on polynomial transforms over finite rings,IEEE Trans. Signal Process., vol. 43, 1995.

  12. I. S. Reed et al., An improved FPT algorithm for computing two-dimensional cyclic convolution,IEEE Trans. Acoust. Speech Signal Process., vol. ASSP-31, 1048–1050, 1983.

    Google Scholar 

  13. G. Steil and M. Tasche, A polynomial approach to fast algorithm for discrete Fourier-cosine and Fourier-sine transforms,Math. Comp., 193 (56), 1991.

  14. Z. Wang, The fast W transform algorithm and programs,Sci. China, vol. 32, 338–350, 1989.

    Google Scholar 

  15. Z. Wang, A prime factor fast W transform algorithm,IEEE Trans. Signal Process., vol. 40, 2361–2367, 1992.

    Google Scholar 

  16. Z. Wang and B. R. Hunt, The discrete W transform,Appl. Math. Comput., vol. 16, 19–48, 1985.

    Google Scholar 

  17. J. L. Wu, W. J. Dah, and S. H. Hsu, Basis-vector-decomposition based two-stage computational algorithms for DFT and DHT,IEEE Trans. Signal Process., vol. 41, 1552–1562, 1993.

    Google Scholar 

  18. D. Yang, Prime factor fast algorithm Hartley transform,Electron. Lett., vol. 26, 119–121, 1990.

    Google Scholar 

  19. B. Y. Zheng, A circular convolution algorithms for the discrete W transform,Proc. Int. Conf. Commun. Syst., Singapore, 1027–1030, 1988.

  20. Y. H. Zeng, Computing the discrete convolutions by the W transform,Chinese J. Num. Math. Appl., vol. 35, 121–130, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and System Science, National University of Defense Technology, 410073, Changsha, Hunan, People's Republic of China

    Cheng Lizhi & Jiang Zengrong

Authors
  1. Cheng Lizhi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiang Zengrong
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lizhi, C., Zengrong, J. An efficient algorithm for cyclic convolution based on fast-polynomial and fast-W transforms. Circuits Systems and Signal Process 20, 77–88 (2001). https://doi.org/10.1007/BF01204923

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01204923

Keywords

Search

Navigation