Topological Placement with Multiple Symmetry Groups of Devices for Analog Layout Design
Authors:
- 1 May 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02714302,p. 2032-2035
Abstract
This paper presents an improved topological algorithm for device-level analog placement with symmetry constraints. Based on the exploration of symmetric-feasible sequence-pairs (Balasa and Lampaert, 2000), the technique employs an efficient model of priority queue (Johnson, 1982). The use of this data structure entails a complexity of O (G middot n log log n) for each code evaluation, where n and G are the numbers of devices and symmetry groups, which is better than the complexity of other existent topological placement algorithms supporting symmetry constraints. The computation times exhibited by this approach are significantly better than those of the algorithms using an exploration strategy based on the absolute representation, as well as those of other previous topological algorithms.Keywords
This publication has 9 references indexed in Scilit:
- Improved method of cell placement with symmetry constraints for analog IC layout design2006
- FAST-SP: a fast algorithm for block placement based on sequence pair2002
- Symmetry within the sequence-pair representation in the context of placement for analog designIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2000
- Block placement with symmetry constraints based on the O-tree non-slicing representation2000
- VLSI module placement based on rectangle-packing by the sequence-pairIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1996
- Automation of IC layout with analog constraintsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1996
- A performance-driven placement tool for analog integrated circuitsIEEE Journal of Solid-State Circuits, 1995
- Analog Device-Level Layout Automation1994
- A priority queue in which initialization and queue operations takeO(loglogD) timeTheory of Computing Systems, 1981