By Topic

Application of simulated annealing to cluster-boundary search algorithm for macrocell placement optimization

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

1 Author(s)
Mir, M. ; Dept. of Electr. Eng., Ajman Univ. of Sci. & Technol., Ajman, United Arab Emirates

This paper presents a hybrid technique for macrocell placement optimization. The presented technique integrates the probabilistic hill-climbing feature of simulated annealing with the (deterministic) cluster-boundary search algorithm in order to minimize the likelihood of local optimal solutions. It optimizes the placement as well as orientation of macrocells and produces overlap-free designs satisfying constraints on interconnect length bounds. The technique is computationally efficient and can generate high-quality solutions for large-sized placement problems. Test results for placement optimization problems involving up to 100 macrocells are presented and analyzed to determine the effectiveness of the presented hybrid technique.

Published in:

Computer and Communication Engineering (ICCCE), 2010 International Conference on

Date of Conference:

11-12 May 2010