Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 209,942,804 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
16 relations
Bruun's FFT algorithm
C. Sidney Burrus
CPU cache
Circular convolution
Expand
Broader (1)
Fourier analysis
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2000
2000
Discrete Hartley transform based multicarrier modulation
Chin-Liang Wang
,
Ching-Hsien Chang
,
J. Fan
,
J. Cioffi
IEEE International Conference on Acoustics…
2000
Corpus ID: 2485098
This paper presents a real-valued discrete multicarrier modulation approach that is based on the use of the discrete Hartley…
Expand
1995
1995
Comments on "Generalized discrete Hartley transform"
Zhongde Wang
IEEE Transactions on Signal Processing
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
Highly Cited
1991
Highly Cited
1991
Systolic arrays for the discrete Hartley transform
Long-Wen Chang
,
Shen-Wen Lee
IEEE Transactions on Signal Processing
1991
Corpus ID: 28029782
Recently, R.N. Bracewell (1983) introduced the discrete Hartley transform (DHT) as an alternative to the discrete Fourier…
Expand
Highly Cited
1987
Highly Cited
1987
The DFT - an owner's manual for the discrete Fourier transform
W. Briggs
,
V. Henson
1987
Corpus ID: 20632316
Preface 1. Introduction. A Bit of History An Application Problems 2. The Discrete Fourier Transform (DFT). Introduction DFT…
Expand
Review
1987
Review
1987
Real-valued fast Fourier transform algorithms
H. Sorensen
,
Douglas L. Jones
,
M. Heideman
,
C. Burrus
IEEE Transactions on Acoustics Speech and Signal…
1987
Corpus ID: 1886290
This tutorial paper describes the methods for constructing fast algorithms for the computation of the discrete Fourier transform…
Expand
Highly Cited
1987
Highly Cited
1987
The Fast Hartley Transform Algorithm
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
Highly Cited
1987
Highly Cited
1987
Fast computation of the discrete cosine transform and the discrete Hartley transform
Henrique S. Malvar
IEEE Transactions on Acoustics Speech and Signal…
1987
Corpus ID: 42146178
A new factorization of the discrete Hartley transform (DHT) is presented. It is used to derive new algorithms for the DHT and the…
Expand
1986
1986
Separable two-dimensional discrete Hartley transform
A. Watson
,
A. Poirson
1986
Corpus ID: 43353738
Bracewell has proposed the discrete Hartley transform (DHT) as a substitute for the discrete Fourier transform (DFT…
Expand
Highly Cited
1985
Highly Cited
1985
On computing the discrete Hartley transform
H. Sorensen
,
Douglas L. Jones
,
C. Burrus
,
M. Heideman
IEEE Transactions on Acoustics Speech and Signal…
1985
Corpus ID: 27744861
The discrete Hartley transform (DHT) is a real-valued transform closely related to the DFT of a real-valued sequence. Bracewell…
Expand
Highly Cited
1984
Highly Cited
1984
The fast Hartley transform
R. Bracewell
Proceedings of the IEEE
1984
Corpus ID: 21988816
A fast algorithm has been worked out for performing the Discrete Hartley Transform (DHT) of a data sequence of N elements in a…
Expand
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)
ACCEPT & CONTINUE