Font Size: a A A

Study On Printed Circuit Board Auto Routing In Circuit CAD

Posted on:2006-11-28Degree:MasterType:Thesis
Country:ChinaCandidate:H S WangFull Text:PDF
GTID:2168360152482219Subject:Mechanical design and theory
Abstract/Summary:PDF Full Text Request
This paper introduces the general developmental situation of the Computer-Aided Design (CAD) and the class and primary structure of the circuit CAD software. The developmental situation and class of the auto routing are also described, the theory of auto routing is studied synthetically.A automatic routing algorithm------Intelligent Discern Points Algorithm ispresented in Manhattan-diagonal(MD) model with tracks in horizontal,vertical.and ±45 directions.First.the concept of generalized line segment is presented in MD model.Second,by means of artificial intelligence theory,the way of deciding the position of detouring points is proposed.Finally,a set of point which is made up of detouring points and pins is formed.By using the points of the set as the vertices ,a weighted complete graph is formed.The question of routing is transformed into finding shortest-path problem in the weighted complete graph.Thereby,the optimization of routing is found. It is proved by experimentation that the algorithm performance is efficient.
Keywords/Search Tags:Manhattan-diagonal model, generalized line segment, detouring point, routing algorithm, complete graph
PDF Full Text Request
Related items