Journal ArticleDOI
The fast Hartley transform
Ronald N. Bracewell
- Vol. 72, Iss: 8, pp 1010-1018
Reads0
Chats0
TLDR
The Fast Hartley Transform (FHT) is as fast as or faster than the Fast Fourier Transform (FFT) and serves for all the uses such as spectral analysis, digital processing, and convolution to which the FFT is at present applied.Abstract:
A fast algorithm has been worked out for performing the Discrete Hartley Transform (DHT) of a data sequence of N elements in a time proportional to Nlog 2 N. The Fast Hartley Transform (FHT) is as fast as or faster than the Fast Fourier Transform (FFT) and serves for all the uses such as spectral analysis, digital processing, and convolution to which the FFT is at present applied. A new timing diagram (stripe diagram) is presented to illustrate the overall dependence of running time on the subroutines composing one implementation; this mode of presentation supplements the simple counting of multiplies and adds. One may view the Fast Hartley procedure as a sequence of matrix operations on the data and thus as constituting a new factorization of the DFT matrix operator; this factorization is presented. The FHT computes convolutions and power spectra distinctly faster than the FFT.read more
Citations
More filters
Proceedings ArticleDOI
The Hartley Series Applied To The Computation Of Functional Angiographic Images
Book ChapterDOI
A New Position-Based Fast Radix-2 Algorithm for Computing the DHT
Gautam A. Shah,Tejmal S. Rathore +1 more
TL;DR: A new position-based fast radix-2 decimation-in-time algorithm that requires less number of multiplications than that of Sorenson is proposed, which exploits the characteristics of the DHT matrix and introduces multiplying structures in the signal flow-diagram (SFD).
Tee bartley series applied to tee computation of functional angiograpeic imges
L. Legrand,H. Diebold,L. Wsserre +2 more
TL;DR: In this paper, the Hartley series is used for computing the amplitude and phase images with the Fast Hartley Transform (FHT) and then they apply them to image sequences digitized from conventional angiographic films.
Proceedings ArticleDOI
Recursive Transforms In Hybrid Processing
H. S. Hou,Demetri Psaltis +1 more
TL;DR: A unified analysis of a class of unitary transforms including the discrete Fourier, the Walsh Hadamard, the discrete Hartley, and the discrete cosine transforms, which leads to a fast, efficient recursive algorithm for the discreteHartley transform.
Texture classification using transform analysis
TL;DR: In this article, the authors propose a method to solve the problem of the problem: this article... ]..,.. )].. [1].
References
More filters
Journal ArticleDOI
An algorithm for the machine calculation of complex Fourier series
J.W. Cooley,John W. Tukey +1 more
TL;DR: Good generalized these methods and gave elegant algorithms for which one class of applications is the calculation of Fourier series, applicable to certain problems in which one must multiply an N-vector by an N X N matrix which can be factored into m sparse matrices.
Journal ArticleDOI
A guided tour of the fast Fourier transform
TL;DR: This article is intended as a primer on the fast Fourier transform, which has revolutionized the digital processing of waveforms and is needed for a whole new range of applications for this classic mathematical device.
Journal ArticleDOI
Discrete Hartley transform
TL;DR: The discrete Hartley transform (DHT) resembles the discrete Fourier transform (DFT) but is free from two characteristics of the DFT that are sometimes computationally undesirable and promises to speed up Fourier-transform calculations.
Journal ArticleDOI
A More Symmetrical Fourier Analysis Applied to Transmission Problems
TL;DR: In this article, the Fourier identity is expressed in a more symmetrical form which leads to certain analogies between the function of the original variable and its transform, and it permits a function of time to be analyzed into two independent sets of sinusoidal components, one of which is represented in terms of positive frequencies, and the other of negative.
Journal ArticleDOI
Numerical Analysis: A fast fourier transform algorithm for real-valued series
TL;DR: In this article, a new procedure for calculating the complex, discrete Fourier transform of real-valued time series is presented for an example where the number of points in the series is an integral power of two.