A Cuckoo Search based Approach for Solving Standard Cell Placement Problem

Abstract

The standard cell placement (SCP) is an NP complete problem in VLSI layout which focuses on placing the cells at appropriate locations so as to minimize the resultant wirelength. The standard cell placement is one of the significant phases in VLSI circuit design. Many heuristic approaches have been developed in literature to solve this problem. The paper presents an efficient nature-inspired meta-heuristic algorithm for solving the standard cell placement problem based on cuckoo’s behavior. The performance of the proposed algorithm is tested against set of MCNC benchmarks circuits. The experimental results showed promising results of the proposed algorithm in comparison to the existing meta-genetic approach.

Keywords: Cuckoo search, standard cells, VLSI, meta-heuristics, evolutionary algorithms