Fast computation of the discrete Hartley transform

  • Authors:

  • Priyanka Jain;Balbir Kumar;S. B. Jain

  • Affiliations:

  • Indira Gandhi Institute of Technology, I P University, Kashmere-Gate, Delhi 110006, India;Maharaja Surajmal Institute of Technology, Delhi 110058, India;Indira Gandhi Institute of Technology, I P University, Kashmere-Gate, Delhi 110006, India

  • Venue:
  • International Journal of Circuit Theory and Applications
  • Year:
  • 2010

Quantified Score

Hi-index 0.01

Visualization

Abstract

The discrete Hartley transform (DHT) is a real-valued transform closely related to the discrete Fourier transform (DFT) of a real-valued spectrum which preserves some useful properties of DFT. In this paper, an algorithm is proposed to realize one-dimensional DHT with sequence length N=2(2 × m), m⩾2. The proposed algorithm requires fewer multiplications than some of the algorithms in the literature. Copyright © 2008 John Wiley & Sons, Ltd.