The Matrix decomposition representation of DCT algorithms - 文章详情页

作者：

Wanli, Ouyang (Wanli, Ouyang.) | Dandan, Song (Dandan, Song.) | Chuangbai, Xiao (Chuangbai, Xiao.) | Wenqi, Ju (Wenqi, Ju.)

收录：

EI Scopus

摘要：

In　his　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.　©　2005　IEEE.

关键词：

Algorithms Computational complexity Mathematical operators Matrix algebra Optimization

作者机构：

[ 1 ] [Wanli, Ouyang]College of Computer Science and Technology, Beijing University of Technology, Beijing, 100022, China
[ 2 ] [Dandan, Song]College of Computer Science and Technology, Beijing University of Technology, Beijing, 100022, China
[ 3 ] [Chuangbai, Xiao]College of Computer Science and Technology, Beijing University of Technology, Beijing, 100022, China
[ 4 ] [Wenqi, Ju]College of Computer Science and Technology, Beijing University of Technology, Beijing, 100022, China

通讯作者信息：

电子邮件地址：

wanli21@emails.bjut.edu.cn

查看成果更多字段

成果类型
所属机构

所有年份指定年份从至