DocumentCode :
3239292
Title :
An efficient three-dimensional decimation-in-time FHT algorithm based on the radix-2/4 approach
Author :
Bouguezel, Saad ; Ahmad, M. Omair ; Swamy, M.N.S.
Author_Institution :
Dept. of Electr. & Comput. Eng., Concordia Univ., Montreal, Que., Canada
fYear :
2004
fDate :
18-21 Dec. 2004
Firstpage :
52
Lastpage :
55
Abstract :
In this paper, a decimation-in-time (DIT) fast Hartley transform (FHT) algorithm is proposed for efficient computation of the three-dimensional (3-D) discrete Hartley transform (DHT). It is based on a mixture of radix-(2×2×2) and radix-(4×4×4) index maps. The proposed algorithm substantially reduces the number of arithmetic operations compared to the existing 3-D radix-(2×2×2) FHT algorithms.
Keywords :
digital arithmetic; discrete Hartley transforms; signal processing; DHT; DIT; FHT; arithmetic operation; decimation-in-time; fast Hartley transform algorithm; index map; three-dimensional discrete Hartley transform; Arithmetic; Computational complexity; Discrete transforms; Two dimensional displays;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Signal Processing and Information Technology, 2004. Proceedings of the Fourth IEEE International Symposium on
Print_ISBN :
0-7803-8689-2
Type :
conf
DOI :
10.1109/ISSPIT.2004.1433686
Filename :
1433686
Link To Document :
بازگشت