A new approach to the rectilinear Steiner tree problem
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Data Structures and Algorithms
Data Structures and Algorithms
Routing considerations in symbolic layout synthesis
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
| Hi-index | 0.00 |
Cell synthesis is the process of turning a netlist into an efficient layout without being restricted to a library of predesigned cells or a fixed floorplan. Normally, this job is broken into at least three parts: placement, routing, and detailed cell generation. Each of these tasks are often divided further into a global and a detailed phase. This paper presents cell synthesis system called Sea Of Devices (SOD), with emphasis on its routing phase. In particular, SOD uses a new model for the global routing problem. This model is based on traditional Steiner trees, but includes detailed geometric information specific to the cell synthesis problem. The system models diffusion strips, congestion and existing feedthru's as a cost function associated with regions on the routing plane. A sequence of algorithms based on spanning trees, Steiner trees, maze routing and channel routing techniques is used to find solutions that make use of this detailed knowledge. The presentation includes some discussion of the algorithms that tie the routing phases together and illustrates the underlying support structures, which are needed for efficient access. Examples from the Physical Design Workshop 89 [PDW89] are included.