Skip to main content
SpringerLink
Log in

A New Position-Based Fast Radix-2 Algorithm for Computing the DHT

  • Conference paper
Contemporary Computing (IC3 2009)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 40))

Included in the following conference series:

  • 1145 Accesses

Abstract

The radix-2 decimation-in-time fast Hartley transform algorithm for computing the DHT has been introduced by Bracewell. A set of fast algorithms were further developed by Sorenson et al. A new position-based fast radix-2 decimation-in-time algorithm that requires less number of multiplications than that of Sorenson is proposed. It exploits the characteristics of the DHT matrix and introduces multiplying structures in the signal flow-diagram (SFD). It exhibits an SFD with butterflies similar for each stage. The operation count for the proposed algorithm is determined. It is verified by implementing the program in C.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Paik, C.H., Fox, M.D.: Fast Hartley transform for image processing. IEEE Trans. Medical Imaging 7(6), 149–153 (1988)

    Article  CAS  PubMed  Google Scholar 

  2. Wu, J.L., Shiu, J.: Discrete Hartley transform in error control coding. IEEE Trans. Signal Processing 39(10), 2356–2359 (1991)

    Article  Google Scholar 

  3. Meher, P.K., Panda, G.: Unconstrained Hartley-domain least mean square adaptive filter. IEEE Trans. Circuits and Systems-II: Analog and Digital Signal Processing 40(9), 582–585 (1993)

    Article  Google Scholar 

  4. Meher, P.K., Srikanthan, T., Patra, J.C.: Scalable and modular memory-based systolic architectures for discrete Hartley transform. IEEE Trans. Circuits and Systems-I: Fundamental Theory & Applications 53(5), 1065–1077 (2006)

    Article  Google Scholar 

  5. Bracewell, R.N.: The fast Hartley transform. Proc. IEEE 72(8), 1010–1018 (1984)

    Article  Google Scholar 

  6. Sorensen, H.V., Jones, D.L., Burrus, C.S., Heideman, M.T.: On computing the discrete Hartley transform. IEEE Trans. Acoustics, Speech, and Signal Processing 33(4), 1231–1238 (1985)

    Article  Google Scholar 

  7. Hou, H.S.: The Fast Hartley Transform Algorithm. IEEE Trans. Computers 36(2), 147–156 (1987)

    Article  Google Scholar 

  8. Malvar, H.S.: Fast computation of the discrete cosine transform and the discrete Hartley transform. IEEE Trans. Acoustics, Speech, and Signal Processing 35(10), 1484–1485 (1987)

    Article  Google Scholar 

  9. Prabhu, K.M.M., Nagesh, A.: New radix-3 and -6 decimation in frequency fast Hartley transform algorithms. Can. J. Elect. and Comp. Eng. 18(2), 65–69 (1993)

    Article  Google Scholar 

  10. Bi, G., Chen, Y.Q.: Fast DHT algorithms for length N = q*2m. IEEE Trans. Signal Processing 47(3), 900–903 (1999)

    Article  Google Scholar 

  11. Bouguezel, S., Ahmad, M.O., Swamy, M.N.S.: A new split-radix FHT algorithm for length-q*2m DHTs. IEEE Trans. Circuits Syst. I, Reg. Papers 51(10), 2031–2043 (2004)

    Article  Google Scholar 

  12. Chiper, D.F., Swamy, M.N.S., Ahmad, M.O.: An efficient systolic array algorithm for the VLSI implementation of a prime-length DHT. In: Proc. Int. Symp. Signals, Circuits Syst (ISSCS 2005), July 2005, pp. 167–169 (2005)

    Google Scholar 

  13. Meher, P.K., Patra, J.C., Swamy, M.N.S.: High-throughput memory-based architecture for DHT using a new convolutional formulation. IEEE Trans. Circuits Syst. II, Exp. Briefs 54(7), 606–610 (2007)

    Article  Google Scholar 

  14. Wu, J.S., Shu, H.Z., Sehnadji, L., Luo, L.M.: Radix – 3 × 3 algorithm for the 2 –D discrete Hartley transform. IEEE Trans. Circuits Syst. II, Exp. Briefs 55(6), 566–570 (2008)

    Article  Google Scholar 

  15. Bouguezel, S., Ahmad, M.O., Swamy, M.N.S.: An efficient three-dimensional decimation-in-time FHT algorithm based on the radix-2/4 approach. In: Proc. IEEE (ISSPIT), December 2004, pp. 52–55 (2004)

    Google Scholar 

  16. Bouguezel, S., Ahmad, M.O., Swamy, M.N.S.: A split vector-radix algorithm for the 3-D discrete Hartley transform. IEEE Trans. Circuits Syst. I, Reg. Papers 53(9), 1966–1976 (2006)

    Article  Google Scholar 

  17. Bouguezel, S., Ahmad, M.O., Swamy, M.N.S.: An efficient multidimensional decimation-in-frequency FHT algorithm based on the radix-2/4 approach. In: Proc. IEEE (ISCAS), May 2005, pp. 2405–2408 (2005)

    Google Scholar 

  18. Bouguezel, S., Ahmad, M.O., Swamy, M.N.S.: Multidimensional vector radix FHT algorithms. IEEE Trans. Circuits Syst. I, Reg. Papers 53(4), 905–917 (2006)

    Article  Google Scholar 

  19. Shah, G.A., Rathore, T.S.: Position-based method for computing the elements of the discrete Hartley transform matrix. In: Proc. Internat. Conf. IEEE Region 10, TENCON-2008, Hyderabad, India (2008)

    Google Scholar 

  20. Rathore, T.S.: Hartley transform – Properties and algorithms. In: Proc. National Conf. Real Time Systems, Indore, India, pp. 21–30 (1990)

    Google Scholar 

  21. Culhane, A.D., Peckerar, M.C., Marrian, C.R.K.: A neural net approach to discrete Hartley and Fourier transforms. IEEE Trans. Circuits and Systems 36(5), 695–703 (1989)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate Student Member, IEEE, Department of E&TC MPSTME, NMIMS University, Mumbai, 400 056, India

    Gautam A. Shah

  2. Senior Member, IEEE, Department of E&TC, St. Francis Institute of Technology, Mumbai, 400 103, India

    Tejmal S. Rathore

