节点文献

基于蕴涵树的冗余添加和删除技术

Implication-Tree Based Redundancy Addition and Removal Technique

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 龙望宁边计年薛宏熙吴有亮

【Author】 LONG Wang-Ning;WU You-Liang;BIAN Ji-Nian;XUE Hong-Xi 1) (Department of Computer Science and Technology, Tsinghua University , Beijing 100084) 2) (Department of Computer Science and Engineering, Chinese University of Hong Kong, Hong Kong)

【机构】 清华大学计算机科学与技术系!北京100084香港中文大学计算机科学与工程系!香港

【摘要】 可替换线逻辑综合(如RAMBO)是近年来兴起的一种方法,它采用测试向量自动生成(ATPG)方法来实现冗余添加和删除.但是,频繁调用逻辑蕴涵过程使得整个逻辑综合的速度较慢.因此,如何减少ATPG过程的调用次数便成为提高这类算法的速度之关键.该文提出一种逻辑蕴涵树来存储节点间的逻辑蕴涵关系,并设计了一个基于逻辑蕴涵树的可替换线源节点的挑选算法.在此基础上形成一个快速的可替换线逻辑变换算法IBAW.实验结果表明,在为目标线寻找可替换线时,IBAW的速度是RAMBO的3.6倍.

【Abstract】 Alternative wiring logic synthesis, such as RAMBO, was developed in recent years. It adopts some ATPG techniques to do redundancy addition and removal. However, frequently calling the ATPG procedure makes the whole logic--synthesis process significantly slower. Therefore, how to reduce the calling times of the ATPG procedure is the key to improve the speed of such algorithms. This paper proposes an implication--tree to take down the logic implication relationship between circuit nodes. Based on the implication--tree, an algorithm of selecting the source nodes of alternative wires is proposed, and a fast implication--tree based alternative wiring algorithm IBAW is also proposed. Experimental results show that IBAW is 3. 6 time faster than RAMBO in finding alternative wires for target wires.

【基金】 国家自然科学基金!(69873026);国家教育部博士后科学基金
  • 【文献出处】 计算机学报 ,CHINESE JOURNAL OF COMPUTERS , 编辑部邮箱 ,2000年04期
  • 【分类号】TP301
  • 【被引频次】1
  • 【下载频次】54
节点文献中: 

本文链接的文献网络图示:

本文的引文网络