Abstract
Performance-driven layer assignment aims at minimizing the number of vias under the timing constraints such as layer preference and path delay. A key contribution of this paper is to show that, at the stage of layer assignment, synchronous timing problems can be formulated under the Elmore delay model as linear inequalities imposed on via minimization, and via minimization can be formulated compactly as a linear integer programming problem. A solver employing both exact and heuristic solution methods has been developed. Some experimental results are included in this paper.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.