ScholarLens Back to search
1990•Electronics LettersRequires access

Polynomial transform fast Hartley transform

S. C. Chan, K.L. Ho

Open publisher page 7 citations

Abstract

A fast algorithm for computing the two-dimensional discrete Hartley transform (2D-DHT) based on the polynomial transform is presented. Using a simple relation between the discrete Fourier transform (DFT) and the DHT, it is found that the 2D-DHT can be mapped, by means of the polynomial transform, to a number of one-dimension type III discrete W transforms (DWT-III). An improved fast algorithm for computing the DWT-III is also proposed.

About this research paper

What this paper is about

A fast algorithm for computing the two-dimensional discrete Hartley transform (2D-DHT) based on the polynomial transform is presented. Using a simple relation between the discrete Fourier transform (DFT) and the DHT, it is found that the 2D-DHT can be mapped, by means of the polynomial transform, to a number of one-dimension type III discrete W transforms (DWT-III). An improved fast algorithm for computing the DWT-III is also proposed.

Why it matters

OpenAlex reports 7 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

A fast algorithm for computing the two-dimensional discrete Hartley transform (2D-DHT) based on the polynomial transform is presented. Using a simple relation between the discrete Fourier transform (DFT) and the DHT, it is found that the 2D-DHT can be mapped, by means of the polynomial transform, to a number of one-dimension type III discrete W transforms (DWT-III). An improved fast algorithm for computing the DWT-III is also proposed.

Key concepts: Discrete Hartley transform, Hartley transform, Discrete Fourier transform (general), Discrete sine transform, Mathematics, Fractional Fourier transform, Rader's FFT algorithm, Polynomial

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Polynomial transform fast Hartley transform — Research Paper | ScholarLens