Publicado en 3C Tecnología. Special Issue – March 2020

Autores

• K. Jeya Prakash
• P. Sivakumar

Resumen

To reduce the premature convergence of the optimization problem, the genetic algorithm with local search called “memetic algorithm” is introduced. The proposed memetic algorithm can partition a complex circuit design into a few sub-circuits. The aim of this paper is to reduce the interconnects between the partitioned blocks. The experimental results show that the method is effective for solving the given input and to find the minimum cut size. Applying memetic algorithm like Hill Climbing algorithm for 3D IC partitioning is the novelty in this work.

Artículo

Palabras clave

Memetic algorithm, Genetic algorithm, Circuit partition, Cut size.

Articulos relacionados

• New Intuition on Ear Authentication with Gabor Filter Using Fuzzy Vault
• Optimal choice of supervised techniques for MR image classification
• Intelligent gas booking and leakage system using wireless sensor networks
• Smart driving system with automatic driver alert and braking mechanism
• Implementation of differential evolution algorithm to perform image fusion for identifying brain tumor
• Design of Modified March-C Algorithm and Built-in Self-Test Architecture for Memories
• The human ear recognition based on phase-based matching algorithm
• Music recommendation system based on facial emotion recognition
• Survey on various perspectives of Raman Amplifiers
• Queuing system in Synchronous Optical Network (SONET)