Hybrid Approach for VLSI Fragments Placement

The paper considers one of the most important problem in the design field – VLSI fragments placement within restricted construction area. The VLSI fragments placement problem is NP-hard and complex problem. In the work there are presented a description of the placement problem and transition from a circuit diagram to a graph model. To reduce dimension of the problem the authors suggest a hybrid approach based on two fractals aggregation and genetic search methods. As well as there is developed a genetic algorithm that allows to obtain sets quazi-optimal solutions during polynomial time. To confirm the effectiveness of the suggested approach there is shown an example of the VLSI fragments placement solution, developed software and computational experiment. Conducted tests and experiments approve promising of the suggested approach, a time complexity of developed algorithms is represented in the best case as ≈O(nlogn), in the worst case - O(n3).