PROJECT TITLE :
Detailed Routing Algorithms for Advanced Technology Nodes
We have a tendency to gift algorithms for routing in advanced technology nodes, employed by BonnRoute (BR) to obtain economical and almost design rule clean wire packings and pin access solutions. Styles with dense commonplace cell libraries in presence of complex industrial style rules, with a special concentrate on multiple patterning lithography are considered. The key parts of this approach are a multilabel interval-based mostly shortest path algorithm for long on-track connections, and a dynamic program for computing packings of pin access methods and short connections between closely spaced pins. The multilabel path search implementation is terribly general and is driven with completely different labeling rules, permitting to trade-off runtime against accuracy in terms of obeyed style rules. We tend to mix BR with an industrial router for cleaning up the remaining style rule violations, and demonstrate superior results over that industrial router in our experiments in terms of wire length, range of vias, style rule violations, and runtime.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here