Analytical placement: A linear or a quadratic objective function?
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
VLSI/PCB placement with obstacles based on sequence-pair
Proceedings of the 1997 international symposium on Physical design
Slicing floorplans with pre-placed modules
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
B*-Trees: a new representation for non-slicing floorplans
Proceedings of the 37th Annual Design Automation Conference
Floorplanning with alignment and performance constraints
Proceedings of the 39th annual Design Automation Conference
A force-directed macro-cell placer
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Ant colony system application to macrocell overlap removal
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
VLSI module placement based on rectangle-packing by the sequence-pair
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Symmetry within the sequence-pair representation in the context of placement for analog design
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Floorplanning using a tree representation
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Hierarchical congregated ant system for bottom-up VLSI placements
Engineering Applications of Artificial Intelligence
Hi-index | 0.00 |
This paper presents a macrocell placement constraints and overlap removal methodology using particle swarm optimization (PSO). The authors adopted several techniques along with PSO as to avoid the floorplanning falling into the local minimum and to assist in finding out the global minimum. Our method can deal with various kinds of placement constraints, and consider them simultaneously. Experiments employing MCNC and GSRC benchmarks show the efficiency and robustness of our method for restricted placement and overlap removal obtained by the ability of exploring better solutions. The proposed approach exhibited rapid convergence and led to more optimal solutions than other related approaches, furthermore, it displayed efficient packing with all the constraints satisfied.