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)

Related topics

Related topics

16 relations
Bruun's FFT algorithmC. Sidney BurrusCPU cacheCircular convolution

Broader (1)

Fourier analysis

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
The Discrete Hartley Transform
This chapter introduces the DHT and discusses those aspects of its solution, as obtained via the FHT, which make it an attractive… 
2009
2009
Generalized Discrete Hartley Transforms Generalized Discrete Hartley Transforms Generalized Discrete Hartley Transforms Generalized Discrete Hartley Transforms
R.V. Hartley disclosed a real–valued transform closely related to the Fourier transform in 1942. Besides having interesting… 
2001
2001
A new DA-based array for one dimensional discrete Hartley transform
  • Jiun-In Guo
  • ISCAS . The IEEE International Symposium on…
  • 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
Computing discrete Hartley transform using algebraic integers
An algorithm for computing the discrete Hartley transform is presented that is based on the algebraic integers encoding scheme… 
1997
1997
New split-radix algorithm for the discrete Hartley transform
This paper presents a split-radix algorithm that can flexibly compute the discrete Hartley transforms of various sequence lengths… 
1993
1993
Fast radix-3/9 discrete Hartley transform
An efficient algorithm for computing radix-3/9 discrete Hartley transforms (DHTs) is presented. It is shown that the radix-3/9… 
1992
1992
An improved fast Radon transform algorithm for two-dimensional discrete Fourier and Hartley transform
  • D. LunW. Siu
  • [Proceedings] IEEE International Symposium on…
  • 1992
  • Corpus ID: 123263519
Presents a novel algorithm for the computation of the two-dimensional discrete Fourier transform and discrete Hartley transform… 
Highly Cited
1991
Highly Cited
1991
Systolic arrays for the discrete Hartley transform
Recently, R.N. Bracewell (1983) introduced the discrete Hartley transform (DHT) as an alternative to the discrete Fourier… 
Highly Cited
1987
Highly Cited
1987
Fast computation of the discrete cosine transform and the discrete Hartley transform
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
Quantization errors in the computation of the discrete Hartley transform
The principal objective of this paper is the study of the arithmetic roundoff error characteristics of several discrete Hartley… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)