Affiliation:
1. National Research University of Electronic Technology – MIET
Abstract
The solution of the problem of verifying the connectivity of electrical connections in the VLSI topology is considered. Effective use of computing resources is based on the use of quasi‑linear computational (temporal and capacitive) complexity of algorithms: sweeping the plane of a straight line for constructing a graph of electrical connections; allocation of subsets of connected vertices in the components of the connection of an undirected graph of large dimension for the determination of electrically connected contacts; establish isomorphism of component‑full colored graphs for comparing the restored list with the original list of electrical connections The proposed solution has a time complexity O(N + N log2 N ) and the capacitive complexity O(s + N ), where N is the number of elements in the topology and s is the number of contacts in the source circuit.
Reference8 articles.
1. Sharathkumar R., Maheshwari P., Gupta P. A practical algorithm for connectivity extraction for very large VLSI layouts. Conference Proceedings: 49th IEEE International Midwest Symposium on Circuits and Systems, San Juan, 2006.
2. Bentley J. L., Ottmann T. A. Algorithms for reporting and counting geometric intersections. IEEE Transactions on Computers, 1979, C 28 (9), pp. 643–647.
3. Preparata F. P., Shamos M. Computational Geometry. An Introduction. Springer, 1985, 398 p.
4. Cormen T. H., Leiserson C. E., Rivest R. L., Stein C. Introduction to algorithms. 2nd ed. MIT Press, 2001, 1184 p.
5. Potopakhin V. V. Iskusstvo algoritmizatsii [Art of algorithmization]. Moscow, DMK Press Publ., 2011, 320 p. (In Russian).