A Fast Algorithm for Two Dimension Discrete Cosine Transform
Huang Hua-can
Abstract
Huang Hua-can
Abstract
This paper studies the relation between the discrete cosine transform(DCT) and the discrete hartley transform(DHT).A fast algorithm to calculate the coefficient on two dimension discrete cosine transform(2DDCT) is proposed based on the algorithm of DHT.The new algorithm reduces the complexity of the 2DDCT,and sharply enhances its velocity.
A significance statement is not available in the OpenAlex record.
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.
This paper studies the relation between the discrete cosine transform(DCT) and the discrete hartley transform(DHT).A fast algorithm to calculate the coefficient on two dimension discrete cosine transform(2DDCT) is proposed based on the algorithm of DHT.The new algorithm reduces the complexity of the 2DDCT,and sharply enhances its velocity.
Key concepts: Discrete cosine transform, Discrete Hartley transform, Discrete sine transform, Modified discrete cosine transform, Lapped transform, Dimension (graph theory), Discrete Fourier transform (general), Mathematics