Mapping of discrete cosine transform (DCT) and discrete sine transform (DST) based on symmetries

被引:5
作者
Poornachandra, S [1 ]
Ravichandran, V
Kumaravel, N
机构
[1] SSN Coll Engn, Dept ECE, Madras, Tamil Nadu, India
[2] Shri Venkateswara Coll Engn, MCA Dept, Madras, Tamil Nadu, India
[3] Anna Univ, Sch ECE, Madras 600025, Tamil Nadu, India
关键词
quick discrete cosine transform; quick discrete sine transform; mapping; recursive structure; butterfly structure;
D O I
10.1080/03772063.2003.11416321
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页码:35 / 42
页数:8
相关论文
共 6 条
[1]   The quick Fourier transform: An FFT based on symmetries [J].
Guo, HT ;
Sitton, GA ;
Burrus, CS .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1998, 46 (02) :335-341
[2]   Fast recursive algorithms for short-time discrete cosine transform [J].
Kober, V ;
Cristobal, G .
ELECTRONICS LETTERS, 1999, 35 (15) :1236-1238
[3]   SYMMETRIC CONVOLUTION AND THE DISCRETE SINE AND COSINE TRANSFORMS [J].
MARTUCCI, SA .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1994, 42 (05) :1038-1051
[4]  
Rao K. R., 2014, Discrete cosine transform: algorithms, advantages, applications
[5]  
Strang G., 1999, DISCRETE COSINE TRAN
[6]  
WANG X, 1985, APPL MATH COMP, V16