- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
Improved FHT Algorithms for Fast Computation of the Discrete Hartley Transform | ||
| Tikrit Journal of Engineering Sciences | ||
| Article 1, Volume 20, Issue 1, 2013, Pages 62-69 PDF (0 K) | ||
| Author | ||
| Mounir Taha Hamood | ||
| 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. | ||
| Keywords | ||
| signal; discrete Hartley transform; Real; valued fast Fourier transform; RFFT; fast transform algorithms | ||
|
Statistics Article View: 167 PDF Download: 122 |
||