VLSI floorplanning based on the integration of adaptive search models
| Autor: | B. K. Lebedev, V. M. Kureichik, V. B. Lebedev |
|---|---|
| Rok vydání: | 2013 |
| Předmět: |
Mathematical optimization
Computer Networks and Communications Orientation (computer vision) Applied Mathematics Genetic operator Mechatronics Floorplan Theoretical Computer Science Convolution Computer Science::Hardware Architecture Variable (computer science) Tree (data structure) Control and Systems Engineering Computer Vision and Pattern Recognition Software Information Systems Electronic circuit Mathematics |
| Zdroj: | Journal of Computer and Systems Sciences International. 52:80-96 |
| ISSN: | 1555-6530 1064-2307 |
| Popis: | A hybrid approach and methods for representing the VLSI floorplanning problem in the form of evolutionary processes based on the integration of adaptive behavior models of biological systems and on composite architectures of solution algorithms are described. This makes it possible to deal with large-scale problems and obtain high-quality results in reasonable time. The floorplan synthesis includes two phases. In the first phase, the cut tree is produced using the genetic techniques; in the second phase, the floorplan is formed using the convolution by the methods of collective adaptation of the tree cut. Variants of circuits with the variable module orientation of fixed or stochastic size are considered. The probability of obtaining an optimal solution is 0.9, and the average deviation of the solutions from the optimal ones is 1%. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink