Presentation is loading. Please wait.

Presentation is loading. Please wait.

Routing LB Pin Track Switch Channel Segment. LB Conflicts in routing LB 1 2 3 1 2 3 1 2 3 A B C.

Published bySarah Drewery Modified over 9 years ago

Similar presentations

Presentation on theme: "Routing LB Pin Track Switch Channel Segment. LB Conflicts in routing LB 1 2 3 1 2 3 1 2 3 A B C."— Presentation transcript:

1 Routing LB Pin Track Switch Channel Segment

2 LB Conflicts in routing LB 1 2 3 1 2 3 1 2 3 A B C

3 Routing strategy Routing is NP – Complete

4 Row-based LB Row Based arcitecture

5 c1c2 c3 c4 c1 c2 c3 c4 c1 c2 c3 c4 Mask programmable array Not segmented c1 c2 c3 c4 Routing in row-based FPGA Totally segmented

6 2-segment routing c1 c2 c3 c4 1-segment routing c1 c2 c3 c4 Routing with segmentation c1c2 c3 c4

7 12346789105 1 2 3 c1 c2 c3 c4 c5 x0x0 6,7,1 6,1,1 1,5 2,9 On which track is the connection realised How many segments it takes to realise the connections (accumulative) Which is the first free vertical on the first, second and third track routing in given step Parameters used in routing

8 Example of routing Track 12346789105 1 2 3 c1 c2 c3 c4 c5 x0x0 N,N,7 N,6,N N,7,N 6,1,7 1,6,7 1,7,7 6,7,1 N,6,7 N,7,7 N,N,N6,1,1 1,6,1 1,1,7 1,5 2,9 3,17 3,8 2,5 3,4 2,11 3,8 1 1 2,8 1,16 1,153,20 3,19 3,20 2,19 3,20 2,21 N,N,N 6,7,N6,N,N 2,20 N,N,N 1,21 N,7,N 1,21 N,N,N 2,22 N,N,N N,N,7 2,18 2,21 N,N,N Finally 21 Finally 21 ja 22 Finally 22 ja 23

9 Track 12346789105 1 2 3 c1 c2 c3 c4 c5 Solution This routing used the least number of segments (19) The smallest number of switches is on the track and it is the fastest.

10 Track 12346789105 1 2 3 c1 c2 c3 c4 c5 x0x0 1,N,9N,N,91,1,9 3,52,91,17 Routing is not possible Diminishing the number of switches may disable routing. Switches removed Density of the channel 50% 100% Possibility of routing The location of plunge depends on the segmentation of the channel.

11 LB Interconnection resourcees LB CLK SBCB Connection arrays Long lines Connections between neighbours Symmetrical Array

12 Lengths of connections 0123401234 0123401234 0 1 2 3 4 0123401234 0123401234 0123401234 0123401234 0123401234 0123401234 10 10 10 10 2 3 4 3 33 24 24 24

13 Global router LCL CSC LCL 0 1 2 012 L C S C L 0,0 0,1 1,1 2,1 2,2

14 Detailed router L C S C L 0,0 0,1 1,1 2,1 2,2 LL CC LL 0 1 2 0 1 2 C S C 012 L C SSS CCCC CCCC

15 Cost Function LB 1 2 3 1 2 3 1 2 3 3 2 1 Shows the number of possibilities left for realising the connection at any stage of routing.

16 Problems : 1.What is the effect of CB on routing. 2.What is the effect of SB on routing. 3.How are the possibilities of SB and CB connected with routing. 4.How are the possibilities of SB and CB connected with the number of lines necessary for 100% routing 5.How are the possibilities of SB and CB connected with the sum number of keys that would guarantee 100% routing. Fs=6 Switch Block (SB) Connection Block (CB) LB Fc=2 SB and CB architectures

Download ppt "Routing LB Pin Track Switch Channel Segment. LB Conflicts in routing LB 1 2 3 1 2 3 1 2 3 A B C."

Similar presentations

An Introduction to Channel Routing

An Introduction to Channel Routing
Cadence Design Systems, Inc. Why Interconnect Prediction Doesn’t Work.

Cadence Design Systems, Inc. Why Interconnect Prediction Doesn’t Work.
3333 1111 2222 7777 6666 5555 4444 CCCC 8 CCCC. 3333 1111 2222 7777 6666 5555 4444 CCCC 8 CCCC.

