【摘要】 文章给出了一个通过去除冗余的方法 ,实现了电路面积优化的算法。该算法通过电路网络结点值的计算来找到相容的冗余 ,可以避免由遍历状态空间造成的计算量呈指数增长 ,同时 ,所有被找到的冗余将在一次全部除掉。变换后的电路延迟将不会超过初始电路。算法将计算相容时序的冗余 ,并通过在电路中传播它们来简化电路。实验比较证明 ,这一算法对大电路是有效的。更多还原

【Abstract】 An algorithm for optimization of circuit area through redundancy removal is proposed. The algorithm finds compatible redundancies by implying values over nets in the circuit. The potentially exponential cost of state space traversal is avoided and the redundancies found can all be removed at one time. The optimized circuit is a safe delayed replacement of the original circuit. The algorithm computes a set of compatible sequential redundancies and simplifies the circuit by propagating them through the circuit. Efficacy of the algorithm even for large-scale circuits has been demonstrated by experimental results on benchmark circuits.更多还原