低面积-时间复杂度的离散余弦变换脉动结构  

Systolic structure for DCT with low area-time complexity

作　　者：曹晓阳[1] 潘赟[1] 严晓浪[1] 宦若虹[2] 

机构地区：[1]浙江大学超大规模集成电路设计研究所,浙江杭州310027 [2]浙江工业大学计算机科学与技术学院,浙江杭州310023

出　　处：《浙江大学学报（工学版）》2011年第4期656-659,共4页Journal of Zhejiang University：Engineering Science

基　　金：国家自然科学基金资助项目(60720106003);国家"863"高技术研究发展计划资助项目(2009AA011706);中央高校基本科研业务费专项资金资助项目

摘　　要：为了研究脉动结构在离散余弦变换(DCT)算法中的应用以及平衡DCT算法在超大规模集成电路(VLSI)实现中对面积复杂度和时间复杂度的要求,提出一种基于脉动阵列的DCT结构.研究一维DCT变换的特点,对DCT进行公式变形.充分挖掘DCT算法中可以重复利用的数据,从而减少运算量.针对变形后的算法特点,采用脉动结构进行求解,从而提高并行度,减少运算时间.结果表明,相对于现有的脉动结构,该结构具有更小的面积-时间复杂度(area-time complexity),对DCT长度的限制小,仅要求DCT变换的长度为偶数.A systolic-array based discrete cosine transform （DCT） was proposed in order to study the application of systolic array in DCT and balance the area complexity and time complexity in the very large scale integrated-circuit （VLSI） implementation of DCT. The characteristic of DCT was analyzed and the one-dimensional DCT formula was transformed. The data items that can be reused were found to reduce computation. The systolic structure which can save computing time by higher parallelism was used to solve the deformed DCT algorithm. Results show that the structure has lower area-time complexity than the previous systolic-array based structures, and has a smaller restriction on the length of DCT, only requiring an even number.

关 键 词：离散余弦变换(DCT) 脉动结构 复杂度 超大规模集成电路(VLSI) 

分 类 号：TP302[自动化与计算机技术—计算机系统结构]