Cart (Loading....) | Create Account
Close category search window
 

Ordered single chain tree a new coding scheme for standard cell placement

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

5 Author(s)
Kang Li ; Univ. of Electron. Sci. & Technol. of China, Chengdu ; Changjiu Li ; Lingli Tang ; Juebang Yu
more authors

VLSI standard cell placement is a NP hard problem, which divides into global placement and detail placement phases. In this paper, we proposed a novel coding scheme named ordered single chain tree (OSCT) for detail placement in standard cell placement. Its solution space is n!2n-1 and code length is lgn+(n-1) (where n is the number of cells), which are smaller and shorter than normalized polish expression[3] for standard cell placement. Because of its string structure, OSCT coding scheme can be employed combining with any artificial intelligent algorithms such as simulated annealing (SA) and genetic algorithm (GA) to search for optimal solution in detail placement stage conveniently. This characteristic will enhance the management scale in detail placement, release the workload and uncertainty in global placement, and thus improve whole quality of standard cell placement. Experiments on modified MCNC benchmarks show the effectiveness and efficiency of OSCT coding scheme.

Published in:

ASIC, 2007. ASICON '07. 7th International Conference on

Date of Conference:

22-25 Oct. 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.