逻辑自动综合中的时间优化

TIMING OPTIMIZATION IN AUTOMATIC LOGIC SYNTHESIS

逻辑自动综合中控制部分的优化一般是在布尔方程确定之后进行.本文从另一个角度,即如何建立布尔方程以利于下一步的简化方面着手,提出了一个简洁、快速的节拍划分优化算法.

Optimization in automatic logic synthesis is usually done after the Boolean equations are set up. In this paper, optimization is considered when the Boolean equations are established, and a concise and efficient algorithm for timing optimization is presented.