An efficient net ordering algorithm for buffer insertion
Published • Mar 11, 2007
NobleIDNI1P85W59R67S47
Authors:,
Hamid Reza Kheirabadi
Morteza Saheb Zamani
Abstract
There are efficient algorithms for net-based buffer insertion but they lead to sub-optimal path delays or unnecessarily large number of buffers due to their lack of global view. This can increase power consumption as well as die area. The ordering of nets for buffer insertion has a crucial impact on...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!