| Paper: | DISPS-P1.7 | ||
| Session: | VLSI Architectures and Algorithms for Image and Video Processing | ||
| Time: | Tuesday, May 16, 14:00 - 16:00 | ||
| Presentation: | Poster | ||
| Topic: | Design and Implementation of Signal Processing Systems: Fast Algorithms | ||
| Title: | Matrix Factorization for Fast DCT Algorithms | ||
| Authors: | Wenjia Yuan, Peking University, China; Pengwei Hao, Queen Mary, University of London, United Kingdom; Chao Xu, Peking University, China | ||
| Abstract: | Two principles to produce new possibilities for the radix-2 Discrete Cosine Transform (DCT) have been presented in this paper. One is to employ matrix factorization through revealing the intrinsic relationship among several existing famous algorithms, which is regarded as an effective guide for exploring new algorithms. The other is to make use of the orthogonal property of the DCT matrix. As long as the recursive kernel of an algorithm is orthogonal, there must be a twin fast DCT algorithm of it. Matrix factorization is applied through the research and can be used to show how data flows and compute the computational complexity easily. At the end of this paper, we also present a new fast algorithm for DCT. It enjoys the parallel structure which is simpler for programming and hardware implementation and keeps the same numbers of the additions and multiplications as the fastest algorithms. | ||
©2018 Conference Management Services, Inc. -||- email: webmaster@icassp2006.org -||- Last updated Friday, August 17, 2012