Fast 3-D decimation-in-frequency algorithm for 3-D Hartley transform

Authors:
O. Alshibami;S. Boussakta
Affiliations:
Institute of Integrated Information Systems, School of Electronic and Electrical Engineering, The University of Leeds, Leeds, LS2 9JT, UK;Institute of Integrated Information Systems, School of Electronic and Electrical Engineering, The University of Leeds, Leeds, LS2 9JT, UK
Venue:
Signal Processing
Year:
2002

Citing 1
Cited 2

The Hartley transform

The Hartley transform

Fast communication: Radix-2 algorithm for the fast computation of type-III 3-D discrete W transform

Signal Processing
A novel split-radix fast algorithm for 2-D discrete Hartley transform

IEEE Transactions on Circuits and Systems Part I: Regular Papers

Quantified Score

Hi-index	0.08

Visualization

Abstract

The three-dimensional discrete Hartley transform (3-D DHT) has been applied in a wide range of 3-D applications such as 3-D power spectrum analysis, 3-D filtering, and medical applications, etc. In this paper, a three-dimensional algorithm for fast computation of the three-dimensional discrete Hartley transform is developed. The mathematical concept and derivation is presented and the arithmetic complexity is analysed and compared to the familiar row-column approach. It is found that this algorithm offers substantial savings in both the number of multiplications and additions.