ScholarLens Back to search
1992•Journal of Biomedical EngineeringRequires access

Running discrete cosine transform

H. Olkkonen

Open publisher page 4 citations

Abstract

The discrete cosine transform (DCT) has become an important tool in digital signal processing because its performance is close to the optimal Karhunen-Loeve transform. In this work the running discrete cosine transform (RDCT) is introduced. Using the properties of the discrete Fourier transform kernel W = exp (-2 pi j/N), a fast recursive algorithm was developed for real-time computation of the RDCT coefficients. For N-point RDCT the present algorithm needs only 2N real multiplications. The hardware implementations of the RDCT algorithm and applications in real-time data processing are discussed.

About this research paper

What this paper is about

The discrete cosine transform (DCT) has become an important tool in digital signal processing because its performance is close to the optimal Karhunen-Loeve transform. In this work the running discrete cosine transform (RDCT) is introduced. Using the properties of the discrete Fourier transform kernel W = exp (-2 pi j/N), a fast recursive algorithm was developed for real-time computation of the RDCT coefficients. For N-point RDCT the present algorithm needs only 2N real multiplications. The hardware implementations of the RDCT algorithm and applications in real-time data processing are discussed.

Why it matters

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

The discrete cosine transform (DCT) has become an important tool in digital signal processing because its performance is close to the optimal Karhunen-Loeve transform. In this work the running discrete cosine transform (RDCT) is introduced. Using the properties of the discrete Fourier transform kernel W = exp (-2 pi j/N), a fast recursive algorithm was developed for real-time computation of the RDCT coefficients. For N-point RDCT the present algorithm needs only 2N real multiplications. The hardware implementations of the RDCT algorithm and applications in real-time data processing are discussed.

Key concepts: Discrete cosine transform, Discrete Hartley transform, Modified discrete cosine transform, Discrete sine transform, Lapped transform, Discrete Fourier transform (general), Algorithm, Computer science

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Running discrete cosine transform — Research Paper | ScholarLens