We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
New Decimation-in-Time Fast Hartley Transform Algorithm.
- Authors
Hamood, Mounir T.
- Abstract
This paper presents a new algorithm for fast calculation of the discrete Hartley transform (DHT) based on decimation-in-time (DIT) approach. The proposed radix -2² fast Hartley transform (FHT) DIT algorithm has a simple butterfly structure that offers flexibility for various powers-of-two transform lengths, significantly reducing the computational complexity with regular bit reversing order for the output sequence. The algorithm is derived through the three-dimensional index mapping approach and by incorporating two stages of the signal flow graph into an integrated butterfly. The algorithm is implemented and its arithmetic complexity has been analysed and compared with the current FHT algorithms, revealing that it is substantially minimize the structural complexity with better indexing arrangement that is suitable for efficient implementation.
- Subjects
HARTLEY transform algorithms; COMPUTATIONAL complexity; GRAPH theory; DISCRETE Hartley transforms; INDEX maps
- Publication
International Journal of Electrical & Computer Engineering (2088-8708), 2016, Vol 6, Issue 4, p1654
- ISSN
2088-8708
- Publication type
Article
- DOI
10.11591/ijece.v6i4.10469