Implementation and Performance of the Fast Hartley Transform

Authors:
Tho Le-Ngoc;Minh Tue Vo
Affiliations:
-;-
Venue:
IEEE Micro
Year:
1989

Citing 3
Cited 2

The Hartley transform

The Hartley transform
Six DSP processors tackle high-end signal-processing applications

Computer Design
Implementation of fast Fourier transform algorithms with the TMS32020

Digital signal processing applications with the TMS320 family; Vol. 1

Efficient Fast Hartley Transform Algorithms for Hypercube-Connected Multicomputers

IEEE Transactions on Parallel and Distributed Systems
Time-frequency localization with the Hartley S-transform

Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The authors investigated the implementation aspects of the fast Hartley transform (FHT) in both software and hardware. They describe the modifications required to convert existing fast Fourier transform (FFT) programs to execute FHTs, showing the ease with which these modifications can be implemented. They compare execution time and memory storage requirements of both transforms and present power spectrum calculation and convolution as illustrative examples to compare the performances of the two transform techniques. They also give a comparative survey of the performances of various microprocessors and digital signal processors in FFT and FHT computation.