Scribd
Upload
9 views2 pages

CAD for VLSI: Channel Routing Tutorial

Uploaded by

rohanseeeee
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views2 pages

CAD for VLSI: Channel Routing Tutorial

Uploaded by

rohanseeeee
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

School of Electronics Engineering

Department of Micro and Nanoelectronics


Vellore Ins tute of Technology, Vellore
Course: CAD for VLSI (MAVLD601)
Faculty: Ki ur Harish Mallikarjun
Tutorial Sheet-6
Answer all the ques ons.

Q1. Given the following instance of the channel rou ng problem:

TOP = [2,1,5,1,2,3,6]

BOT = [5,3,6,4,0,2,4]

i) Determine the maximal sets and find a lower bound on the channel width
ii) Draw the HCG and the VCG
iii) Use the Le Edge Algorithm to route the channel

Q2. For the netlist given below find an assignment of nets to tracks to complete the rou ng. Use
doglegs to break the cycles.

TOP = [1,4,2,0,2,3,4,5]

BOT = [2,0,3,3,1,4,5,5]

Q3. For the netlist given below find an assignment of nets to tracks to complete the rou ng. Use the
le edge algor hm

TOP = [1,0,1,4,2,5,0,4,7,0,5,0,0,8]

BOT = [0,2,3,0,3,6,0,0,0,8,6,0,7,0]

Solu on:
Q4. For the netlist given below find an assignment of nets to tracks to complete the rou ng. Use
doglegs to break the cycles.

TOP = [0,1,2,2,4,3,0,0]

BOT = [1,2,0,3,3,0,4,4]

Solu on:

-x-x-x-

You might also like