Abstract
In this paper, by using the symmetrical properties of the discrete Hartley transform (DHT), an improved radix-2 fast Hartley transform (FHT) algorithm with arithmetic complexity comparable to that of the real-valued fast Fourier transform (RFFT) is developed. It has a simple and regular butterfly structure and possesses the in-place computation property. Furthermore, using the same principles, the development can be extended to more efficient radix-based FHT algorithms. An example for the improved radix-4 FHT algorithm is given to show the validity of the presented method. The arithmetic complexity for the new algorithms are computed and then compared with the existing FHT algorithms. The results of these comparisons have shown that the developed algorithms reduce the number of multiplications and additions considerably.
Reference15 articles.
1. R. N. Bracewell, “Discrete Hartley Transform,” Journal of the Optical Society of America vol. 73, pp. 1832- 1835, 1983.
2. R. N. Bracewell, “The Hartley transform,” Oxford University Press, Inc., 1986.
3. O. K. Ersoy and N. C. Hu, “Fast algorithms for the real discrete Fourier transform,” in International Conference on Acoustics, Speech, and Signal Processing, ICASSP-88., 1988, pp. 1902-1905 vol.3.
4. H. Sorensen, D. Jones, M. Heideman, and C. Burrus, “Real-valued fast Fourier transform algorithms,” IEEE Transactions on Acoustics, Speech and Signal Processing, vol. 35, pp. 849-863, 1987.
5. R. N. Bracewell, “The fast Hartley transform,” Proceedings of the IEEE,vol. 72, pp. 1010-1018, 1984.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献