Authors
  1. Gautam A. Shah
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tejmal S. Rathore
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Sciences, University of Florida, Gainesville, FL, 32611, USA

    Sanjay Ranka

  2. Laurence H. Baker Center for Bioinformatics and Biological Statistics, Iowa State University, USA

    Srinivas Aluru

  3. Grid Computing and Distributed Systems Laboratory and, NICTA Victoria Laboratory, Department of Computer Science and Software Engineering, The University of Melbourne, Australia

    Rajkumar Buyya

  4. Department of Computer Science, National Tsing Hua University, Taiwan

    Yeh-Ching Chung

  5. Computer Science, College of Engineering and Science, Louisiana Tech University, Ruston, LA, 71272, USA

    Sumeet Dua  & Vir V. Phoha  & 

  6. Department of Computer Sciences, Purdue University, W. Lafayette, IN, 47907, USA

    Ananth Grama

  7. Arizona State University, Tempe, AZ, 85281, USA

    Sandeep K. S. Gupta

  8. Computer Science and Engineering Department, Indian Institute of Technology Kharagpur, 721 302, WB, India

    Rajeev Kumar

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shah, G.A., Rathore, T.S. (2009). A New Position-Based Fast Radix-2 Algorithm for Computing the DHT. In: Ranka, S., et al. Contemporary Computing. IC3 2009. Communications in Computer and Information Science, vol 40. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03547-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03547-0_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03546-3

  • Online ISBN: 978-3-642-03547-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation