Upload Code
loading-left
loading loading loading
loading-right

Loading

Profile
No self-introduction
codes (3)
STEINER TREE FOR ROUTING
4.2
The Rectilinear Steiner tree problem can be stated as, given n points in the plane, it is required to interconnect them all by a shortest network which consists only of vertical and horizontal line segments. It can be shown that such a network is a tree whose vertices are the input points and Steiner points. Set of finite points called Hannon Points has to be identified. In Steiner tree problem the Euclidean distance is replaced with the rectilinear distance.  The spanning tree is constructed by connecting the Steiner point with closest points in the four regions(North, East, south, West).If the connection forms a cycle, then cycle should be identified and largest segment should be removed. By introducing  Steiner points we can get the minimum length Steiner tree
matlab867624
2016-08-23
6
1
left edge algorithm for routing in vlsi
4.0
 A channel is a routing region bounded by two parallel rows of terminals. The main objective of channel routing algorithm is to minimise the channel height. The Left-Edge algorithm(LEA) was the first algorithm developed for channel routing. The chips are placed in rows and the areas between the rows and underneath the boards are divided into rectangular channels. The left-edge algorithm always finds a solution with a number of rows equal to the lower bound
matlab867624
2016-08-23
1
1
lee maze routing for vlsi
no vote
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 eac
matlab867624
2016-08-23
0
1
No more~