A PSO-based intelligent decision algorithm for VLSI floorplanning

Soft Computing

Volumn 14, Issue 12, 2010, Pages 1329-1337

  Chen, Guolong ^a,b   Guo, Wenzhong ^a   Chen, Yuzhong ^a  

^a FUZHOU UNIVERSITY   (China)

^b Fuzhou University   (China)

Author keywords

Floorplaning; Intelligent decision making; Particle swarm optimization; VLSI

Indexed keywords

ACCELERATION COEFFICIENTS; CIRCUIT DESIGNS; CROSSOVER OPERATOR; FLOOR-PLANNING; FLOORPLANING; INTEGER CODING; INTELLIGENT DECISION MAKING; INTELLIGENT DECISIONS; LOCAL MINIMUMS; LOCAL OPTIMA; OPTIMAL PLACEMENT SOLUTIONS; PARTICLE SWARM OPTIMIZATION TECHNIQUE; PSO ALGORITHMS; RECOMMENDED VALUES; VLSI CHIP; VLSI FLOORPLANNING;

COMPUTER AIDED DESIGN; CONVERGENCE OF NUMERICAL METHODS; DECISION MAKING; GENETIC ALGORITHMS; INTEGRATED CIRCUIT MANUFACTURE; MATHEMATICAL OPERATORS; VLSI CIRCUITS;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 77954663583     PISSN: 14327643     EISSN: 14337479     Source Type: Journal    
DOI: 10.1007/s00500-009-0501-6     Document Type: Article

References (28)

1. Chang YC, Chang YW, Wu GM, Wu SW (2000) B*-tree: a new representation for non-slicing floorplans. In: Proceedings of the 37th conference on design automation, ACM, Los Angeles, California, pp 458-463.
2. de Gloria A, Faraboschi P, Olivieri M (1994) Block placement with a Boltzmann machine. IEEE Trans Comput Aided Des 13(6): 694-701.
3. Goldberg DE (1989) Genetic algorithm in search optimization, and machine learning, Addison-Wesley, Reading.
4. Guo W, Chen G, Fen X (2006) A new strategy of acceleration coefficients for particle swarm optimization. In: Progress in the 10th international conference on computer supported cooperative work in design, 2006(5), pp 72-76.
5. Guo PN, Cheng CK, Yoshimura T (1999) An O-tree representation of non-slicing floorplan and its applications. In: Proceedings of the 36th ACM/IEEE conference on design automation conference, New Orleans, Louisiana, USA, pp 268-273.
6. Gwee B, Lin M (1999) A GA with heuristic based decode for IC floorplanning. Integr VLSI J 28(2): 157-172.
7. Handa K, Kuga S (1995) Polycell placement for analog LSI chip designs by genetic algorithms and tabu search. In: Proceedings of the IEEE conference on evolutionary computation, Perth, Australia, vol 2, pp 716-721.
8. Ho SY, Ho SJ, Lin YK, Chu WCC (2004) An orthogonal simulated annealing for large floorplanning problems. IEEE Trans VLSI Syst 12(8): 874-876.
9. Hong X, Huang G, Cai Y, Gu J, Dong S, Cheng CK, Gu J (2000) Corner Block List: an effective and efficient topological representation of non-slicing floorplan. In: Proceedings of IEEE/ACM international conference on computer-aided design, pp 8-12.
10. Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of the IEEE international conference on neural networks, Piscataway, NJ, pp 1942-1948.
11. Kennedy J, Eberhart RC (2001) Swarm intelligence. Morgan Kaufmann, San Mateo.
12. Lin JM, Chang YW (2001) TCG: a transitive closure graph-based representation for non-slicing floorplans. In: Proceedings of the 38th conference on design automation, ACM, Las Vegas, Nevada, pp 764-769.
13. Lin JM, Chang YW, Lin SP (2003) Corner Sequence-A P-admissible floorplan representation with a worst case linear-time packing scheme, IEEE Trans VLSI Syst 11(4): 679-686.
14. Murata H, Fujiyoshi K, Nakatake S, Kajitani Y (1996) VLSI module placement based on rectangle-packing by the sequence-pair. IEEE Trans CAD 15(12): 1518-1524.
15. Nakatake S, Fujiyoshi K, Murata H, Kajitani Y (1998) Module packing based on the BSG-structure and IC layout applications. IEEE Trans CAD 17(6): 519-530.
16. Pang Y, Cheng CK, Yoshimura T (2000) An enhanced perturbing algorithm for floorplan design using the O-tree representation. In: Proceedings of the ACM international physical design symposia, pp 168-173.
17. Petalas YG, Parsopoulos KE, Vrahatis MN (2009) Improving fuzzy cognitive maps learning through memetic particle swarm optimization. Soft Comput 11: 77-94.
18. Rahimi-Vahed AR, Mirghorbani SM, Rabbani M (2007) A new particle swarm algorithm for a multi-objective mixed-model assembly line sequencing problem. Soft Comput 11: 997-1012.
19. Ratnaweera A, Halgamuge SK (2004) Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients. IEEE Trans Evol Comput 8(3): 240-255.
20. Shi YH, Eberhart RC (1998) Parameter selection in particle swarm optimization. In: Eiben A, Porto V, Saravanan N, Waagen D (eds) Evolutionary programming VII. Springer, San Diego, pp 591-600.
21. Shi YH, Eberhart RC (2000) Experimental study of particle swarm optimization. In: Proceedings of the world multiconference on systemics, cybernetics and informatics 2000, Orlando, FL.
22. Shi YH, Eberhart RC (2001) Fuzzy adaptive particle swarm optimization. In: Proceedings of the IEEE congress on evolutionary computation. Seoul, Korea, IEEE Press, New York, pp 101-106.
23. Suganthan PN (1999) Particle swarm optimizer with neighborhood operator. In: Proceedings of IEEE international congress on evolutionary computation, vol 3, pp 1958-1962.
24. Sun TY, Hsieh ST, Wang HM, Lin CW (2006) Floorplanning based on particle swarm optimization. In: 2006 IEEE computer society annual symposium on VLSI, Karlsruhe, Germany. IEEE, pp 7-11.
25. Tang M, Sebastian A (2005) A genetic algorithm for VLSI floorplanning using O-tree representation. Lect Notes Comput Sci 3449: 215-224.
26. Tang M, Yao X (2007) A genetic algorithm for VLSI floorplanning. IEEE Trans Syst Man Cybern B 37(1): 62-69.
27. Valenzuela CL, Wang PY (2002) VLSI placement and area optimization using a genetic algorithm to breed normalized postfix expressions. IEEE Trans Evol Comput 6(4): 390-401.
28. Wang XG, Yao LS, Gan JR (2002) VLSI floorplanning method based on genetic algorithms. Chin J Semicond 23(3): 330-335.