Priority driven channel pin assignment

The first stage in channel routing is that of computing a routing solution S, for a given channel with as few tracks as possible. We consider a second stage in which it is desirable to reduce the total wire length without increasing area of routing. In ...

This paper presents a new technique of channel routing based on the Manhattan-Diagonal (MD) model. The layout grid is assumed to consist of two layers with tracks in horizontal, vertical and /spl plusmn/45/spl deg/ directions. First, we consider the non-...

This paper addresses the problem of minimizing wiring space in an existing slicing floorplan. Wiring space is measured in terms of net density, and the existing floorplan is adjusted only by interchanging sibling rectangles and by mirroring circuit ...