Paper Info
Title
A set of nets planarization with two chains of contacts
Abstract
An efficient approach for finding all maximal and close to them planar subsets of nets with contacts on two chains has been developed. It is useful for the physical design automation of electronic devices, spefically for the printed circuit board, system-on-a-chip, integrated circuits, thin and fine ball grid arrays, and others. The proposed approach, unlike other methods, uses of two types of relations between contacts on chains: strict direct and strict inverse. Based on these relations the two graphs are constructed. The solution of the problem is to find the longest paths on the graphs. Each such path corresponds to the one of possible optimal solutions, i.e., the largest number of nets that can be layed without intersections. The method allows to find different solutions, as all optimal and close to them, which creates the conditions for considering other design requirements besides planarization.
Year
DOI
Venue
2021
10.1109/CSIT52700.2021.9648742
2021 IEEE 16th International Conference on Computer Sciences and Information Technologies (CSIT)
Keywords
DocType
Volume
planarization,set of nets,two chains of contacts,maximization the number of nets without intersections
Conference
1
ISSN
ISBN
Citations 
2766-3655
978-1-6654-4258-9
0
PageRank 
References 
Authors
0.34
7
2
Name
Order
Citations
PageRank
Roman Bazylevych100.68
Lubov Bazylevych211.06