Skip to search formSkip to main contentSkip to account menu
You are currently offline. Some features of the site may not work correctly.

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

Related topics

Related topics

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

Broader (1)

Fourier analysis

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Binary Discrete Cosine and Hartley Transforms
In this paper, a systematic method for developing a binary version of a given transform by using the Walsh-Hadamard transform… 
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 4
Highly Cited
2010
Highly Cited
2010
Novel Power Efficient Optical OFDM Based on Hartley Transform for Intensity-Modulated Direct-Detection Systems
We present a novel optical orthogonal frequency division multiplexing (O-OFDM) scheme, suitable for intensity-modulated direct… 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2001
2001
Radix-2 × 2 × 2 algorithm for the 3-D discrete Hartley transform
The discrete Hartley transform (DHT) has proved to be a valuable tool in digital signal/image processing and communications and… 
  • figure 1
  • figure 2
  • table I
  • table II
  • table III
2000
2000
Discrete Hartley transform based multicarrier modulation
This paper presents a real-valued discrete multicarrier modulation approach that is based on the use of the discrete Hartley… 
  • figure 3
1995
1995
Comments on "Generalized discrete Hartley transform"
  • Zhongde Wang
  • IEEE Trans. Signal Process.
  • 1995
  • Corpus ID: 9201869
The author comments on the paper by Hu et al. (IEEE Trans. Signal Processing, vol.40, no.12, p.2951-60, 1992). Information is… 
1992
1992
Generalized discrete Hartley transforms
The discrete Hartley transform is generalized into four classes in the same way as the generalized discrete Fourier transform… 
Highly Cited
1987
Highly Cited
1987
The DFT - an owner's manual for the discrete Fourier transform
Preface 1. Introduction. A Bit of History An Application Problems 2. The Discrete Fourier Transform (DFT). Introduction DFT… 
Review
1987
Review
1987
Real-valued fast Fourier transform algorithms
This tutorial paper describes the methods for constructing fast algorithms for the computation of the discrete Fourier transform… 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1985
Highly Cited
1985
On computing the discrete Hartley transform
The discrete Hartley transform (DHT) is a real-valued transform closely related to the DFT of a real-valued sequence. Bracewell… 
Highly Cited
1984
Highly Cited
1984
The fast Hartley transform
A fast algorithm has been worked out for performing the Discrete Hartley Transform (DHT) of a data sequence of N elements in a… 
  • figure 1
  • table 3
  • table 1
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE