Mounir Taha Hamood
Department of Electrical Engineering Collage of Engineering Tikrit University Tikrit P O Box 42 Iraq

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

Fast Algorithm for Computing the Discrete Hartley Transform of Type-II Mounir Taha Hamood
Indonesian Journal of Electrical Engineering and Informatics (IJEEI) Vol 4, No 2: June 2016
Publisher : IAES Indonesian Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (572.264 KB) | DOI: 10.52549/ijeei.v4i2.220

Abstract

The generalized discrete Hartley transforms (GDHTs) have proved to be an efficient alternative to the generalized discrete Fourier transforms (GDFTs) for real-valued data applications. In this paper, the development of direct computation of radix-2 decimation-in-time (DIT) algorithm for the fast calculation of the GDHT of type-II (DHT-II) is presented. The mathematical analysis and the implementation of the developed algorithm are derived, showing that this algorithm possesses a regular structure and can be implemented in-place for efficient memory utilization.The performance of the proposed algorithm is analyzed and the computational complexity is calculated for different transform lengths. A comparison between this algorithm and existing DHT-II algorithms shows that it can be considered as a good compromise between the structural and computational complexities.