By Topic

Efficient solution space exploration based on segment trees in analog placement with symmetry constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
F. Balasa ; Dept. of Comput. Sci., Illinois Univ., Chicago, IL, USA ; S. C. Maruvada ; K. Krishnamoorthy

The traditional way of approaching device-level placement problems for analog layout is to explore a huge search space of absolute placement representations, where cells are allowed to illegally overlap during their moves (J. Cohn et al., Analog Device-Level Automation, Kluwer Acad. Publ., 1994; K. Lampaert et al., IEEE J. Solid-State Circ., vol. SC-30, no. 7, pp. 773-780, 1995; E. Malavasi et al., IEEE Trans. CAD, vol. 15, no. 8, pp. 923-942, 1996). This paper presents a novel analog placement technique operating on the set of binary tree representations of the layout (Y.C. Chang et al., Proc. 87th ACM/IEEE Des. Aut. Conf., pp. 458-463, 2000), where the typical presence of an arbitrary number of symmetry groups of devices is directly taken into account during the exploration of the solution space. The efficiency of the novel approach is due to a data structure called segment tree, mainly used in computational geometry.

Published in:

Computer Aided Design, 2002. ICCAD 2002. IEEE/ACM International Conference on

Date of Conference:

10-14 Nov. 2002