Routing algorithm for gate array macro cells

Abstract

The authors present an efficient dynamic algorithm for routing replaced gate array macrocells. A novel data structure based on corner stitching is introduced to represent the routing environment in a general gate array, where a uniform grid cannot be superimposed on the basic-cell. The near-optimal routing is accomplished in iterations with an initial shortest-path routing followed by conflict resolution using a coloring procedure and net reordering.<>