1987IEEE Transactions on Acoustics Speech and Signal ProcessingRequires access

Fast computation of the discrete cosine transform and the discrete Hartley transform

H.S. Malvar

Open publisher page 77 citations

Abstract

A new factorization of the discrete Hartley transform (DHT) is presented. It is used to derive new algorithms for the DHT and the discrete cosine transform (DCT) with reduced number of multiplications.

About this research paper

What this paper is about

A new factorization of the discrete Hartley transform (DHT) is presented. It is used to derive new algorithms for the DHT and the discrete cosine transform (DCT) with reduced number of multiplications.

Why it matters

OpenAlex reports 77 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 new factorization of the discrete Hartley transform (DHT) is presented. It is used to derive new algorithms for the DHT and the discrete cosine transform (DCT) with reduced number of multiplications.

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

Related papers

Back to paper searchBrowse research topicsOriginal source
Fast computation of the discrete cosine transform and the discrete Hartley transform — Research Paper | ScholarLens