Fast Algorithm for Computing the Discrete Hartley Transform of Type-II
| Autor: | Mounir T. Hamood |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Control and Optimization
Theoretical computer science Computer Networks and Communications Computer science Fast Fourier transform Generalized discrete Hartley transforms (GDHTs) Discrete Hartley transform Discrete Fourier transform symbols.namesake Cyclotomic fast Fourier transform discrete Hartley transform of type-II (DHT-II) Artificial Intelligence fast transform algorithms Hartley transform Computer Science (miscellaneous) Electrical and Electronic Engineering Prime-factor FFT algorithm Discrete sine transform Hardware and Architecture Control and Systems Engineering Rader's FFT algorithm symbols lcsh:Electrical engineering. Electronics. Nuclear engineering lcsh:TK1-9971 Algorithm Information Systems |
| Zdroj: | Indonesian Journal of Electrical Engineering and Informatics, Vol 4, Iss 2, Pp 120-125 (2016) |
| ISSN: | 2089-3272 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|