Journal ArticleDOI
Vector Hartley transform
TLDR
The fast Hartley transform provides the same information as the fast Fourier transform (FFT) but with greater speed and efficiency when the input data are real.Abstract:
The fast Hartley transform provides the same information as the fast Fourier transform (FFT) but with greater speed and efficiency when the input data are real. An algorithm for taking the Hartley transform of a long sequence on a multiprocessor machine by simultaneously transforming short subsequences does not require complex arithmetic and is faster than analogous techniques which use the Fourier transform.read more
Citations
More filters
Journal ArticleDOI
A new single MCCCDTA based Wien-bridge oscillator with AGC
TL;DR: In this article, a new current-mode Wien-bridge oscillator with automatic amplitude control was presented, which employs single MCCCDTA as the active element and provides two current outputs with small distortion from high output impedances.
Journal ArticleDOI
Assessing the Hartley transform
TL;DR: The fast algorithm for the (real) Hartly transform is discussed in relation to the established fast algorithmFor the (complex) Fourier transform, compared by timing comparably written programs on a given machine, and the discipline of timing is discussed as an adjunct to complexity analysis.
Journal ArticleDOI
Optical Hartley transforms
TL;DR: The two-dimensional Hartley transform is of particular interest not only as a tool for analysis and processing of images and other 2D functions, but because it can be implemented optically without introducing the phase ambiguities associated with intensity-only observations of Fourier transforms as mentioned in this paper.
Journal ArticleDOI
New fast algorithm to compute two-dimensional discrete Hartley transform
TL;DR: A new fast algorithm for computing the two-dimensional discrete Hartley transform that requires the lowest number of multiplications compared with other related algorithms is presented.
Journal ArticleDOI
Systems analysis using Hartley impedances
TL;DR: In this paper, the Fourier-based method of phasors is reformulated as an all-real calculation method which is based on the Hartley transform, which is applied to the calculation of harmonics in electric power distribution systems.
References
More filters
Journal ArticleDOI
Real-valued fast Fourier transform algorithms
TL;DR: A new implementation of the real-valued split-radix FFT is presented, an algorithm that uses fewer operations than any otherreal-valued power-of-2-length FFT.
Journal ArticleDOI
The fast Hartley transform
TL;DR: 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.
Book
The Hartley transform
TL;DR: The author describes the fast algorithm he discovered for spectral analysis and indeed any purpose to which Fourier Transforms and the Fast Fourier Transform are normally applied.
Journal ArticleDOI
Index mappings for multidimensional formulation of the DFT and convolution
TL;DR: The general conditions for these mappings to be unique and cyclic are given, and the application to discrete Fourier transform (DFT) and convolution evaluation is considered.
Journal ArticleDOI
FFT algorithms for vector computers
TL;DR: Several methods for lengthening vectors are discussed, including the case of multiple and multi-dimensional transforms where M sequences of length N can be transformed as a single sequence of length MN using a 'truncated' FFT.