Skip to search formSkip to main content
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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Real transforms require less complexity for computations and less memory for storages than complex transforms. However, discrete… Expand
  • table I
  • table II
  • table III
  • table IV
  • figure 1
Is this relevant?
Highly Cited
2013
Highly Cited
2013
In this paper, a systematic method for developing a binary version of a given transform by using the Walsh-Hadamard transform… Expand
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We present a novel optical orthogonal frequency division multiplexing (O-OFDM) scheme, suitable for intensity-modulated direct… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2000
2000
This paper presents a real-valued discrete multicarrier modulation approach that is based on the use of the discrete Hartley… Expand
  • figure 3
Is this relevant?
1995
1995
  • Z. 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… Expand
Is this relevant?
1992
1992
The discrete Hartley transform is generalized into four classes in the same way as the generalized discrete Fourier transform… Expand
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Preface 1. Introduction. A Bit of History An Application Problems 2. The Discrete Fourier Transform (DFT). Introduction DFT… Expand
Is this relevant?
Highly Cited
1987
Highly Cited
1987
  • H. Hou
  • IEEE Transactions on Computers
  • 1987
  • Corpus ID: 21644775
The fast Hartley transform (FHT) is similar to the Cooley-Tukey fast Fourier transform (FFT) but performs much faster because it… Expand
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table II
Is this relevant?
Highly Cited
1985
Highly Cited
1985
The discrete Hartley transform (DHT) is a real-valued transform closely related to the DFT of a real-valued sequence. Bracewell… Expand
Is this relevant?
Highly Cited
1984
Highly Cited
1984
A fast algorithm has been worked out for performing the Discrete Hartley Transform (DHT) of a data sequence of N elements in a… Expand
  • figure 1
  • table 3
  • table 1
Is this relevant?