Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 4 of 4 for “"Maze Routing"”.
-
Deep reinforcement learning on 1-layer circuit routing problem
In VLSI design, routing is the step that determines the paths for circuit nets and interconnections. While routing can be a very complex process involving time, congestion and space information, the problem can be modelled as a maze routing problem. In specific, given a 2d array and a set of start …
-
Clock tree synthesis under aggressive buffer insertion
In this thesis, we propose a maze-routing-based clock tree routing algorithm integrated with buffer insertion, buffer sizing, and topology generation that is able to consider general buffer insertion locations. While previous work on buffered clock tree synthesis restricts potential buffer …
-
VLSI Physical Design for Manufacturability and Reliability
… present in Chapter 4. Its applications, such as maze routing, timing analysis and buffer insertion, are discussed. Proposed algorithm can handle an arbitrary function of mean and variance of path weight instead of convex constraint needed for existing algorithms. In Chapter 5, buffer insertion …
-
Stochastic shortest path algorithm based on Lagrangian relaxation
… such as timing analysis, buffer insertion, and maze routing, can be formulated as shortest path problems using a statistical graph model. The solution of any such graph problem will surely have a statistical distribution for its cost function value. The mean and variance, square of standard …