CCCC 8 CCCC CCCC 8 CCCC.
Programmable Logic Devices

Programmable Logic Devices
3333 1111 2222 7777 6666 5555 4444 CCCC CCCC. 3333 1111 2222 7777 6666 5555 4444 CCCC CCCC.

CCCC CCCC CCCC CCCC.
Ch.7 Layout Design Standard Cell Design TAIST ICTES Program VLSI Design Methodology Hiroaki Kunieda Tokyo Institute of Technology.

Ch.7 Layout Design Standard Cell Design TAIST ICTES Program VLSI Design Methodology Hiroaki Kunieda Tokyo Institute of Technology.
FPGA-Based System Design: Chapter 3 Copyright  2004 Prentice Hall PTR SRAM-based FPGA n SRAM-based LE –Registers in logic elements –LUT-based logic element.

FPGA-Based System Design: Chapter 3 Copyright  2004 Prentice Hall PTR SRAM-based FPGA n SRAM-based LE –Registers in logic elements –LUT-based logic element.
ECE 667 - Synthesis & Verification - Lecture 0 1 ECE 697B (667) Spring 2006 ECE 697B (667) Spring 2006 Synthesis and Verification of Digital Circuits VLSI.

ECE Synthesis & Verification - Lecture 0 1 ECE 697B (667) Spring 2006 ECE 697B (667) Spring 2006 Synthesis and Verification of Digital Circuits VLSI.
The New FPGA Architecture by Applying The CS-Box Structure Zhou Lin, Catherine October 13, 2003.

The New FPGA Architecture by Applying The CS-Box Structure Zhou Lin, Catherine October 13, 2003.
ENGIN112 L38: Programmable Logic December 5, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 38 Programmable Logic.

ENGIN112 L38: Programmable Logic December 5, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 38 Programmable Logic.
Penn ESE535 Spring 2009 -- DeHon 1 ESE535: Electronic Design Automation Day 21: April 15, 2009 Routing 1.

Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 21: April 15, 2009 Routing 1.
VLSI Routing. Routing Problem  Given a placement, and a fixed number of metal layers, find a valid pattern of horizontal and vertical wires that connect.

VLSI Routing. Routing Problem  Given a placement, and a fixed number of metal layers, find a valid pattern of horizontal and vertical wires that connect.
ECE 665 - Routing 1 ECE 665 Spring 2004 ECE 665 Spring 2004 Computer Algorithms with Applications to VLSI CAD Channel Routing Global Routing.

ECE Routing 1 ECE 665 Spring 2004 ECE 665 Spring 2004 Computer Algorithms with Applications to VLSI CAD Channel Routing Global Routing.
34 42 49 51 53 55 57 63 67 69 71 73 77 83 Given Connections Solution 1 2 3 4 5 6 95.

Given Connections Solution
The Memory/Logic Interface in FPGA’s with Large Embedded Memory Arrays The Memory/Logic Interface in FPGA’s with Large Embedded Memory Arrays Steven J.

The Memory/Logic Interface in FPGA’s with Large Embedded Memory Arrays The Memory/Logic Interface in FPGA’s with Large Embedded Memory Arrays Steven J.
Metal Layer Planning for Silicon Interposers with Consideration of Routability and Manufacturing Cost W. Liu, T. Chien and T. Wang Department of CS, NTHU,

Metal Layer Planning for Silicon Interposers with Consideration of Routability and Manufacturing Cost W. Liu, T. Chien and T. Wang Department of CS, NTHU,
Routing 2 Outline –Maze Routing –Line Probe Routing –Channel Routing Goal –Understand maze routing –Understand line probe routing.

Routing 2 Outline –Maze Routing –Line Probe Routing –Channel Routing Goal –Understand maze routing –Understand line probe routing.
CS 151 Digital Systems Design Lecture 38 Programmable Logic.

CS 151 Digital Systems Design Lecture 38 Programmable Logic.
CSET 4650 Field Programmable Logic Devices

CSET 4650 Field Programmable Logic Devices
EGRE 427 Advanced Digital Design Figures from Application-Specific Integrated Circuits, Michael John Sebastian Smith, Addison Wesley, 1997 Chapter 7 Programmable.

EGRE 427 Advanced Digital Design Figures from Application-Specific Integrated Circuits, Michael John Sebastian Smith, Addison Wesley, 1997 Chapter 7 Programmable.

Similar presentations

Ads by Google