Hierarchical approach for VLSI components placement

Abstract

To solve the problem of VLSI components’ placement a modified hierarchical approach is proposed. This approach consists of three levels. At the first level a preliminary decomposition of search space with the use of evolutionary algorithms is performed. Geometric parameters of each group are determined by the total area of its constituent components. At the second level VLSI components are placed within decomposition groups on the basis of the modified genetic algorithm. At the third level decomposition groups are placed within a connection field using genetic search methods. The suggested methods of the encoding and decoding of alternative solutions enable the authors to perform genetic procedures. These methods consist in using the reverse Polish notation. A computational experiment, which confirmed the theoretical estimates of the performance and efficiency of the developed algorithms, was carried out. The hierarchical algorithm was compared with classical methods and the bioinspired search. The time complexity of the algorithm is represented as O (n log n).