Please use this identifier to cite or link to this item: http://dspace.dtu.ac.in:8080/jspui/handle/repository/13599
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSARKAR, INDRAJIT-
dc.date.accessioned2011-04-13T09:56:02Z-
dc.date.available2011-04-13T09:56:02Z-
dc.date.issued2006-07-18-
dc.identifier.urihttp://dspace.dtu.ac.in:8080/jspui/handle/repository/13599-
dc.descriptionME THESISen_US
dc.description.abstractield Programmable Gate Array (FPGAs) have emerged as an attractive means of implementing logic circuits providing instant manufacturing turnaround and negligible prototype costs. They hold the promise of replacing much of the VLSI market now held by Mask Programmed Gate Arrays. An important phase in FPGA production is the routing of the cells present inside the arrays for which several CAD tools have been developed. My project is another attempt to implement these routing algorithms which deals with Global and Detailed Routing problems. Two Maze Routing Algorithms-Lee’s and Soukup’s Algorithms and also multilayer maze routing algorithm is studied and implemented. These algorithms are a part of Global Routing phase in the design cycle of an FPGA. In other routing algorithm the spanning tree algorithm is also covered. In Detailed Routing, the channel routing problem, the segmented Channel Routing method has been covered, which in turn consists of Mask Programmed, Fully Segmented, One S...en_US
dc.language.isoenen_US
dc.relation.ispartofseriesTD 170;-
dc.subjectROUTINGen_US
dc.subjectVLSIen_US
dc.titleIMPLEMENTATION OF VARIOUS ROUTING AND MAZE FOR VLSI ARCHITECTUREen_US
Appears in Collections:M.E./M.Tech. Electronics & Communication Engineering

Files in This Item:
File Description SizeFormat 
TD-170.pdf1.82 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.