A fast algorithm is presented which computes the two-dimensional Hartley transform. This algorithm is referred to as the split vector radix algorithm. It uses the decimation in frequency decomposition and, due to its in-place property, it does not require midmemory devices or matrix transposition. Its computational structure is simpler than that of the algorithm of L.Z. Chen (1983), and it is easy to program. Compared with the vector radix algorithm of R. Kumaresan and P.K. Gupta (1986), the proposed algorithm saves about 35% of the multiplication and 10% of the additions for the discrete Fourier transform (DFT) of a 4096*4096 real valued input sequence.<>
Split vector radix algorithm for two-dimensional Hartley transform
IEEE Transactions on Aerospace and Electronic Systems ; 27 , 6 ; 865-868
01.11.1991
288856 byte
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Direct split-radix algorithm for fast computation of type-II discrete Hartley transform
BASE | 2020
|Hartley Transform in Compression of Medical Ultrasonic Images
British Library Conference Proceedings | 1999
|British Library Online Contents | 2000
|