ScholarLens Back to search
1989•Electronics LettersRequires access

New fast algorithm for two-dimensional discrete Fourier transform DFT(2 n ; 2)

Weizhen Ma, Dekun Yang

Open publisher page 8 citations

Abstract

We present a new fast algorithm for computing the two-dimensional discrete Fourier transform DFT(2n; 2) using the fast discrete cosine transform algorithm. The algorithm has a lower number of multiplications and additions compared with other published algorithms for computing the two-dimensional DFT. Because it uses only real multiplications, the algorithm is more suitable for real input data.

About this research paper

What this paper is about

We present a new fast algorithm for computing the two-dimensional discrete Fourier transform DFT(2n; 2) using the fast discrete cosine transform algorithm. The algorithm has a lower number of multiplications and additions compared with other published algorithms for computing the two-dimensional DFT. Because it uses only real multiplications, the algorithm is more suitable for real input data.

Why it matters

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

We present a new fast algorithm for computing the two-dimensional discrete Fourier transform DFT(2n; 2) using the fast discrete cosine transform algorithm. The algorithm has a lower number of multiplications and additions compared with other published algorithms for computing the two-dimensional DFT. Because it uses only real multiplications, the algorithm is more suitable for real input data.

Key concepts: Discrete Fourier transform (general), Discrete sine transform, Discrete Hartley transform, Cyclotomic fast Fourier transform, Discrete cosine transform, Algorithm, Prime-factor FFT algorithm, Fast Fourier transform

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
New fast algorithm for two-dimensional discrete Fourier transform DFT(2 n ; 2) — Research Paper | ScholarLens