On solving partition driven standard cell placement problem using firefly-based metaheuristic approach
by Maninder Kaur; Pradip Kumar Sharma
International Journal of Bio-Inspired Computation (IJBIC), Vol. 9, No. 2, 2017

Abstract: The standard-cell placement problem has drawn great attention in the VLSI CAD domain. Being an NP complete problem, a spacious range of heuristic approaches exist in the literature for expeditiously organising the circuit elements on a VLSI chip design. The advancement in the partitioning algorithms has made the recursive bisection-based placement more attractive. The paper presents a metaheuristic approach based on firefly algorithm for partition-driven global standard cell placement. The algorithm is tested against circuits from the MCNC and IBM benchmark circuits and gives promising results in comparison to meta genetic approach.

Online publication date: Tue, 21-Mar-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com