Khushro Shahookar

Learn More
VLSI cell placement problem is known to be NP complete. A wide repertoire of heuristic algorithms exists in the literature for efficiently arranging the logic cells on a VLSI chip. The objective of this paper is to present a comprehensive survey of the various cell placement techniques, with emphasis on standard cell and macro placement. Five major(More)
Absfrucf-This paper describes the implementation of the Genetic Algorithm for Standard-cell Placement (GASP). Unlike the other placement algorithms that apply transformations o n the physical layout , the genetic algorithm applies transformations on the chromosomal representation of the physical layout. The algorithm works on a set o f configurations(More)
The genetic algorithm has been applied to the VLSI module placement problem. This algorithm is an iterative, evolutional approach. A placement configuration is represented by a set of primitive features such as location and orientation, and the features are arranged in the form of a two-dimensional bitmap chromosome. The representation is flexible, and can(More)
The paper presents a novel implementation of the genetic algorithm in combination with beam search for gate matrix layout. This is a permutation problem, for which the traditional genetic crossover operator results in repetition of gates, and therefore the GA is not applicable without modification. However, the GA is a very efficient stochastic optimisation(More)
  • 1