Jongsok Choi M.A.Sc Candidate, University of Toronto.

Slides:



Advertisements
Similar presentations
Numbers Treasure Hunt Following each question, click on the answer. If correct, the next page will load with a graphic first – these can be used to check.
Advertisements

Repaso: Unidad 2 Lección 2
1 A B C
Scenario: EOT/EOT-R/COT Resident admitted March 10th Admitted for PT and OT following knee replacement for patient with CHF, COPD, shortness of breath.
Variations of the Turing Machine
AP STUDY SESSION 2.
1
Copyright © 2003 Pearson Education, Inc. Slide 1 Computer Systems Organization & Architecture Chapters 8-12 John D. Carpinelli.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 4 Computing Platforms.
Sequential Logic Design
Processes and Operating Systems
Copyright © 2013 Elsevier Inc. All rights reserved.
Copyright © 2011, Elsevier Inc. All rights reserved. Chapter 6 Author: Julia Richards and R. Scott Hawley.
Properties Use, share, or modify this drill on mathematic properties. There is too much material for a single class, so you’ll have to select for your.
David Burdett May 11, 2004 Package Binding for WS CDL.
1 RA I Sub-Regional Training Seminar on CLIMAT&CLIMAT TEMP Reporting Casablanca, Morocco, 20 – 22 December 2005 Status of observing programmes in RA I.
Local Customization Chapter 2. Local Customization 2-2 Objectives Customization Considerations Types of Data Elements Location for Locally Defined Data.
Custom Statutory Programs Chapter 3. Customary Statutory Programs and Titles 3-2 Objectives Add Local Statutory Programs Create Customer Application For.
CALENDAR.
1 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt BlendsDigraphsShort.
1 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt RhymesMapsMathInsects.
1 Click here to End Presentation Software: Installation and Updates Internet Download CD release NACIS Updates.
The 5S numbers game..
Photo Slideshow Instructions (delete before presenting or this page will show when slideshow loops) 1.Set PowerPoint to work in Outline. View/Normal click.
Break Time Remaining 10:00.
Turing Machines.
Table 12.1: Cash Flows to a Cash and Carry Trading Strategy.
PP Test Review Sections 6-1 to 6-6
Bright Futures Guidelines Priorities and Screening Tables
EIS Bridge Tool and Staging Tables September 1, 2009 Instructor: Way Poteat Slide: 1.
EE466: VLSI Design Lecture 7: Circuits & Layout
Chapter 3 Logic Gates.
MICROELETTRONICA CMOS THEORY Lezione 2.
Outline Minimum Spanning Tree Maximal Flow Algorithm LP formulation 1.
Bellwork Do the following problem on a ½ sheet of paper and turn in.
Operating Systems Operating Systems - Winter 2012 Chapter 4 – Memory Management Vrije Universiteit Amsterdam.
Operating Systems Operating Systems - Winter 2010 Chapter 3 – Input/Output Vrije Universiteit Amsterdam.
Exarte Bezoek aan de Mediacampus Bachelor in de grafische en digitale media April 2014.
TESOL International Convention Presentation- ESL Instruction: Developing Your Skills to Become a Master Conductor by Beth Clifton Crumpler by.
Sample Service Screenshots Enterprise Cloud Service 11.3.
Copyright © 2012, Elsevier Inc. All rights Reserved. 1 Chapter 7 Modeling Structure with Blocks.
1 RA III - Regional Training Seminar on CLIMAT&CLIMAT TEMP Reporting Buenos Aires, Argentina, 25 – 27 October 2006 Status of observing programmes in RA.
Basel-ICU-Journal Challenge18/20/ Basel-ICU-Journal Challenge8/20/2014.
1..
CONTROL VISION Set-up. Step 1 Step 2 Step 3 Step 5 Step 4.
Adding Up In Chunks.
MaK_Full ahead loaded 1 Alarm Page Directory (F11)
1 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt Synthetic.
Artificial Intelligence
: 3 00.
5 minutes.
1 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit.
Analyzing Genes and Genomes
1 Let’s Recapitulate. 2 Regular Languages DFAs NFAs Regular Expressions Regular Grammars.
Speak Up for Safety Dr. Susan Strauss Harassment & Bullying Consultant November 9, 2012.
Essential Cell Biology
Converting a Fraction to %
Clock will move after 1 minute
PSSA Preparation.
Essential Cell Biology
Immunobiology: The Immune System in Health & Disease Sixth Edition
Physics for Scientists & Engineers, 3rd Edition
Energy Generation in Mitochondria and Chlorplasts
Select a time to count down from the clock above
Copyright Tim Morris/St Stephen's School
1.step PMIT start + initial project data input Concept Concept.
How to create Magic Squares
1 Decidability continued…. 2 Theorem: For a recursively enumerable language it is undecidable to determine whether is finite Proof: We will reduce the.
Presentation transcript:

Jongsok Choi M.A.Sc Candidate, University of Toronto

Overview TSMC 0.35 um technology Cadence tools Less than 2mm X 2mm die area Design time = 1 month Tile based approach Each tile contains a Logic Block, 2 Connections Blocks and a Switch Box Pass transistor approach 2

References Architecture and CAD for Deep-Submicron FPGAs 3

