Fast Hartley Transform and Its Application to the Image Recontruction

The Fast Hartley Transform(FHT) is firstly introduced to the astronomical data processing and the FHT Algorithm routine is given for computing the Discrete Hartley Transform(DHT).FHT is similiar to Cooley-Tukey's FFT,but the former is much faster than the latter.The Discrete Fourier Transform(DFT) can be derived from FHT by means of the relationship between DFT and DHT.Therefore,FHT will be widely applied to the spectral analysis,the calculation of the correlation function and convolution and the image processing.