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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
In this paper, the design of fractional order differentiator is investigated. First, the discrete Hartley transform (DHT… (More)
Is this relevant?
2009
2009
Bracewell has proposed the Discrete Hartley Transform (DHT) as a substitute for the Discrete Fourier Transform (DFT… (More)
Is this relevant?
2007
2007
We present in this letter an efficient direct method for the computation of a length-N type-II generalized discrete Hartley… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?
2006
2006
In this paper, we present a design framework for scalable memory-based implementation of the discrete Hartley transform (DHT… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
2000
2000
This paper presents a real-valued discrete multicamer modulation approach that is based on the use of the discrete Hartley… (More)
  • figure 3
Is this relevant?
1999
1999
An algorithm for computing the discrete Hartley transform is presented that is based on the algebraic integers encoding scheme… (More)
  • table 1
  • table 3
  • table 2
  • figure 1
  • figure 2
Is this relevant?
1997
1997
  • Guoan Bi
  • IEEE Trans. Signal Processing
  • 1997
This paper presents a split-radix algorithm that can flexibly compute the discrete Hartley transforms of various sequence lengths… (More)
Is this relevant?
1992
1992
When compared with the complexity for realizing the prime factor DFT, the prime factor discrete Hartley transform requires some… (More)
  • table I
Is this relevant?
1985
1985
A new multidimensional Hartley transform is defined and a vector-radix algorithm for fast computation of the transform is… (More)
  • figure 8
  • figure 2
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… (More)
  • figure 1
  • table 3
  • table 1
Is this relevant?