摘要
分别提出了菱形搜索和分层搜索两种运动估计算法的VLSI结构设计方法,前者采用较大的运算阵列,一次完成两个宏块间的匹配运算,后者将一次匹配运算分割成多个相同的运算单元,这些单元使用同一个较小的运算阵列分步完成。对两种算法及其结构进行了比较,列举几种测试序列下的实验结果和综合后芯片的一些参数的对比情况,综合采用在Synopsys软件上用Chartered0.6umCMOS单元库进行综合。
In this paper, two VLSI architetures for diamond motion estimaion and hierarchical motion estimation are proposed, the former takes PE--array which complete a block match by one circle and the later divides the block matching process into many similar segments which completed by the same PE--array smaller than the former step by step. The result of comparision of the two algorithm and its architecture are showed at the last of the paper. The results of the synthesis were gotten with Chartered 0. 6urn CMOS units library by Synopsys software.
出处
《微计算机应用》
2006年第1期9-12,共4页
Microcomputer Applications
基金
国家863项目基金资助项目(No.:2002AA119010)。
关键词
超大规模集成电路设计
运动估计
菱形算法
分层算法
VLSI architecture design, motion estimation, diamond algorithm, hierarchical algorithm