IC Floorplanning Optimization using Simulated Annealing with Order-based Representation

Full Text (PDF, 389KB), PP.62-70

Views: 0 Downloads: 0


Rajendra Bahadur Singh 1,* Anurag Singh Baghel 1

1. School of Information & Communication Technology, Gautam Buddha University, Greater Noida, India

* Corresponding author.

DOI: https://doi.org/10.5815/ijisa.2021.02.05

Received: 16 Feb. 2020 / Revised: 13 May 2020 / Accepted: 16 Oct. 2020 / Published: 8 Apr. 2021

Index Terms

Floorplanning, simulated annealing, order based representation, MCNC benchmark, NP-hard


Integrated Circuits (IC) floorplanning is an important step in the integrated circuit physical design; it influences the area, wire-length, delay etc of an IC. In this paper, Order Based (OB) representation has been proposed for fixed outline floorplan with Simulated Annealing (SA) algorithm. To optimize the IC floorplan, two physical quantities have been considered such as area, and wire-length for hard IP modules. Optimization of the IC floorplan works in two phases. In the first phase, floorplans are constructed by proposed representation without any overlapping among the modules. In the second phase, Simulated Annealing algorithm explores the packing of all modules in floorplan to find better optimal performances i.e. area and wire-length. The Experimental results on Microelectronic Center of North Carolina benchmark circuits show that our proposed representation with SA algorithm performs better for area and wire-length optimization than the other methods. The results are compared with the solutions derived from other algorithms. The significance of this research work is improvement in optimized area and wire-length for modern IC.

Cite This Paper

Rajendra Bahadur Singh, Anurag Singh Baghel, "IC Floorplanning Optimization using Simulated Annealing with Order-Based Representation", International Journal of Intelligent Systems and Applications(IJISA), Vol.13, No.2, pp.62-70, 2021. DOI:10.5815/ijisa.2021.02.05


[1] C. J. Alpert and D. P. Mehta, Handbook of algorithm for physical design automation", Auerbach Publications, pp. 139-142, 2008.
[2] S. K. Lim, “Practical problems in VLSI physical design automation,” Springer Science & Business Media, 2008.
[3] Sarrafzadeh, Majid, and C. K. Wong.An introduction to VLSI physical design. McGraw-Hill Higher Education, 1996.
[4] Singh, Rajendra Bahadur, Anurag Singh Baghel, and Ayush Agarwal. "A review on VLSI floorplanning optimization using metaheuristic algorithms." Electrical, Electronics, and Optimization Techniques (ICEEOT), International Conference on. IEEE, 2016, pp. 4198 – 4202.
[5] Jianli Chen, Wenxing Zhu, and M.M.Ali, “A Hybrid Simulated Aneealing Algorithm for Nonslicing VLSI Floor-planning,” IEEE Trans.on Systems,Man and Cybernetics, Part C, vol.41, No.4, pp. 544–553, July 2011.
[6] Sivaranjani, P., and A. Senthil Kumar. "Hybrid Particle Swarm Optimization-Firefly algorithm (HPSOFF) for combinatorial optimization of non-slicing VLSI floorplanning." Journal of Intelligent & Fuzzy Systems 32.1 (2017): 661-669.
[7] Tang, Maolin, and Alvin Sebastian. "A genetic algorithm for VLSI floorplanning using O-tree representation." In Workshops on Applications of Evolutionary Computation, pp. 215-224. Springer, Berlin, Heidelberg, 2005.
[8] Valenzuela, Christine L., and Pearl Y. Wang. "VLSI placement and area optimization using a genetic algorithm to breed normalized postfix expressions." IEEE Transactions on Evolutionary Computation 6.4 (2002): 390-401.
[9] Esbensen, Henrik. "A genetic algorithm for macro cell placement." In Proceedings of the conference on European design automation, IEEE Computer Society Press, 1992 pp. 52-57.
[10] Zou, Dexuan, et al. "A memory-based simulated annealing algorithm and a new auxiliary function for the fixed-outline floorplanning with soft blocks." Journal of Ambient Intelligence and Humanized computing (2017) pp.1-12.
[11] Rajendra Bahadur Singh, Anurag Singh Baghel, “Simulated Annealing algorithm for VLSI floorplanning for soft blocks”, International Journal of Computer Science & Information Security (IJCSIS), April 2018.
[12] Tsung-Ying Sun, Sheng-Ta Hsieh, Hsiang-Min Wang,and Cheng-Wei Lin, “Floorplanning Based on Particle Swarm Optimization,” Proceedings of the 2006 Emerging VLSI Technologies and Architectures (ISVLSI’06), 2006.
[13] Paramasivam, Sivaranjani, et al. "Optimization of Thermal Aware VLSI Non-Slicing Floorplanning Using Hybrid Particle Swarm Optimization Algorithm-Harmony Search Algorithm." Circuits and Systems 7.05 (2016): 562.
[14] Jianli Chen and Wenxing Zhu, “A Hybrid Genetic Algorithm For VLSI Floor-planning,” IEEE Transaction on Intelligent Computing and Intelligent Systems , vol.2, pp.128-132, 29-31 Oct. 2010.
[15] Tang, Maolin, and Xin Yao. "A memetic algorithm for VLSI floorplanning." IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) 37.1 (2007): 62-69.
[16] Lienig, Jens. "A parallel genetic algorithm for performance-driven VLSI routing." IEEE Transactions on Evolutionary Computation 1.1 (1997): 29-39.
[17] Nakaya, Shingo, Tetsushi Koide, and Si Wakabayashi. "An adaptive genetic algorithm for VLSI floorplanning based on sequence-pair." Circuits and Systems, 2000. Proceedings. ISCAS 2000 Geneva. The IEEE International Symposium on. Vol. 3. IEEE, 2000.
[18] Anand, S., S. Saravanasankar, and P. Subbaraj. "A multiobjective optimization tool for Very Large Scale Integrated nonslicing floorplanning." International Journal of Circuit Theory and Applications 41.9 (2013): 904-923.
[19] Anand, S., S. Saravanasankar, and P. Subbaraj. "Customized simulated annealing based decision algorithms for combinatorial optimization in VLSI floorplanning problem." Computational Optimization and Applications 52.3 (2012): 667-689.
[20] Chen, Tung-Chieh, and Yao-Wen Chang. "Modern floorplanning based on B/sup*/-tree and fast simulated annealing." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 25.4 (2006): 637-650.
[21] Singh, Rajendra Bahadur, and Anurag Singh Baghel. "Dead space reduction of floorplan using simulated annealing algorithm." In2017 International Conference on Energy, Communication, Data Analytics and Soft Computing (ICECDS), pp. 2108-2112. IEEE, 2017.
[22] Chen G L Guo W Z, Tu X Z, Chen H W. "An Improved Genetic Algorithm for Multi-objective Optimization". ISICA'2005: Progress in Intelligent Computation and its Applications: pp. 204-210, 2005.
[23] H. Murata, K. Fujiyoshi, and Y.Kajitani, “VLSI module placement based on rectangle-packing by the sequence-pair,” IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, vol. 15, No. 12, 1996, pp. 1518-1524.
[24] Singh, Rajendra B., Anurag Singh Baghel, and Arun Solanki. "A Binary Particle Swarm Optimization for IC Floorplanning." Recent Advances in Computer Science and Communications (Formerly: Recent Patents on Computer Science) 13, no. 1 (2020): 13-21.
[25] Chen, Guolong, Wenzhong Guo, and Yuzhong Chen. "A PSO-based intelligent decision algorithm for VLSI floorplanning." Soft Computing 14.12 (2010): 1329-1337.