CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

VLSI Routing in Multiple Layers using Grid based Routing Algorithms

by Sonali Sen
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 93 - Number 16
Year of Publication: 2014
Authors: Sonali Sen
10.5120/16303-6210

Sonali Sen . VLSI Routing in Multiple Layers using Grid based Routing Algorithms. International Journal of Computer Applications. 93, 16 ( May 2014), 41-45. DOI=10.5120/16303-6210

@article{ 10.5120/16303-6210,
author = { Sonali Sen },
title = { VLSI Routing in Multiple Layers using Grid based Routing Algorithms },
journal = { International Journal of Computer Applications },
issue_date = { May 2014 },
volume = { 93 },
number = { 16 },
month = { May },
year = { 2014 },
issn = { 0975-8887 },
pages = { 41-45 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume93/number16/16303-6210/ },
doi = { 10.5120/16303-6210 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:15:56.908648+05:30
%A Sonali Sen
%T VLSI Routing in Multiple Layers using Grid based Routing Algorithms
%J International Journal of Computer Applications
%@ 0975-8887
%V 93
%N 16
%P 41-45
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Aim of this paper is to describe a multi-layer grid routing algorithm which gives a better result over the existing algorithms. Given a multilayer grid routing area, considered the global routing problem of selecting a maximum set of nets, such that every net can be routed entirely in one of the given layers without violating the physical capacity constraints. The contribution of this paper is of threefold. First, we formulate the problem as an integer linear program (ILP). Second, we write an algorithm which proposed identical routing layers for each net using global routing . Our algorithm gives results which are guaranteed to be within a certain range of the global optimal solution and runs in polynomial-time. Finally we demonstrate that the complexity of our algorithm can be significantly reduced in the worst case prediction.

References
  1. Naveed Sherwani ,"Algorithms for VLSI Physical Design Automation" ,Third Edition.
  2. David Szeszler, "Combinatorial Algorithms in VLSI Routing" PhD Dissertation, 2005.
  3. Ion I. Mandoiu ,"Application Algorithms for VLSI Routing" , Georgia Institute of Technology, August 2000.
  4. Mohamed Saad, Anthony Vanelli and Hu Zhang, "A Global Routing Algorithm in Multilayer IC" , Lehigh University, Report-08T-004 June 5,2008.
  5. J. Cong, M. Hossain and N. A. Sherwani, "A Multilayer Topological Planar Routing Algorithm in IC Layout Designs" , IEEE Transactions on Computer Aided Design of IC and Systems,Vol-12,no. 1,pp. 70-78, Jan -1993.
  6. J. Cong, C. C. Chang, "An Efficient Approach to Multilayer Assignment with an Application", IEEE Transactions on Computer Aided Design of IC and Systems, Vol-18, no. 5,pp. 608-620, Jan -1999.
Index Terms

Computer Science
Information Sciences

Keywords

VLSI Routing Global Routing Grid based Routing Multilayer Routing Hadlock Algorithm.

Powered by PhDFocusTM