Skip to main content
Springer Nature Link
Log in

A Novel Approach to Compute Discrete W Transform

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

Abstract

The discrete W transform (DWT) is widely used in digital signal processing. This paper proposes a novel approach to compute DWT via computation of the first-order moments without multiplications. A scalable and efficient systolic array is designed to implement this approach. Compared with the other existing methods, the proposed algorithms are simpler and more applicable.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. G. Bi, Y. Chen, Fast generalized DFT and DHT algorithms. Signal Process. 65(3), 383–390 (1998)

    Article  MATH  Google Scholar 

  2. G. Bi, On computation of the discrete W transform. IEEE Trans. Signal Process. 47(5), 1450–1453 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  3. G. Bo, Y. Chen, Y. Zeng, Fast algorithms for generalized discrete Hartley of composite sequence lengths. IEEE. Trans. Circuits Syst. II 47(9), 893–901 (2000)

    Google Scholar 

  4. R.N. Bracewell, Discrete Hartley transform. J. Opt. Soc. Am. 73(12), 1832–1835 (1983)

    Google Scholar 

  5. F.H.Y. Chan, F.K. Lam, H.F. Li, J.G. Liu, An all adder systolic structure for fast computation of moments. J. VLSI Signal Process. 12(2), 159–175 (1996)

    Article  Google Scholar 

  6. L.Z. Cheng, Fast computation of discrete W transform through discrete Hartley transform (DHT). Electron. Lett. 36(5), 474–476 (2000)

    Google Scholar 

  7. D.F. Chiper, Radix-2 fast algorithm for computing discrete Hartley transform of Type. IEEE Trans. Circuits Syst. II 59(5), 297–301 (2012)

    Google Scholar 

  8. M. Hatamian, A real time two-dimensional moment generating algorithm and its single chip implementation. IEEE Trans. Acoust. Speech Signal Process. 34(3), 546–553 (1986)

    Article  Google Scholar 

  9. N.C. Hu, H.I. Chang, O.K. Ersoy, Generalized discrete Hartley transforms. IEEE Trans. Signal Process. 40(12), 2931–2940 (1992)

    Article  MATH  Google Scholar 

  10. M.T. Hamood, S. Boussakta, in Proceedings of the IEEE ICASSP. New radix-based FHT algorithm for computing the discrete Hartley transform (2011) pp. 1581–1584

  11. K.J. Jones, Design and parallel computation of regularised fast Hartley transform. IEE Proceed. Vis. Image Signal Process. 153(1), 70–78 (2006)

    Google Scholar 

  12. J.G. Liu, H.F. Li, F.H.Y. Chan, F.K. Lam, A novel approach to fast discrete Fourier transform. J. Parallel Distrib. Comput. 54(1), 48–58 (1998)

    Article  MATH  Google Scholar 

  13. J.G. Liu, H.F. Li, F.H.Y. Chan, F.K. Lam, Fast discrete cosine transform via computation of moments. J. VLSI Signal Process. 19(3), 257–268 (1998)

    Article  Google Scholar 

  14. J.G. Liu, F.H.Y. Chan, F.K. Lam, H.F. Li, Moment-based fast discrete sine transforms. IEEE Signal Process. Lett. 7(8), 227–229 (2000)

    Article  Google Scholar 

  15. J.G. Liu, F.H.Y. Chan, F.K. Lam, H.F. Li, A new approach to fast calculation of moments of 3-D gray images. Parallel Comput. 26(6), 805–815 (2000)

    Article  MATH  Google Scholar 

  16. J.G. Liu, Y.Z. Liu, G.Y. Wang, Fast discrete W transforms via computation of moments. IEEE Trans. Signal Process. 53(2), 654–659 (2005)

    Article  MathSciNet  Google Scholar 

  17. H.Z. Shu, J.S. Wu, L. Senhadji, L.M. Luo, Radix-2 algorithm for the fast computation of type- 3-D discrete W transform. Signal Process. 88, 210–215 (2008)

    Article  MATH  Google Scholar 

  18. Z. Wang, B.R. Hunt, The discrete W transform. Appl. Math. Comput. 16(1), 19–48 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  19. Z. Wang, Fast algorithms for the discrete W transform and for the discrete Fourier transform. IEEE Trans. Acoust. Speech Signal Process. 32(4), 803–816 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  20. Z. Wang, A prime factor fast W transform algorithm. IEEE Trans. Signal Process. 40(9), 2361–2368 (1992)

    Article  Google Scholar 

  21. J. Xi, J.F. Chicharo, Computing running discrete Hartley transform and running discrete W transforms based on the adaptive LMS algorithm. IEEE Trans. Circuits Syst. II 44(3), 257–260 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Key Laboratory of Science and Technology on Multi-spectral Information Processing, Institute for School of Automation, Huazhong University of Science and Technology, Keji Lou, Room 1110, Wuhan, 430074,  Hubei Province, China

    Jianguo Liu & Xia Hua

Authors
  1. Jianguo Liu
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Xia Hua
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Xia Hua.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, J., Hua, X. A Novel Approach to Compute Discrete W Transform. Circuits Syst Signal Process 33, 2867–2880 (2014). https://doi.org/10.1007/s00034-014-9769-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00034-014-9769-6

Keywords