ePrints

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

Lookup NU author(s): Professor Said Boussakta

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

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.

Publication metadata

Author(s): Boussakta S; Alshibami O

Publication type: Article

Publication status: Published

Journal: Signal Processing

Year: 2002

Volume: 82

Issue: 1

Pages: 121-126

ISSN (print): 0165-1684

ISSN (electronic): 1872-7557

Publisher: Elsevier BV

URL: http://dx.doi.org/10.1016/S0165-1684(01)00102-5

DOI: 10.1016/S0165-1684(01)00102-5

Altmetrics

Share