Please wait a minute...
浙江大学学报(工学版)
J4  2011, Vol. 45 Issue (4): 656-659    DOI: 10.3785/j.issn.1008-973X.2011.04.011
自动化技术、电信技术     
低面积-时间复杂度的离散余弦变换脉动结构
曹晓阳1, 潘赟1, 严晓浪1, 宦若虹2
1.浙江大学 超大规模集成电路设计研究所,浙江 杭州 310027； 2.浙江工业大学 计算机科学与技术学院，浙江 杭州 310023
Systolic structure for DCT with low area-time complexity
CAO Xiao-yang1, PAN Yun1, YAN Xiao-lang1, HUAN Ruo-hong2
1. Institute of VLSI Design, Zhejiang University, Hangzhou 310027, China; 2. College of Computer Science
and Technology, Zhejiang University of Technology, Hangzhou 310023, China
 全文: PDF  HTML
摘要：

为了研究脉动结构在离散余弦变换(DCT)算法中的应用以及平衡DCT算法在超大规模集成电路(VLSI)实现中对面积复杂度和时间复杂度的要求,提出一种基于脉动阵列的DCT结构.研究一维DCT变换的特点,对DCT进行公式变形.充分挖掘DCT算法中可以重复利用的数据,从而减少运算量.针对变形后的算法特点,采用脉动结构进行求解,从而提高并行度,减少运算时间.结果表明,相对于现有的脉动结构,该结构具有更小的面积-时间复杂度(area-time complexity),对DCT长度的限制小,仅要求DCT变换的长度为偶数.
Abstract:

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.
出版日期: 2011-05-05
:  TP 302  
基金资助:

国家自然科学基金资助项目(60720106003)；国家“863”高技术研究发展计划资助项目（2009AA011706）；中央高校基本科研业务费专项资金资助项目.
通讯作者: 潘赟,男,副教授.     E-mail: panyun@vlsi.zju.edu.cn
作者简介: 曹晓阳(1987—),男,河南孟州人,硕士生,从事集成电路设计及研究.E-mail:caoxy@vlsi.zju.edu.cn
服务　　
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章　　

引用本文:

曹晓阳, 潘赟, 严晓浪, 宦若虹. 低面积-时间复杂度的离散余弦变换脉动结构[J]. J4, 2011, 45(4): 656-659.

CAO Xiao-yang, PAN Yun, YAN Xiao-lang, HUAN Ruo-hong. Systolic structure for DCT with low area-time complexity. J4, 2011, 45(4): 656-659.

链接本文:

http://www.zjujournals.com/eng/CN/10.3785/j.issn.1008-973X.2011.04.011    或    http://www.zjujournals.com/eng/CN/Y2011/V45/I4/656

［1］ 方建,张丁,徐红,等.针对H.264去块滤波的实用结构设计［J］.浙江大学学报:工学版,2008,42(3): 460-465.
FANG Jian, ZHANG Ding, XU Hong, et al. Implemented architecture design of deblocking filter for H.264 ［J］. Journal of Zhejiang University: Engineering Science, 2008, 42(3): 460-465.
［2］ RICHARDSON I E G.H.264 and MPEG4 video compression \
[M\]. \
[S.l.\]: Wiley, 2003.
［3］ KUNG H T. Why systolic architectures ［J］. IEEE Computer, 1982, 15(1): 37-46.
［4］ CHANG Yutai, WANG Chinliang. A new fast DCT algorithm and its systolic VLSI implementation ［J］. IEEE Transaction on Circuits and Systems II: Analog and Digital Signal Processing, 1997, 44(11): 959-961.
［5］ CHENG Chao, PARHI K K. A novel systolic array structure for DCT ［J］. IEEE Transaction on Circuits and Systems II: Express Briefs. 2005, 52(7): 366-369.
［6］ MEHER P K, PATRA J C. A new convolutional formulation of discrete cosine transform for systolic implementation ［C］∥ 6th International Conference on Information, Communications and Signal Processing. Singapore: \
[s.n.\], 2007.
［7］ CHIPER D F. Novel systolic array design for discrete cosine transform with high throughput rate ［C］∥1996 IEEE International Symposium on Circuits and Systems. Atlanta: IEEE, 1996: 746-749.
［8］ MEHER P K. Systolic designs for DCT using a lowcomplexity concurrent convolutional formulation ［J］. IEEE Transactions on Circuits and Systems for Video Technology, 2006, 16(9): 1041-1050.
［9］ GUO J I, LIU C M, JEN C W. A new array architecture for primelength discrete cosine transform ［J］. IEEE Transactions on Signal Processing, 1993, 41(1): 436-442.
［10］ MEHER P K. Highly concurrent reducedcomplexity 2D systolic array for discrete Fourier transform ［J］. IEEE Signal Processing Letters, 2006, 13(8): 481-484.
[1] 叶霞，辛愿，刘勇，刘鹏. 基于媒体数字信号处理器的流预取机制[J]. J4, 2014, 48(2): 268-278.
[2] 全励, 程爱莲, 潘赟, 丁勇, 严晓浪. 基于旁路通道的片上网络差别型服务实现方法[J]. J4, 2013, 47(6): 957-968.