Buffer Insertion for Delay Minimization using An Improved PSO Algorithm

Abstract

This paper considers the problem of interconnect wire delay in digital integrated circuits. The correct wire sizing and buffer insertion/sizing can reduce the interconnect delay. The interconnect wire is divided into segments and to optionally buffers are inserted between two adjacent segments. But it is important to select appropriate values for the size of buffers as well as the lengths and widths of segments to minimize the delay. Since the delay is a multi-dimensional function, its optimizing process is complex and time-consuming. In this paper we introduce an improved particle swarm optimization for delay minimization. The aim is to reduce the interconnect wire delay. This work is performed in 3 case studies. Sizing a chain of buffers without considering the wire delay is done in case study 1. Wire sizing alone and buffer insertion/sizing with wire sizing are dealt in case study 2 and case study 3 respectively. In these case studies, the our improved PSO results are matched with theoretical results while the proposed technique is very fast and more accurate than standard techniques.

Optimization of interconnect delay based on Convex Optimization Technique

“…In this paper we will use the pi-model network for modelling various network parameters. There are various optimization techniques used by researchers for wire width optimization, such as the PSO [10], Geometric Optimization [12].We will basically concentrate our work to convex optimization techniques as it gives the global optimal solutions for particular constraints. Convex optimization uses many types of methods like interior point method [II], newton's method [7] and many others to find the optimum of any given function.…”