Number Theory in Digital Signal Processing
Number Theory in Digital Signal Processing
IEEE Transactions on Computers
Efficient Fast Hartley Transform Algorithms for Hypercube-Connected Multicomputers
IEEE Transactions on Parallel and Distributed Systems
A VLSI Constant Geometry Architecture for the Fast Hartley and Fourier Transforms
IEEE Transactions on Parallel and Distributed Systems
Moment-based fast discrete Hartley transform
Signal Processing - Special section: Hans Wilhelm Schüßler celebrates his 75th birthday
Interesting properties of the discrete cosine transform
Journal of Visual Communication and Image Representation
Fiber hartley transform and optical indirect computation of discrete cosine transform
IEEE Transactions on Communications
Sub µW noise reduction for CIC hearing aids
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 14.99 |
The fast Hartley transform (FHT) is similar to the Cooley-Tukey fast Fourier transform (FFT) but performs much faster because it requires only real arithmetic computations compared to the complex arithmetic computations required by the FFT. Through use of the FHT, discrete cosine transforms (DCT) and discrete Fourier transforms (DFT) can be obtained. The recursive nature of the FHT algorithm derived in this paper enables us to generate the next higher order FHT from two identical lower order FHT's. In practice, this recursive relationship offers flexibility in programming different sizes of transforms, while the orderly structure of its signal flow-graphs indicates an ease of implementation in VLSI.