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

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 Hartl...

Full description

Saved in:
Bibliographic Details
Published in:Signal processing 2002, Vol.82 (1), p.121-126
Main Authors: Alshibami, O., Boussakta, S.
Format: Article
Language:English
Subjects:
Applied sciences
Exact sciences and technology
Information, signal and communications theory
Mathematical methods
Telecommunications and information theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0165-1684
1872-7557
DOI:10.1016/S0165-1684(01)00102-5