Gate Oriented Algorithms (B.Chen ‘98)

Goals are for execution time to be linear with number of gates, will optimize all paths at the same (minimize delay of all paths).Netlist preparation: Levelize the network

Level 1

Level 2

Level 3

Previous slide

Next slide

Back to first slide

View graphic version