A Lobal Optimization Algorithm for VLSI Floor planning Problems

 
 
 
  • Abstract
  • Keywords
  • References
  • PDF
  • Abstract


    Floorplanning is an important step for building a module design methodology. Floorplanning give early feedback that evaluates field of study choices, estimates chip space ,delay and congestion caused by wiring. As technology advances, style complexness are increasing and therefore the circuit size is obtaining larger. To deal with the increasing style complexness, hierarchic style and holding modules are widely used. This makes floorplanning coming up with way more essential to the standard of a really massive Scale Integration (VLSI) style, for several years, floorplanning comes up with could be an essential step, because it sets up the bottom work for a layout. However, the method of crucial blocks, shapes and positions with space step-down objective and ratio demand is observed as floorplanning. Common strategy for blocks floorplanning is to see within the 1st part so the relative location of the blocks to every different supported connection-cost criteria, within the second step, block filler is performed with the goal of minimizing the chip space and therefore the location of every block is finalized. From the machine purpose of read, VLSI floorplanning is NP-hard. The answer area can increase exponentially with the expansion of circuit scale, so it's tough to seek out the best answer by exploring the world answer area. To handle this complexness swarm based optimisation technique has opted during this projected work. A generalize answer has developed to require care of space likewise as interconnection wire length. to realize this weighted objective perform has outlined. the benefits of PSO like simplicity in implementation, and the Stimulated Annealing is used to reduce the hotspots in the circuits and much more effective way Genetic Algorithm is used obtain better optimization techniques

     

     


  • Keywords


    Floorplanning, ,Genetic Algorithm ,Stimulated Annealing, PSO ,Area Optimization

  • References


      [1] M. Tang and X. Yao, "A Memetic Algorithm for VLSI Floorplanning," in IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), vol. 37, no. 1, pp. 62-69, Feb. 2017

      [2] Chang-Tzu Lin, De-Sheng Chen, Yiwen. Wang ,”An Efficient Genetic Algorithm for Slicing Floorplan Area Optimization,” Proceedings of the International Symposium on Circuits And Systems, pp. 879-882, 2016.

      [3] Valenzuela C.L. and Wang P.Y., ”VLSI placement and area optimization Valenzuela C.L. and Wang P.Y., ”VLSI placement and area optimization using a genetic algorithm to breed normalized postfix expressions,” IEEE Transactions on Evolutionary Computation, pp. 390–401, 2017

      [4] R. B. Singh, A. S. Baghel and A. Agarwal, "A review on VLSI floorplanning optimization using metaheuristic algorithms," 2016 International Conference on Electrical, Electronics, and Optimization Techniques (ICEEOT), Chennai, 2016, pp. 4198-4202

      [5] B. Gwee and M. Lim, “A GA with heuristic based decode for IC floor planning,” ,” Proceedings of the International Symposium on Circuits And Systems, VLSI J., vol. 28, no. 2, pp. 157–172, 2013

      [6] P. Moscato, “On evolution, search, optimization, genetic algorithms a Towards memetic algorithms,” International Conference on Electrical, Electronics, and Optimization Techniques .,Pasadena, Tech. Rep. 826, 2017

      [7] S. Nag and K. Chaudhary, “Post-Placement ResidualOverlap Removal with Minimal Movement”, Transactions on Systems, Man, and Cybernetics, pp. 581-586, 2018

      [8] H. Murata, K. Fujiyoshi, S. Nakatake and Y. Kajitani,“VLSI module placement based on rectangle-packing by the sequence pair”, IEEE Transactions on Evolutionary Computation. on CAD, vol 15(12), pp.1518-1524, 2015

      [9] Isao Tazawa, Seiichi Koakutsu, and Hironori Hirata, “An Immunity based Genetic Algorithm and its Application to the VLSI Floorplan Design Problem,” Proceedings of IEEE International Conference on Evolutionary Computation, pp. 417 –421, 2018.

      [10] Ho, and X.-I. Chang, “An efficient generalized multiobjective evolutionary algorithm,” Proceedings of the Genetic and Evolutionary Computation Conference, pp. 871-878, 2014.

      [11] Yun-Chih Chang; Yao-Wen Chang; Guang-Ming Wu; Shu-Wei Wu,“B*-trees: A New

      [12] Representation for Non-slicing Floorplans,” Proceedings of the Design Automation Conference, pp. 458 –463, 2000.

      [13] D. F. Wong, and C. L. Liu, “A New Algorithm for Floorplan Design,” Proceedings of the Design Automation Conference, pp.101–107, 2016.

      [14] Valenzuela C.L. and Wang P.Y., ”VLSI placement and area optimization using a genetic algorithm to breed normalized postfix expressions,” IEEE Transactions on Evolutionary Computation, pp. 390–401, 2017.

      [15] Chang-Tzu Lin, De-Sheng Chen, Yiwen.Wang, ”An Efficient Genetic Algorithm for Slicing Floorplan Area Optimization,” Proceedings of the International Symposium on Circuits And Systems, pp. 879-882, 2014.

      [16] E.K. Burke and G. Kendall, "Evaluation of Two Dimensional Bin Packing Problem using the No Fit Polygon", Proceedings of the 26th International Conference on Computers and Industrial Engineering, Melbourne, Australighjjna, 15-17 December 2015, pp 286-291

      [17] Dr. AntoBennet, M, Sankar Babu G, Suresh R, Mohammed Sulaiman S, Sheriff M, Janakiraman G ,Natarajan S, “Design & Testing of Tcam Faults Using TH Algorithm”, Middle-East Journal of Scientific Research 23(08): 1921-1929, August 2015 .

      [18] Dr. AntoBennet, M “Power Optimization Techniques for sequential elements using pulse triggered flipflops”, International Journal of Computer & Modern Technology , Issue 01 ,Volume01 ,pp 29-40, June 2015.

      [19] Dr. AntoBennet, M,Manimaraboopathy M,P. Maragathavalli P,Dinesh Kumar T R, “Low Complexity Multiplier For Gf(2m) Based All One Polynomial”, Middle-East Journal of Scientific Research 21 (11): 2064-2071, October 2014.


 

View

Download

Article ID: 28924
 
DOI: 10.14419/ijet.v7i4.6.28924




Copyright © 2012-2015 Science Publishing Corporation Inc. All rights reserved.