Improved FHT Algorithms for Fast Computation of the Discrete Hartley Transform
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 st...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Tikrit University
2013-05-01
|
| Series: | Tikrit Journal of Engineering Sciences |
| Subjects: | |
| Online Access: | http://www.tj-es.com/ojs/index.php/tjes/article/view/415 |
| Summary: | 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. |
|---|---|
| ISSN: | 1813-162X 2312-7589 |