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...

Full description

Bibliographic Details
Main Author: M. T. Hamood
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

Similar Items