IMPLEMENTATION OF VARIOUS ROUTING AND MAZE FOR VLSI ARCHITECTURE

Abstract

ield 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...