DocumentCode :
3251215
Title :
The matrix decomposition representation of DCT algorithms
Author :
Ouyang, Wanli ; Song, Dandan ; Xiao, Chuangbai ; Ju, Wenqi
Author_Institution :
Coll. of Comput. Sci. & Technol., Beijing Univ. of Technol., China
fYear :
2005
fDate :
7-10 Aug. 2005
Firstpage :
425
Abstract :
In this paper, the matrix multiplication theory is utilized to obtain Loeffler´s DCT algorithm and Feig´s DCT algorithm. In addition, the Feig´s algorithm is extended to other three forms. Utilizing matrix decomposition representation, the links and differences between the two algorithms are revealed. This decomposition representation helps understanding and further improving the algorithms using matrix theory.
Keywords :
discrete cosine transforms; matrix decomposition; matrix multiplication; Feig DCT algorithm; Loeffler DCT algorithm; discrete cosine transform; matrix decomposition representation; matrix multiplication; matrix theory; Computer science; Discrete cosine transforms; Educational institutions; Matrix decomposition; Paper technology; Signal processing algorithms; Transform coding; VLIW; Video compression; Video signal processing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 2005. 48th Midwest Symposium on
Print_ISBN :
0-7803-9197-7
Type :
conf
DOI :
10.1109/MWSCAS.2005.1594128
Filename :
1594128
Link To Document :
بازگشت