Proceedings ArticleDOI
Vector-radix algorithm for a 2-D discrete Hartley transform
Ramdas Kumaresan,P.K. Gupta +1 more
- Vol. 10, pp 1531-1534
TLDR
A new multidimensional Hartley transform is defined and a vector-radix algorithm for fast computation of the transform is developed that is shown to be faster (in terms of multiplication and addition count) compared to other related algorithms.Abstract:
A new multidimensional Hartley Transform is defined and a vector-radix algorithm for fast computation of the transform is developed. The algorithm is shown to be faster (in terms of multiplication and addition count) compared to other related algorithms.read more
Citations
More filters
Journal ArticleDOI
Systolic architectures for the computation of the discrete Hartley and the discrete cosine transforms based on prime factor decomposition
Chaitali Chakrabarti,Joseph JaJa +1 more
TL;DR: Two-dimensional systolic array implementations for computing the discrete Hartley transform and the discrete cosine transform when the transform size N is decomposable into mutually prime factors are proposed.
Journal ArticleDOI
A three-dimensional DFT algorithm using the fast Hartley transform
Hong Hao,Ronald N. Bracewell +1 more
TL;DR: A three-dimensional (3-D) Discrete Fourier Transform (DFT) algorithm for real data using the one-dimensional Fast Hartley Transform (FHT) is introduced that is simpler and retains the speed advantage that is characteristic of the Hartley approach.
Journal ArticleDOI
Radix-2 /spl times/ 2 /spl times/ 2 algorithm for the 3-D discrete Hartley transform
TL;DR: The proposed algorithm is based on the principles of the divide-and-conquer approach applied directly in 3-D and has been found to offer significant savings in arithmetic operations compared with the row-column approach based on similar algorithms.
Journal ArticleDOI
Split-radix fast Hartley transform in one and two dimensions
E.A. Jonckheere,C. Ma +1 more
TL;DR: The method is extended, in a straightforward manner, to the two-dimensional FHT (2-D FHT) by implementing the vector-radix approach, which requires many fewer computational operations than the nonsplit vector- Radix 2- D FHT method.
Proceedings ArticleDOI
Fast algorithm for the 3-D discrete Hartley transform
Said Boussakta,O. Alshibami +1 more
TL;DR: The aim of this paper is to derive the 3-D vector radix for the3-D discrete Hartley transform and the arithmetic operations of this algorithm are compared to similar algorithms using the row-column approach.
References
More filters
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
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.
Proceedings ArticleDOI
Vector radix fast Fourier transform
TL;DR: A new radix-2 two-dimensional direct FFT developed by Rivard is generalized in this paper to include arbitrary radices and non-square arrays and it is shown that the Radix-4 version of this algorithm may require significantly fewer computations than conventional row-column transform methods.
Journal ArticleDOI
Direct fast Fourier transform of bivariate functions
TL;DR: A generalized mathematical theory of holor algebra is used to manipulate coefficient arrays needed to generate computational equations which involve elements from throughout the two-dimensional array rather than operating on individual rows and columns.