By Topic

Using red-black interval trees in device-level 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
$31 $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)
Balasa, F. ; Dept. of Comput. Sci., Illinois Univ., Chicago, IL, USA ; Maruvada, S.C. ; Krishnamoorthy, K.

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. This paper presents a novel exploration technique for analog placement, operating on the set of tree representations of the layout, where the typical presence of an arbitrary number of symmetry groups of devices is directly taken into account during the search of the solution space. The efficiency of the novel approach is due to the use of red-black interval trees (T.H. Cormen et al, Introduction to Algorithms, McGraw-Hill, 1990), data structures employed to support operations on dynamic sets of intervals.

Published in:

Design Automation Conference, 2003. Proceedings of the ASP-DAC 2003. Asia and South Pacific

Date of Conference:

21-24 Jan. 2003