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

A generalized placement algorithm based on self-organization neural network

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)
Tao Shen ; Shanghai Inst. of Metall., Acad. Sinica, China ; Jun-ren Gan ; Lin-sheng Yao

Kohonen's self-organization neural network is applied to VLSI cell placement. The algorithm proposed by A. Hemani and A. Postula (1990) adapted for two terminal nets is generalized to accommodate multiterminal nets. In contrast to the traditional gate-as-points model, which was proved improper for cell placement, the authors propose a net-as-points model in the new algorithm. Experiments showed that the convergence speed for the new algorithm was several times faster than for the gate-as-points model while the quality of solutions was better. Placements obtained by the new algorithm were superior to those achieved by the min-cut algorithm in terms of total wire length

Published in:

Neural Networks, 1992. IJCNN., International Joint Conference on  (Volume:4 )

Date of Conference:

7-11 Jun 1992

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.