Presentation Outline Schematics Base Cells – Pass transistor, SRAM, Multiplexer Logic Block – LUT, Set/Reset Logic, D-flipflop Connection Box – Right, Bottom Switch Box Tile 2X2 Programming Circuitry – Row, Column FPGA 4X4 – Programming a multiplier FPGA 32X16 – full schematic Layouts Base Cells – SRAM, Multiplexer, Pull-up Buffer Logic Block – LUT, Set/Reset Logic, D-flipflop Connection Box – Right, Bottom Programming Circuitry – Row, Column Tile – Single tile, Tile 2X2 FPGA 4X4 – Post-layout simulation of programmed multiplier FPGA 32X16 – floor plan, full layout Clock tree – H-tree implemented Complete layout with Padframe DRC, LVS Results Employed layout techniques and Conclusions

Schematics 5

Base Cells Schematic Simulation o Pass transistor 6 Highlighted red boxes in the top right hand corner indicate where this cell is used (e.g. Pass transistor is used in the logic element, connection boxes 1 and 2, and the switch block)

Base Cells Schematic Simulation o SRAM cell : to program the FPGA with the required functionality 7

Base Cells Schematic: Simulation o 2-to-1 Multiplexer 8

Base Cells Schematic Simulation Sel2/Sel1out 11IN_1 10IN_2 01IN_3 00IN_4 o 4-to-1 Multiplexer: to choose between the four SRAM bits in the LUT 9

Logic Block Top-level Schematic 10

Logic Block - LUT Schematic Simulation 11

Logic Block – Set/Reset Logic Schematic: Simulatio n When Sram 1, 2 set to 1 => Set= 1 When Sram 1, 2 set to 0 => Reset= 1 12

Logic Block – D-Flip Flop Simulation Schematic 13

Connection Box -Right Schematic Simulation Track2 selected when SRAM set to 0 Track1 selected when SRAM set to 1 o Functionality: Connect vertical tracks to logic element 14

Connection Box -Bottom Top Level Schematic Output from CB to Tracks Input to CB from Tracks 15

Switch Box Schematic 16

TILE 2x2 V1 V2V3 V4 H1 H2 H3 H4 Schematic: Each tile has different connections at the switch box Segmented and staggered routing structure for FPGA Segment Length of 2 17

Programming Circuitry – Programming Column Schematic Simulation 18

Schematic Simulation Programming Circuitry – Programming Row 19

FPGA 4x4 Schematic 20

FPGA Mapping and Programming bits for a 2 by 2 Multiplier Table shows manually created bitstream to program the multiplier using 4X4 tiles with programming circuits 21 FPGA 4x4

Input 1 Input 2 Bit[3] Simulation 2 by 2 Multiplier correctly implemented Shows correct output for all possible inputs Bit[2] Bit[1] Bit[0] Numbers shows total output 22

FPGA 32x16 – Full Schematic 23

Layouts 24

Base Cells Schematic Layout 25 o SRAM cell : to program the FPGA with the required functionality

Base Cells Schematic Layout Sel2/Sel1out 11IN_1 10IN_2 01IN_3 00IN_4 26 o 4-to-1 Multiplexer: to choose between the four SRAM bits in the LUT

Base Cells Layout 27 o Pull-up buffer: used to pull the degraded signal back up to VDD

Logic Block 28 Top-level Schematic

Logic Block - LUT Layout 29 Schematic Layout

Logic Block – Set/Reset Logic Schematic Layout 30

Logic Block – D-flipflop Layout 31 Schematic

Logic Block LUTSet/Reset Buffer_inverter for clock Pullup Buffer D-flipflop 32 Layout

Connection Box -Right 33 Layout Schematic

Connection Box - Bottom 34 Top-level Schematic Output from Connection box to Tracks

Programming Circuitry – Programming Column 35 Layout Schematic

36 Programming Circuitry – Programming Column

37 Programming Circuitry – Programming Row Layout Schematic

38 Programming Circuitry – Programming Row

Tile 39 Schematic

Tile -Layout 40 Logic Element Right Connection Box Bottom Connection BoxSwitch Box

TILE 2x2 - Layout 41

FPGA 4x4 - Layout 42

43 FPGA Mapping and Programming bits for a 2 by 2 Multiplier Table shows manually created bitstream to program the multiplier using 4X4 tiles with programming circuits FPGA 4x4 - Post Layout Simulation

FPGA 4x4 – Post-Layout Simulation Input 1 Input 2 44 Bit[3] Bit[2] Bit[1] Bit[0] Numbers shows total output Post-Layout Simulation 2 by 2 Multiplier correctly implemented Shows correct output for all possible inputs Matches schematic simulations

32x16 Tiles FPGA Floorplan Programming Row 4x4 Tile Programming Column 4x4 Tile mm 4x4 Tile mm 4x4 Tile 1.25 mm mm 45

FPGA 32x16 - Layout 46

Clock Tree 47 H-tree structure Perfectly symmetrical in every direction to reduce clock skew

Complete layout with Padframe 48

49 DRC - Passed

50 LVS - Passed

Layout Techniques Employed 51 General Techniques Cell pitch of 6um used, layouts optimized for area to match pitch size Shared Sources/Drains when possible to minimize area Shared VDD and ground rails between rows Hierarchical Layout Bigger cells composed of multiple smaller cells Orthogonal metal routing using M3, M4, Local routing using M1, M2 Blocks made to abut well Wider tracks for power rails to provide enough power Wider horizontal tracks, vertical tracks, and clock tree for increase drive strength

Conclusions 52 Designed a fully functional FPGA Can Implement up to 512 gates Consists of 8,704 SRAMs 148,448 transistors without padframe

Questions 53