Skip to main content
SpringerLink
Log in

Improved fast polynomial transform algorithm for cyclic convolutions

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

Abstract

An improved version of the Fast Polynomial Transform for the computation of two-dimensional cyclic convolutions is proposed in this paper. This new version of the Fast Polynomial Transform comes from the concept of splitting product-fields and gives more than a 20% to 50% reduction in the numbers of multiplications. An average of 20% improvement on overall computation time compared with the previous approach is also achievable.

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. T. M. Apostol,Introduction to Analytic Number Theory, Springer-Verlag, Berlin and New York, 1976.

    Google Scholar 

  2. B. Arambepola and P. J. W. Rayner, Efficient transforms for multi dimensional convolutions,Electronic Letters, vol. 15, no. 6, pp. 189–190, March 1979.

    Google Scholar 

  3. R. E. Blahut,Fast Algorithms for Digital Signal Processing, Addison-Wesley, Reading, MA, 1985.

    Google Scholar 

  4. K. Ireland and M. Rosen,A Classical Introduction to Modern Number Theory, Springer-Verlag, Berlin and New York, 1972.

    Google Scholar 

  5. H. J. Nussbaumer, Fast polynomial transform algorithms for digital convolution,IEEE Trans., on Accoust. Speech Signal Process., ASSP-28, no. 2, pp. 205–215, April 1980.

    Google Scholar 

  6. H.J. Nussbaumer,Fast Fourier Transform and Convolution Algorithms, Springer-Verlag, Berlin and New York, 1981/1982.

    Google Scholar 

  7. I. S. Reed, T. K. Truong, C. S. Yeh, and H. M. Shao, An improved FPT algorithm for computing two-dimensional cyclic convolutions,IEEE Trans., on Accoust. Speech Signal Process., ASSP-31, no. 4, pp. 1048–1050, August 1983.

    Google Scholar 

  8. D. Winter,The Structure of Fields, Springer-Verlag, Berlin and New York, 1984.

    Google Scholar 

  9. J. L. Wu and S. C. Pei, Fast biased polynomial transforms,IEEE Trans, on Accoust. Speech Signal Process., ASSP-34, no. 2, pp. 383–385, April 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electronic Engineering, Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong

    Albert Ming Loh & Wan-Chi Siu

Authors
  1. Albert Ming Loh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wan-Chi Siu
    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

Loh, A.M., Siu, WC. Improved fast polynomial transform algorithm for cyclic convolutions. Circuits Systems and Signal Process 14, 603–614 (1995). https://doi.org/10.1007/BF01213957

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

Keywords

Search

Navigation