DocumentCode
696738
Title
3-D vector radix algorithm for the 3-D discrete Hartley transform
Author
Alshibami, O. ; Boussakta, S.
Author_Institution
Institute of Integrated Information Systems, School of Electronic and Electrical Engineering, The University of Leeds, Leeds LS2 9JT, UK
fYear
2000
fDate
4-8 Sept. 2000
Firstpage
1
Lastpage
4
Abstract
The three-dimensional discrete Hartley transform (3-D DHT) has been proposed as an alternative tool to the 3-D discrete Fourier transform (3-D DFT) for 3-D applications when the data is real. The 3-D DHT has been applied in many three-dimensional image and multidimensional signal processing applications. This paper presents a fast three-dimensional algorithm for computing the 3-D DHT. The mathematical development of this algorithm is introduced and the arithmetic complexity is analysed and compared to related algorithms. Based on a single butterfly implementation, this algorithm is found to offer substantial savings in the total number of multiplications and additions over the familiar row-column approach.
Keywords
Algorithm design and analysis; Complexity theory; Discrete Fourier transforms; Multidimensional signal processing; Signal processing algorithms; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Processing Conference, 2000 10th European
Conference_Location
Tampere, Finland
Print_ISBN
978-952-1504-43-3
Type
conf
Filename
7075359
Link To Document