Title :
On fast Hartley transform algorithms
Author_Institution :
Stanford University, Stanford, CA
fDate :
7/1/1987 12:00:00 AM
Abstract :
This letter discusses the equivalence between the pre- and post-permutation algorithms for the fast Hartley transform (FHT). Some improvements are made to two recently published FHT programs.
Keywords :
Clutter; Equations; Filtering; Gaussian processes; Genetic mutations; Lattices; Radio access networks; Reflection; Signal processing algorithms; Spectral analysis;
Journal_Title :
Proceedings of the IEEE
DOI :
10.1109/PROC.1987.13830
