Time delay driving method of right angle Steiner tree under obstruction when making loose routing for standard units

Abstract

Characters of the invention are: dividing set of vertex of each wire into sub sets; traversing set of vertex to obtain relation between two connected vertexes, carrying out time delay calculation by using time delay formula of solving minimum time delay tree; for obstructive route, looking up shortest distance between two obstructive points in advance by using improved Rubin method suitable to irregular grid, then carrying out time delay calculation; obtaining connected relation of vertexes of target Steiner tree accorded with minimum time delay; from bottom up, connection set of vertex step by step till final target Steiner tree. The invention considering both of minimized obstruction and time delay is capable of treating wire net with multiple end points or complex obstructive wire net.

Description

technical field [0001] The time-delay-driven Cartesian Steiner tree method under obstacles in the overall wiring of standard cells belongs to the technical field of computer-aided design of integrated circuits (IC CAD), and in particular relates to the field of overall wiring design of standard cells (SC). Background technique [0002] In integrated circuit (IC) design, physical design is the main link in the IC design process, and it is also the most time-consuming step. A computer-aided design technique related to physical design is called layout design. In layout design, overall wiring is an extremely important link, and its results have a great influence on the success of the final detailed wiring and the performance of the chip. [0003] The design scale of integrated circuits is currently developing from very large-scale (VLSI), very large-scale (ULSI) to G-scale (GSI), and the design concept of system-on-chip (SOC) has emerged. The research on the construction metho...

AI Technical Summary

Problems solved by technology

Three documents: [Zhou Zhi, Minimum Steiner Tree Problem in Obstacle Manhattan Space (Master's Dissertation). Hefei: University of Science and Technology of China, 1998.], [Zhou Zhi, Chen Guoliang, Gu Jun. Using O(tlogt) connection Find the shortest path when there are obstacles. Journal of Computer Science, 1999, 22(5): 519-524.] and [Zhou Zhi, Jiang Chengdong, Huang Liusheng, Gu Jun, "Use the generalized connection graph of Θ(t) to find the shortest path when there are obstacles. The shortest path", Journal of Software, 2003, 14(2): pp.166-174.] proposed to use the generalized connection graph G G To construct the minimum Steiner tree of the two-end line network, and also propose G G can be used to construct multi-terminal nets, but they have not yet been implemented

Therefore, the method of this document is not suitable for the delay-driven right-angle Steiner tree construction method in overall wiring

Images