ScholarLens Back to search
1986•Electronics LettersRequires access

Fast computation of discrete cosine transform through fast Hartley transform

H.S. Malvar

Open publisher page 73 citations

Abstract

A relationship between the discrete cosine transform (DCT) and the discrete Hartley transform (DHT) is derived. It leads to a new fast and numerically stable algorithm for the DCT.

About this research paper

What this paper is about

A relationship between the discrete cosine transform (DCT) and the discrete Hartley transform (DHT) is derived. It leads to a new fast and numerically stable algorithm for the DCT.

Why it matters

OpenAlex reports 73 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 relationship between the discrete cosine transform (DCT) and the discrete Hartley transform (DHT) is derived. It leads to a new fast and numerically stable algorithm for the DCT.

Key concepts: Discrete Hartley transform, Discrete cosine transform, Discrete sine transform, Hartley transform, Lapped transform, Discrete Fourier transform (general), Modified discrete cosine transform, Transform coding

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Fast computation of discrete cosine transform through fast Hartley transform — Research Paper | ScholarLens