DocumentCode :
2163178
Title :
Analog placement design with constraints of multiple symmetry groups
Author :
He, Rui ; Zhang, Lihong
Author_Institution :
Fac. of Eng. & Appl. Sci., Memorial Univ. of Newfoundland, St. John´´s, NL
fYear :
2009
fDate :
3-6 May 2009
Firstpage :
1204
Lastpage :
1207
Abstract :
This paper presents a solution to handling multiple symmetry constraints in the placement design using transitive closure graph (TCG) representation for analog layouts. We propose a set of symmetric-feasible conditions, which can guarantee symmetric placement of sensitive cells with respect to multiple symmetry axes for reduction of parasitic mismatch and thermal gradients. We also develop a new contour-based packing scheme with time complexity of O(p-nlgn), where p is the number of symmetric groups and n is the number of the placed cells. Furthermore, a set of perturbation operations with time complexity of O(n), where n is the number of the placed cells, are defined in order to generate a random symmetric-feasible TCG configuration from an existing one. Our experimental results show the effectiveness of this approach compared to other state-of-the-art placement algorithms.
Keywords :
analogue circuits; circuit complexity; circuit layout; graph theory; analog layouts; analog placement design; contour-based packing scheme; multiple symmetry constraints handling; parasitic mismatch reduction; perturbation operations; symmetry groups; thermal gradient reduction; time complexity; transitive closure graph representation; Circuits; Design engineering; Helium; Linear programming; Mirrors; Random number generation; Tree data structures; Voltage;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Electrical and Computer Engineering, 2009. CCECE '09. Canadian Conference on
Conference_Location :
St. John´s, NL
ISSN :
0840-7789
Print_ISBN :
978-1-4244-3509-8
Electronic_ISBN :
0840-7789
Type :
conf
DOI :
10.1109/CCECE.2009.5090316
Filename :
5090316
Link To Document :
بازگشت