Automatic layout wiring generation method based on sparse grids

Abstract

The invention relates to an automatic layout wiring generation method based on sparse grids. The method comprises the following steps: 1, initialization setting; 2, acquiring wiring information; 3, dividing grids; 4, marking a grid state; 5, wiring; and 6, inquiring whether components to be wired exist or not, and if yes, repeating the step (2) until wiring of all layouts is completed. According to the invention, design requirements can be met according to different devices and layouts; according to the method and the system, the wiring grids are adaptively and reasonably divided to obtain thedata of the related grids, and then the grids are explored by adopting the algorithm, so that the defect of large storage space caused by uniform grid division can be greatly reduced, the space effectiveness is favorably reduced, and the space use efficiency is improved.

Description

technical field [0001] The invention relates to the technical field of integrated circuits, in particular to an automatic layout and wiring generation method based on sparse grids. Background technique [0002] With the rapid development of integrated circuit technology, integrated circuits have entered the era of ultra-deep submicron, which makes the feature size of electronic devices smaller and smaller, the scale of chips is larger and larger, and more and more components can be integrated in a single On the chip, the complexity has risen sharply, and for the wiring method in the layout, the manual design wiring method has long been unable to meet the needs of integrated circuit design, and computer automatic wiring has occupied an increasing proportion of layout design and wiring. The wiring algorithm has an extremely important impact on the speed and efficiency of wiring. How to design an algorithm that requires less time and space, lower complexity, and higher efficien...

AI Technical Summary

Problems solved by technology

However, the efficiency of the two algorithms cannot reach the optimal

[0005]3. Line exploration method: Searching for wiring methods through line exploration can greatly save the space consumption of algorithm exploration, but the Hightower algorithm may not be able to search for the original existence route; Mikami algorithm cannot guarantee the shortest path

[0006]The above-mentioned methods all adopt the method of evenly dividing the grid. When the algorithm is used to explore the best path, the required recording space is large, which is not very good Solve the problems related to the space effectiveness and efficiency of the algorithm, and can not achieve better practicability in the process of use

Images