Skip to search formSkip to main contentSkip to account menu

Discrete Hartley transform

Known as: DHT, Fast Hartley transform 
A discrete Hartley transform (DHT) is a Fourier-related transform of discrete, periodic data similar to the discrete Fourier transform (DFT), with… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
This chapter introduces the DHT and discusses those aspects of its solution, as obtained via the FHT, which make it an attractive… 
2009
2009
R.V. Hartley disclosed a real–valued transform closely related to the Fourier transform in 1942. Besides having interesting… 
2003
2003
This paper describes an analog VLSI architecture, capable of computing discrete Hartley transform (DHT), and its inverse, for any… 
2001
2001
  • Jiun-In Guo
  • 2001
  • Corpus ID: 206959554
This paper presents a new distributed arithmetic (DA) based array for the (1-D) any-length discrete Hartley transform (DHT). The… 
1999
1999
An algorithm for computing the discrete Hartley transform is presented that is based on the algebraic integers encoding scheme… 
1993
1993
Fast algorithms for computing the DHT of short transform lengths (N = 2, 3, 4, 5, 7, 8, 9 and 16) are derived. A new prime-factor… 
Highly Cited
1991
Highly Cited
1991
Recently, R.N. Bracewell (1983) introduced the discrete Hartley transform (DHT) as an alternative to the discrete Fourier… 
1988
1988
The authors present a systolic circuit for computing a fast algorithm performing the discrete Hartley transform (DHT). The… 
Highly Cited
1987
Highly Cited
1987
A new factorization of the discrete Hartley transform (DHT) is presented. It is used to derive new algorithms for the DHT and the… 
1987
1987
The principal objective of this paper is the study of the arithmetic roundoff error characteristics of several discrete Hartley…