Mapping of Discrete Cosine Transform (DCT) and Discrete Sine Transform (DST) based on Symmetries
S. Poornachandra, V. Ravichandran, N. Kumaravel
Abstract
S. Poornachandra, V. Ravichandran, N. Kumaravel
Abstract
This paper discusses the generalized recursive structure for one-dimensional discrete cosine transform and discrete sine transform. This result in quicker computation of the discrete cosine and sine transform coefficients. The paper also looks at the relations among the family of discrete cosine and sine transforms and presents the mapping relationships for various discrete cosine and sine transforms. The results suggest that they can be utilized in various applications like data compression and VLSI implementations that utilize the quick discrete cosine transform and the quick discrete sine transform.
OpenAlex reports 8 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.
This paper discusses the generalized recursive structure for one-dimensional discrete cosine transform and discrete sine transform. This result in quicker computation of the discrete cosine and sine transform coefficients. The paper also looks at the relations among the family of discrete cosine and sine transforms and presents the mapping relationships for various discrete cosine and sine transforms. The results suggest that they can be utilized in various applications like data compression and VLSI implementations that utilize the quick discrete cosine transform and the quick discrete sine transform.
Key concepts: Discrete cosine transform, Discrete sine transform, Modified discrete cosine transform, Sine, Lapped transform, Transform coding, Mathematics, Trigonometric functions