By Topic

Simultaneous Routing and Buffer Insertion algorithm for interconnect delay optimization in VLSI layout design

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
$33 $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

2 Author(s)
Mohamed Khalil Hani ; Dept. of Microelectronics and Computer Engr., Faculty of Electrical Engineering, Universiti Teknologi Malaysia, 81310 UTM Skudai, Johor, Malaysia ; Nasir Shaikh-Husin

The design of VLSI circuits today has become very challenging indeed. The main factor affecting system performance is the interconnect delay. Many algorithms have been proposed to solve the interconnect timing optimization problem. Research has shown that techniques like buffer insertion and wire-sizing have been proven to be very effective in reducing interconnect delay. This paper describes a graph-based routing algorithm to solve the interconnect delay optimization problem in a deep submicron VLSI layout routing. The algorithm finds the optimal delay routing paths with simultaneous consideration of buffer insertions and wire-sizing, while taking into account wire or buffer obstacles. The proposed algorithm, called S-RABILA (Simultaneous Routing and Buffer Insertion with Look-Ahead), utilizes a novel look-ahead technique that significantly contributes to the computational efficiency of the proposed algorithm. In this paper, the performance of S-RABILA is presented, which shows the effectiveness of the look-ahead scheme. Experimental results also indicate that the proposed algorithm provide significant improvements over similar existing VLSI routing algorithms.

Published in:

2008 International Conference on Microelectronics

Date of Conference:

14-17 Dec. 2008