Skip to main content

Advertisement

Log in

A PSO-based intelligent decision algorithm for VLSI floorplanning

  • Focus
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Floorplanning is an important issue in the very large-scale integrated (VLSI) circuit design automation as it determines the performance, size, yield and reliability of VLSI chips. This paper proposes a novel intelligent decision algorithm based on the particle swarm optimization (PSO) technique to obtain a feasible floorplanning in VLSI circuit physical placement. The PSO was applied with integer coding based on module number and a new recommended value of acceleration coefficients for optimal placement solution. Inspired by the physics of genetic algorithm (GA), the principles of mutation and crossover operator in GA are incorporated into the proposed PSO algorithm to make this algorithm to break away from local optima and achieve a better diversity. Experiments employing MCNC and GSRC benchmarks show that the proposed algorithm is effective. The proposed algorithm can avoid local minimum and performs well in convergence. The experimental results of the proposed method in this paper can also greatly help floorplanning decision making in VLSI circuit design automation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  • 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

  • de Gloria A, Faraboschi P, Olivieri M (1994) Block placement with a Boltzmann machine. IEEE Trans Comput Aided Des 13(6):694–701

    Article  Google Scholar 

  • Goldberg DE (1989) Genetic algorithm in search optimization, and machine learning, Addison-Wesley, Reading

    Google Scholar 

  • 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

  • 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

  • Gwee B, Lin M (1999) A GA with heuristic based decode for IC floorplanning. Integr VLSI J 28(2):157–172

    Article  Google Scholar 

  • 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

  • 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

    Article  Google Scholar 

  • 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

  • Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of the IEEE international conference on neural networks, Piscataway, NJ, pp 1942–1948

  • Kennedy J, Eberhart RC (2001) Swarm intelligence. Morgan Kaufmann, San Mateo

    Google Scholar 

  • 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

  • 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

    Article  Google Scholar 

  • 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

    Google Scholar 

  • 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

    Google Scholar 

  • 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

  • Petalas YG, Parsopoulos KE, Vrahatis MN (2009) Improving fuzzy cognitive maps learning through memetic particle swarm optimization. Soft Comput 11:77–94

    Google Scholar 

  • 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

    Google Scholar 

  • Ratnaweera A, Halgamuge SK (2004) Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients. IEEE Trans Evol Comput 8(3):240–255

    Article  Google Scholar 

  • 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

    Chapter  Google Scholar 

  • 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

  • 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

  • Suganthan PN (1999) Particle swarm optimizer with neighborhood operator. In: Proceedings of IEEE international congress on evolutionary computation, vol 3, pp 1958–1962

  • 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

  • Tang M, Sebastian A (2005) A genetic algorithm for VLSI floorplanning using O-tree representation. Lect Notes Comput Sci 3449:215–224

    Article  Google Scholar 

  • Tang M, Yao X (2007) A genetic algorithm for VLSI floorplanning. IEEE Trans Syst Man Cybern B 37(1):62–69

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

  • Wang XG, Yao LS, Gan JR (2002) VLSI floorplanning method based on genetic algorithms. Chin J Semicond 23(3):330–335

    Google Scholar 

Download references

Acknowledgments

This work is supported by the National Basic Research Program of China under Grant No. 2006CB805904, the National Natural Science Foundation of China under Grant No. 10871221, the Key Project of Fujian Provincial Natural Science Foundation of China under Grant No. A0820002, Fujian Provincial Natural Science Foundation of China under Grant No. 2009J01284, the project development foundation of Education Committee of Fujian province under Grand No. JA08011.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wenzhong Guo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, G., Guo, W. & Chen, Y. A PSO-based intelligent decision algorithm for VLSI floorplanning. Soft Comput 14, 1329–1337 (2010). https://doi.org/10.1007/s00500-009-0501-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-009-0501-6

Keywords

Navigation