lee maze routing for vlsi
2016-08-23
0 0 0
no vote
Other
Earn points
Maze routing algorithm tries to find the shortest path between two points in a maze for a single wire if such a path exists. In this scheme the source cell sends messages to its four neighbours. The message propagates in the form of a wave to other nodes. The first wave front that reaches the destination determines the connecting path. There are two phases in this algorithm. In the first phase nodes are labelled with their distances from the source. In the next phase distances are used to trace from sink to source choosing a path with the least distance to the source. One approach to general routing problem is area routing, which is a single phase routing technique.
The Maze Routing algorithm represents the routing layer as a grid, where eacc++
vlsi
迷宫
路由
Related Source Codes
Local Path Planning Algorithm - DWA Algorithm
0
0
no vote
enDAQ-Shock-Data-Share-SRS-Blog
0
0
no vote
Calling chatGPT in a Windows application
0
0
no vote
Test Hello world
0
0
no vote
RCS calculation by one-way ray tracing
0
0
no vote
No comment