Open AccessTwo‐band fast Hartley transform
Author(s) -
Skodras A.N.,
Aburdene M.F.,
Nandi A.K.
Publication year - 2015
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/el.2014.3170
Subject(s) - discrete hartley transform , fast fourier transform , hartley transform , discrete fourier transform (general) , split radix fft algorithm , prime factor fft algorithm , shuffling , computer science , cyclotomic fast fourier transform , algorithm , computation , discrete sine transform , rader's fft algorithm , inverse , arithmetic , fractional fourier transform , fourier transform , mathematics , fourier analysis , mathematical analysis , geometry , programming language
Efficient algorithms have been developed over the past 30 years for computing the forward and inverse discrete Hartley transforms (DHTs). These are similar to the fast Fourier transform (FFT) algorithms for computing the discrete Fourier transform (DFT). Most of these methods seek to minimise the complexity of computations and/or the number of operations. A new approach for the computation of the radix‐2 fast Hartley transform (FHT) is presented. The proposed algorithm, based on a two‐band decomposition of the input data, possesses a very regular structure, avoids the input or out data shuffling, requires slightly less multiplications than the existing approaches, but increases the number of additions.