By Topic

A Two-Step Binary Particle Swarm Optimization Approach for Routing in VLSI with Iterative RLC Delay Model

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

9 Author(s)
Yusof, Z.M. ; Fac. of Electr. Eng., Univ. Teknol. Malaysia, Skudai, Malaysia ; Tan Zhe Hong ; Abidin, A.F.Z. ; Salam, M.N.A.
more authors

Manipulation of wire sizing, buffer sizing, and buffer insertion are a few techniques that can be used to improve time delay in very large scale integration (VLSI) circuit routing. This paper enhances an existing approach, which is based on Particle Swarm Optimization (PSO) for solving routing problem in VLSI circuits. A two-step Binary Particle Swarm Optimization (BPSO) approach, which is based on BPSO, is chosen in this study to improve time delay through finding the best path of wire placement with buffer insertion from source to sink. The best path of wire placement is found in the first step by the first BPSO and then the second BPSO finds the best location of buffer insertion along the wire. A case study is taken to measure the performance of the proposed model and the result obtained compared to the previous PSO approach for VLSI routing.

Published in:

Computational Intelligence, Modelling and Simulation (CIMSiM), 2011 Third International Conference on

Date of Conference:

20-22 Sept. 2011