节点文献
基于蕴涵树的冗余添加和删除技术
Implication-Tree Based Redundancy Addition and Removal Technique
【摘要】 可替换线逻辑综合(如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.
【Key words】 logic synthesis; redundancy addition and removal technique; alternative wiring logic transformation;
- 【文献出处】 计算机学报 ,CHINESE JOURNAL OF COMPUTERS , 编辑部邮箱 ,2000年04期
- 【分类号】TP301
- 【被引频次】1
- 【下载频次】54