Fast computation of the discrete cosine transform and the discrete Hartley transform
H.S. Malvar
Abstract
H.S. Malvar
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.
OpenAlex reports 77 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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