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...
| Autor principal: | |
|---|---|
| Format: | Article |
| Idioma: | English |
| Publicat: |
Tikrit University
2013-03-01
|
| Col·lecció: | Tikrit Journal of Engineering Sciences |
| Matèries: | |
| Accés en línia: | https://tj-es.com/ojs/index.php/tjes/article/view/388 |