The optimal circuit reduction method has proved to be an effective tool to identify the cluster structure of the circuit. The author reviews the applicability of this method to solving a wide spectrum of various problems, including hierarchical clustering, partitioning, packaging, and placement. A common approach to these problems is developed on the basis of hierarchical decomposition and multilevel macromodeling, which can be realized by identifying the hierarchical cluster circuit structure, as well as recursive use of algorithms of global and local optimization for unique, not very large size problems. The idea was to operate not by original elements, the number of which is extraordinarily high, but by clusters that could be mathematically described by macromodels. This enables us to essentially decrease the size of the problem, facilitating a solution and reducing the calculation consumption, and to improve the quality of the solution, to more easily provide trapping into the zone of the global optimum.
Experiments confirm the effectiveness of the approach.
For some well-known test cases the optimal results were achieved for the first time, while for many other cases improved results were obtained.