Font Size: a A A

The Intelligent Routing Based On The Algorithm Of Lie Group Machine Learning, LML

Posted on:2012-05-08Degree:MasterType:Thesis
Country:ChinaCandidate:Y FeiFull Text:PDF
GTID:2218330368991668Subject:Computer technology
Abstract/Summary:PDF Full Text Request
Matrix routing is one of the key technology about electronic circuits system, also is a complex and huge project. From the first algorithm—Lee algorithm which based on the grid, to the algorithm about a single escape point on each line segment which proposed by D.W. Hightower, the routing algorithms about PCB have an unprecedented development. According to the complexity problems of changes in the electronic components' structure, the existing routing algorithms cannot meet the requirements, this paper uses a tentative study which selected Lie Group Machine Learning to solve the problems, transferring the routing problem to the shortest path solution between the point set, and then get the optimum routing path. After unremitting efforts, the achievements include the followings.Devoted from analyzing different kinds of auto routing algorithm, the intelligent routing based on the algorithm of Lie Group Machine Learning (LML) has been introduced. The main contents have:1. Using the conceptions of LML model, Orbit-Breadth-First and Orbit-Depth-First as the theoretical basis to support the algorithm.2. Combined the knowledge of graph theory and artificial intelligence methodology, then transferred the question to partially ordered set and described to a lattice structure and get optimal orbit, so that obtaining the fast and the high routing efficiency algorithm.3. Analyses the data and gives the detailed solution and example, summarizing the characteristic of algorithm.Routing algorithm proposed in this paper is proved to meet the practical application. However, all the work is tentive and much needs advanced research.
Keywords/Search Tags:PCB layout, auto routing, LML, Learning subspace
PDF Full Text Request
Related items