Abstract

A conductor routing network model is defined for rectangularly arrayed digital printed circuit boards. Portions of various conductor pathways in the network are partitioned into two mutually exclusive and collectively exhaustive subsets. The macro-routing process classifies conductors in terms of these subsets and this classification scheme is used to generate (1) an ordered list of conductors and (2) an initial (macro) shape. Built-in adaptive shaping policies are included which can subsequently modify the conductor shapes so as to minimize the creation of conductor congestion. This enhances the chances of obtaining a feasible layout, if one exists. The output of this algorithm is utilized by a PC designer as a conductor routing schedule and map as he fills in the micro-routing details.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.