1994Proceedings of the IEEERequires access

A comparative review of real and complex Fourier-related transforms

Okan K. Ersoy

Open publisher page 52 citations

Abstract

Major continuous-time, discrete-time, and discrete Fourier-related transforms as well as Fourier-related series are discussed both with real and complex kernels. The complex Fourier transforms, Fourier series, cosine, sine, Hartley, Mellin, Laplace transforms, and z-transforms are covered on a comparative basis. Generalizations of the Fourier transform kernel lead to a number of novel transforms, in particular, special discrete cosine, discrete sine, and real discrete Fourier transforms, which have already found use in a number of applications. The fast algorithms for the real discrete Fourier transform provide a unified approach for the optimal fast computation of all discrete Fourier-related transforms. The short-time Fourier-related transforms are discussed for applications involving nonstationary signals. The one-dimensional transforms discussed are also extended to the two-dimensional transforms.>

About this research paper

What this paper is about

Major continuous-time, discrete-time, and discrete Fourier-related transforms as well as Fourier-related series are discussed both with real and complex kernels. The complex Fourier transforms, Fourier series, cosine, sine, Hartley, Mellin, Laplace transforms, and z-transforms are covered on a comparative basis. Generalizations of the Fourier transform kernel lead to a number of novel transforms, in particular, special discrete cosine, discrete sine, and real discrete Fourier transforms, which have already found use in a number of applications. The fast algorithms for the real discrete Fourier transform provide a unified approach for the optimal fast computation of all discrete Fourier-related transforms. The short-time Fourier-related transforms are discussed for applications involving nonstationary signals. The one-dimensional transforms discussed are also extended to the two-dimensional transforms.>

Why it matters

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

Major continuous-time, discrete-time, and discrete Fourier-related transforms as well as Fourier-related series are discussed both with real and complex kernels. The complex Fourier transforms, Fourier series, cosine, sine, Hartley, Mellin, Laplace transforms, and z-transforms are covered on a comparative basis. Generalizations of the Fourier transform kernel lead to a number of novel transforms, in particular, special discrete cosine, discrete sine, and real discrete Fourier transforms, which have already found use in a number of applications. The fast algorithms for the real discrete Fourier transform provide a unified approach for the optimal fast computation of all discrete Fourier-related transforms. The short-time Fourier-related transforms are discussed for applications involving nonstationary signals. The one-dimensional transforms discussed are also extended to the two-dimensional transforms.>

Key concepts: Sine and cosine transforms, Discrete Fourier transform (general), Discrete-time Fourier transform, Fourier sine and cosine series, Discrete sine transform, Discrete Hartley transform, Fourier transform, Discrete Fourier series

Related papers

Back to paper searchBrowse research topicsOriginal source
A comparative review of real and complex Fourier-related transforms — Research Paper | ScholarLens