The Community for Technology Leaders
Design Automation Conference (1988)
Anaheim, CA, USA
June 12, 1988 to June 15, 1988
ISBN: 0-8186-0864-1
pp: 658-662
Chakraverti , Renssalaer Polytech. Inst., Troy, NY, USA
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.
INDEX TERMS
layout design, logic design, CAD, routeing, gate array macro cells, dynamic algorithm, data structure, corner stitching, near-optimal routing, iterations, shortest-path routing, conflict resolution, coloring procedure, net reordering
CITATION

Chakraverti and Chung, "Routing algorithm for gate array macro cells," Design Automation Conference(DAC), Anaheim, CA, USA, 1988, pp. 658-662.
doi:10.1109/DAC.1988.14837
94 ms
(Ver 3.3 (11022016))