Translator Disclaimer
30 June 2005 Net order optimization in analog net bundles
Author Affiliations +
Proceedings Volume 5837, VLSI Circuits and Systems II; (2005)
Event: Microtechnologies for the New Millennium 2005, 2005, Sevilla, Spain
This paper presents a new approach to optimize net order in analog busses. It is used for the PARasitic SYmmetric router (PARSY), which routes net bundles, e.g. busses or differential pairs, maintaining parasitic symmetry and limiting differential coupling. The router is mainly devoted to analog signal interconnect but can also be used for critical digital busses. Net bundles have a fixed order, because wire crossing is not allowed in net bundle segments to enforce symmetry. Wires inside net bundle segments are generated by module generators. Connecting cell terminals to the first or the last net bundle segment is complex, because the cell terminals can vary in geometry and placement. Therefore, an assignment between nets and wires (net order) in a segment is required. This assignment does not affect the order in which nets or net bundles are routed sequentially. The optimization objective for the connections from net bundle segments to terminals is to minimize the number of crossings and the length difference, while maintaining symmetry if possible. Therefore, a net order has to be calculated, which globally optimizes these criteria for all terminal connections. Different net orders can be computed from the placement of terminals, which have to be connected to a net bundle segment. An additional order is calculated from these net orders, which contains the most characteristic features of all net orders. For all net orders costs are evaluated, and the one with the lowest cost is chosen.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Thomas Jambor, Lars Schreiner, Markus Olbrich, and Erich Barke "Net order optimization in analog net bundles", Proc. SPIE 5837, VLSI Circuits and Systems II, (30 June 2005);

Back to Top