ScholarLens Back to search
1998•IEEE Transactions on Circuits and Systems II Analog and Digital Signal ProcessingRequires access

Recursive formulation of short-time discrete trigonometric transforms

José Antonio Rosendo Macías, A.G. Exposito

Open publisher page 12 citations

Abstract

Recursive formulations of the moving-window discrete Fourier transform (DFT) are well known. However, recursive versions of other useful discrete transforms, like the moving-window discrete cosine transform (DCT), discrete sine transform (DST), or discrete Hartley transform (DHT), have not been developed so far. In this paper, second-order recursive expressions for the DCT, DST, and DHT, intended for real-valued windowed sequences, are presented.

About this research paper

What this paper is about

Recursive formulations of the moving-window discrete Fourier transform (DFT) are well known. However, recursive versions of other useful discrete transforms, like the moving-window discrete cosine transform (DCT), discrete sine transform (DST), or discrete Hartley transform (DHT), have not been developed so far. In this paper, second-order recursive expressions for the DCT, DST, and DHT, intended for real-valued windowed sequences, are presented.

Why it matters

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

Recursive formulations of the moving-window discrete Fourier transform (DFT) are well known. However, recursive versions of other useful discrete transforms, like the moving-window discrete cosine transform (DCT), discrete sine transform (DST), or discrete Hartley transform (DHT), have not been developed so far. In this paper, second-order recursive expressions for the DCT, DST, and DHT, intended for real-valued windowed sequences, are presented.

Key concepts: Discrete Hartley transform, Discrete sine transform, Discrete cosine transform, Discrete Fourier transform (general), Modified discrete cosine transform, Hartley transform, Mathematics, Sine

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Recursive formulation of short-time discrete trigonometric transforms — Research Paper | ScholarLens