DocumentCode
2265815
Title
Recursive algorithm for the discrete cosine transform with regular structure
Author
Wang, Zhongde ; Jullien, G.A. ; Miller, W.C.
Author_Institution
VLSI Res. Group, Windsor Univ., Ont., Canada
fYear
1993
fDate
16-18 Aug 1993
Firstpage
1097
Abstract
In this paper we derive a new recursive algorithm for the discrete cosine transform (RDCT) which differs from the existing RDCT in the following aspects: (1) No shifts of data are required within our algorithm; (2) only regular Cooley-Tukey type butterfly structures are involved; (3) the multiplication coefficients in our algorithm can be generated by a simple recursion without a requirement for trigonometric functions. The structure of the new algorithm is almost identical to that of Lee´s FCT, which is widely thought to be the simplest
Keywords
discrete cosine transforms; encoding; recursive functions; Cooley-Tukey type butterfly structures; RDCT; discrete cosine transform; multiplication coefficients; recursive algorithm; regular structure; Discrete cosine transforms; Discrete transforms; Equations; Image coding; Indexing; Karhunen-Loeve transforms; Markov processes; Phase modulation; Signal processing; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1993., Proceedings of the 36th Midwest Symposium on
Conference_Location
Detroit, MI
Print_ISBN
0-7803-1760-2
Type
conf
DOI
10.1109/MWSCAS.1993.343277
Filename
343277
Link To Document