1990GeophysicsRequires access

The use of the Hartley transform in geophysical applications

R. Saatçılar, Semih Ergintav, N. Canitez

Open publisher page 29 citations

Abstract

Abstract The Hartley transform (HT) is an integral transform similar to the Fourier transform (FT). It has most of the characteristics of the FT. Several authors have shown that fast algorithms can be constructed for the fast Hartley transform (FHT) using the same structures as for the fast Fourier transform. However, the HT is a real transform and for this reason, since one complex multiplication requires four real multiplications, the discrete HT (DHT) is computationally faster than the discrete FT (DFT). Consequently, any process requiring the DFT (such as amplitude and phase spectra) can be performed faster by using the DHT.The general properties of the DHT are reviewed first, and then an attempt is made to use the FHT in some seismic data processing techniques such as one-dimensional filtering, forward seismic modeling, and migration. The experiments show that the Hartley transform is two times faster than the Fourier transform.

About this research paper

What this paper is about

Abstract The Hartley transform (HT) is an integral transform similar to the Fourier transform (FT). It has most of the characteristics of the FT. Several authors have shown that fast algorithms can be constructed for the fast Hartley transform (FHT) using the same structures as for the fast Fourier transform. However, the HT is a real transform and for this reason, since one complex multiplication requires four real multiplications, the discrete HT (DHT) is computationally faster than the discrete FT (DFT). Consequently, any process requiring the DFT (such as amplitude and phase spectra) can be performed faster by using the DHT.The general properties of the DHT are reviewed first, and then an attempt is made to use the FHT in some seismic data processing techniques such as one-dimensional filtering, forward seismic modeling, and migration. The experiments show that the Hartley transform is two times faster than the Fourier transform.

Why it matters

OpenAlex reports 29 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract The Hartley transform (HT) is an integral transform similar to the Fourier transform (FT). It has most of the characteristics of the FT. Several authors have shown that fast algorithms can be constructed for the fast Hartley transform (FHT) using the same structures as for the fast Fourier transform. However, the HT is a real transform and for this reason, since one complex multiplication requires four real multiplications, the discrete HT (DHT) is computationally faster than the discrete FT (DFT). Consequently, any process requiring the DFT (such as amplitude and phase spectra) can be performed faster by using the DHT.The general properties of the DHT are reviewed first, and then an attempt is made to use the FHT in some seismic data processing techniques such as one-dimensional filtering, forward seismic modeling, and migration. The experiments show that the Hartley transform is two times faster than the Fourier transform.

Key concepts: Hartley transform, Discrete Hartley transform, Discrete Fourier transform (general), Fractional Fourier transform, S transform, Fourier transform, Discrete sine transform, Algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
The use of the Hartley transform in geophysical applications — Research Paper | ScholarLens