Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,253,462 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.
2009
2009
Generalized Discrete Hartley Transforms Generalized Discrete Hartley Transforms Generalized Discrete Hartley Transforms Generalized Discrete Hartley Transforms
C. Moraga
2009
Corpus ID: 123209067
R.V. Hartley disclosed a real–valued transform closely related to the Fourier transform in 1942. Besides having interesting…
Expand
Review
2007
Review
2007
Lifting algorithm of discrete Hartley transform
Yu-hai Li
,
Jian Liu
,
Hong-bo Xu
International Symposium on Multispectral Image…
2007
Corpus ID: 119556717
The discrete Hartley transform(DHT) is a real-valued transform that directly maps a real-valued sequence to a real-valued…
Expand
2003
2003
Analog sampled data architecture for discrete Hartley transform for prime N
A. K. Mal
,
A. Dhar
10th IEEE International Conference on Electronics…
2003
Corpus ID: 1032179
This paper describes an analog VLSI architecture, capable of computing discrete Hartley transform(DHT), for any prime N using…
Expand
2000
2000
An efficient design for one-dimensional discrete Hartley transform using parallel additions
Jiun-In Guo
IEEE Transactions on Signal Processing
2000
Corpus ID: 43312559
This paper presents a new efficient design for the one-dimensional (1-D) any-length discrete Hartley transform (DHT). Using a…
Expand
2000
2000
Fast algorithm for the 3-D discrete Hartley transform
S. Boussakta
,
O. Alshibami
IEEE International Conference on Acoustics…
2000
Corpus ID: 13431352
The application of multidimensional fast transforms to solve problems in image processing, motion analysis and multidimensional…
Expand
1993
1993
Fast radix-3/9 discrete Hartley transform
D. Lun
,
W. Siu
IEEE Transactions on Signal Processing
1993
Corpus ID: 45165531
An efficient algorithm for computing radix-3/9 discrete Hartley transforms (DHTs) is presented. It is shown that the radix-3/9…
Expand
1993
1993
New high-speed prime-factor algorithm for discrete Hartley transform
P. Meher
,
J. K. Satapathy
,
G. Panda
1993
Corpus ID: 625520
Fast algorithms for computing the DHT of short transform lengths (N = 2, 3, 4, 5, 7, 8, 9 and 16) are derived. A new prime-factor…
Expand
1992
1992
On prime factor mapping for the discrete Hartley transform
D. Lun
,
W. Siu
IEEE Transactions on Signal Processing
1992
Corpus ID: 8628491
The authors propose a new prime factor mapping scheme, which requires no extra arithmetic operations for the realization of prime…
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
1985
1985
Comments on "The fast Hartley transform"
J. Prado
Proceedings of the IEEE
1985
Corpus ID: 62537873
In the above paper, Bracewell presents a new timing diagram for the computation of the DHT. We present here an in-place version…
Expand