The flexible rubber-band sketch is a useful representation for routing interconnect. In addition to supporting an incremental design style, rubber-bands provide a flexible framework for generating layout under performance constraints. However, due to reasons of compatibility between CAD tools, it may be necessary at times to convert a rubber-band sketch to a more restricted geometry such as rectilinear or octilinear wiring. This paper presents an efficient method, based on the enhanced plane sweep, for converting a rubber- band sketch to a topologically equivalent rectilinear or octilinear wiring with minimum wire length. A sketch with n rubber-band segments can be converted to a restricted geometry with m segments in O(n \log n + m) time. In addition to guaranteeing minimum wire length, the technique uses heuristic methods to reduce the total number of jogs.
Cited By
- Chen Y and Chang Y Obstacle-Avoiding Multiple Redistribution Layer Routing with Irregular Structures Proceedings of the 41st IEEE/ACM International Conference on Computer-Aided Design, (1-6)
- Zhang S and Dai W TEG Proceedings of the 2002 international symposium on Physical design, (62-67)
- Morton P and Dai W An efficient sequential quadratic programming formulation of optimal wire spacing for cross-talk noise avoidance routing Proceedings of the 1999 international symposium on Physical design, (22-28)
- Staepelaere D, Jue J, Dayan T and Dai W (1993). SURF, IEEE Design & Test, 10:4, (18-26), Online publication date: 1-Oct-1993.
Recommendations
Post-route optimization for improved yield using a rubber-band wiring model
ICCAD '97: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided designThis paper presents a unique approach to improve yield given a routed layout. Currently after routing has been completed and compacted, it generally proceeds to verification without further modifications. However, to improve manufacturability, we ...
Zero-Change Netlist Transformations: A New Technique for Placement Benchmarking
In this paper, the authors introduce the concept of zero-change netlist transformations (ZCNTs) to: 1) quantify the suboptimality of existing placers on artificially constructed instances and 2) "partially" quantify the suboptimality of placers on ...