EECS 579: Logic and Fault Simulation. Simulation


 Rosamund Conley
 1 years ago
 Views:
Transcription
1 EECS 579: Logic and Fault Simulation Simulation: Use of computer software models to verify correctness Fault Simulation: Use of simulation for fault analysis and ATPG Circuit description Input data for C Simulation run commands Model C of target circuit Simulation control Host computer Output data for C Performance data for C Emulation: Hardwareassisted simulation using FPGAbased emulators John P. Hayes University of Michigan EECS 579 Fall 2 Lecture 23: Page Simulation Uses Reduce/eliminate need to build physical prototypes Alternative design comparison Functional design verification Timing/performance design verification Fault analysis and test generation Simulation Levels Analog (continuous) ELECTRIC CIRCUIT DEVICE/ LAYOUT Level of detail Digital (discrete) SYSTEM (BEHAVIORAL) REGISTER TRANSFER LOGIC (GATE) SWITCH Simulation cost John P. Hayes University of Michigan EECS 579 Fall 2 Lecture 23: Page 2
2 Logic Simulation Component types Gates, flipflops, switches, macro elements Signal accuracy,, X (unknown) plus a few others Timing accuracy (delay models) Transport: unit, nominal Rise/fall delay Simulator structures Compiledcode (compilerdriven) Noncompiled eventdriven John P. Hayes University of Michigan EECS 579 Fall 2 Lecture 23: Page 3 Example Logic Simulation B CLK A t t +25 t 5 ns ns t +5 t + J C K Setup time Hold time t +5 Z6 Z7 Z8 Event John P. Hayes University of Michigan EECS 579 Fall 2 Lecture 23: Page 4
3 CompiledCode Simulation Circuit model is executable code. Circuit elements are program routines linked toreflect circuit structure Simulation steps Levelize and code circuit Compile and execute Characteristics All signals are evaluated in all time periods Fast simulation of simpler circuits Inefficient with complex signal/timing Frequent recompilation often necessary John P. Hayes University of Michigan EECS 579 Fall 2 Lecture 23: Page 5 CompiledCode Simulation (Code to compute x) Level i x y Level i NAND gate G z (Code to compute y) LDA x Load x from memory into CPU accumulator A AND y Compute A.y; put in A NOT Compute complement of A STA z Store A in z (To next element) John P. Hayes University of Michigan EECS 579 Fall 2 Lecture 23: Page 6
4 CompiledCode Simulator procedure compiled_sim Read circuit description; Break feedback and levelize circuit; Generate code for gates; Initialize signal values; for each input signal vector do for each logic level do for each gate do execute gate code (simulate); end end Output desired results; end end procedure John P. Hayes University of Michigan EECS 579 Fall 2 Lecture 23: Page 7 EventDriven Simulation Circuit model is a data structure consisting of set of linked tables specifying components, their attributes, and connections Separate simulation control program processes the circuit Characteristics Signal timing calculations are eventdirected Handles complex signal/timing models Circuit models are easy to change Supports forward/backward tracing Slower for large, simple models John P. Hayes University of Michigan EECS 579 Fall 2 Lecture 23: Page 8
5 EventDriven Simulation A B G G2 CLK J C K FF Z6 Z7 Z8 Name Type Inputs Outputs Delay Other attributes G NAND A,B FFJ, Z6,5... G2 NOT A FFK,... FF JKFF G, CLK, G2 Z7, Z8... A PI G,G2 Z6 PO G etc. John P. Hayes University of Michigan EECS 579 Fall 2 Lecture 23: Page 9 EventDriven Simulation Name Type Fanin Fanout Fanin Fanout Delay Other attributes list list G NAND P P2 2 2,5... G2 NOT P3 P4,... FF JKFF P5 P A PI P7 2 Z6 PO P8 etc. P P2 P3 P4 P5 A B FF J Z6 A FF K G CLK G2 etc. Fanin/ fanout table John P. Hayes University of Michigan EECS 579 Fall 2 Lecture 23: Page
6 Example EventDriven Simulation B CLK A t t +25 t 5 ns ns t +5 t + J C K Setup time Hold time t +5 Z6 Z7 Z8 Event John P. Hayes University of Michigan EECS 579 Fall 2 Lecture 23: Page EventDriven Simulator procedure table_sim Read circuit description; Construct circuit data structures (tables); Initialize signal values and event time t repeat {with set of current events} Select event and examine its fanout list; while (unevaluated fanout signals remain) do Evaluate and schedule fanout events; Output desired results; end until (no more current events) Increment t to next event time; end procedure John P. Hayes University of Michigan EECS 579 Fall 2 Lecture 23: Page 2
7 Time Simulation Time driven: simulate entire circuit at every time step Event driven: emulate active parts of circuit only when a signal change or event occurs. EventDriven Simulation. Simulate the current event 2. Scan the circuit for implied events and schedule them 3. Advance simulation time to the next event Event scheduling methods Indexed array A[i]: Given A[current], go to A[current + T] Fast, large storage needs (static allocation) Linear list (linked list) Slow, efficient storage (dynamic allocation) Timing wheel: indexedlist that trades off speed and storage John P. Hayes University of Michigan EECS 579 Fall 2 Lecture 23: Page 3 Linked List Event Scheduling t Time Line Value Link X P P4 P Y4 X P7  X2 Other events at t = P7 5 Y5   John P. Hayes University of Michigan EECS 579 Fall 2 Lecture 23: Page 4
8 Timing Wheel Time Link 2 3 Event Scheduling Event data Event data Avoids long searches but is subject to overflow John P. Hayes University of Michigan EECS 579 Fall 2 Lecture 23: Page 5 Fault Simulation Definition Simulation designed for fault analysis and ATPG Applications Evaluate effects, e.g., criticality of given faults Evaluate coverage of a given test pattern set To aid in test pattern set generation To construct fault dictionaries To estimate manufacturing yield DL = Y d DL = probability of shipping a defective IC Y = probability that a manufactured IC is OK d = defect coverage of testing approximated by fault coverage John P. Hayes University of Michigan EECS 579 Fall 2 Lecture 23: Page 6
9 Fault Simulation Fault Models Single stuckline fault model is standard: any logic line may be stuck at or ; the logic elements are fault free Others: delay faults, short/open faults, etc. Fault Simulation Methods Serial: one fault is simulated at a time Parallel: n faults are simulated at a time Parallel method Deductive simulation Concurrent simulation etc. Statistical: fault sampling John P. Hayes University of Michigan EECS 579 Fall 2 Lecture 23: Page 7 Fault Simulation Parallel Method Each nbit word in host computer stores m kbit values, n > mk Exploits logical instruction set of host Relatively inflexible and usually requires multiple passes x x y To Evaluate z z z/ z/ y/ x/ Fault positions Mask I z : fault positions for z Mask S z : fault values Basic evaluation : z = x.y Fault insertion : z* = z.i z + I z.s z John P. Hayes University of Michigan EECS 579 Fall 2 Lecture 23: Page 8
10 Deductive Method Fault Simulation The signal on each simulated line is a list L of all faults causing errors on that line. All faults can be simulated in one pass L a L b L k a b k... F z L a = list of faults causing errors on line a L a = list of faults not causing errors on line a L a L b L c a b c d L d = {d/} L a L b L c John P. Hayes University of Michigan EECS 579 Fall 2 Lecture 23: Page 9 Example Deductive Fault Simulation a b d i h c e f L a = {a }; L b = {b }; L d = {d } L c = L a L b {c } = {dc } L e = L c L d {e } = {c,d,e } L f = {f }; L g = L e {g } = {c,d,e,g } L h = {h }; L i = {i }; L d = {d } L j = L e {j } = {c,d,e,j } g j l k n m p John P. Hayes University of Michigan EECS 579 Fall 2 Lecture 23: Page 2
11 Deductive Fault Simulation Example (cont d) a b d i h c e f g j L k = L i L h {k }= {i,h,k } L l = L j {l }= {c,d,e,j,l } L m = L k L l {m } = {i,h,k,m } L n = L g L f {n } = {c,d,e,g,n } L p = L m L n {p } = {c,d,e,g,n,i,h,k,m,p } l k n m p John P. Hayes University of Michigan EECS 579 Fall 2 Lecture 23: Page 2 Approach Emulation Map target design into a network of fieldprogrammable gate array (FPGA) ICs The programmed FPGA forms a hardware prototype of the design and can run at effective clock speed of, say, 5 MHz The emulated circuit can be instrumented as a logic analyzer to capture normal or faulty behavior Drawback Limited ability to do performance measurement John P. Hayes University of Michigan EECS 579 Fall 2 Lecture 23: Page 22
12 FPGA: Xilinx 3 series Emulation Interconnection switch box Interconnections Configurable logic block (cell) (a) Logic block Programmable connections (b) John P. Hayes University of Michigan EECS 579 Fall 2 Lecture 23: Page 23 Emulation System Emulation Host computer Host interface FPGA FPGA FPGA... FPGA FPGA Config. system Programmable interconnect John P. Hayes University of Michigan EECS 579 Fall 2 Lecture 23: Page 24
Testability. Shaahin Hessabi. Sharif University of Technology. Adapted from the presentation prepared by book authors.
Testability Lecture 6: Logic Simulation Shaahin Hessabi Department of Computer Engineering Sharif University of Technology Adapted from the presentation prepared by book authors Slide 1 of 27 Outline What
More informationVLSI Design Verification and Test Simulation CMPE 646. Specification. Design(netlist) Truevalue Simulator
Design Verification Simulation used for ) design verification: verify the correctness of the design and 2) test verification. Design verification: Response analysis Specification Design(netlist) Critical
More informationIntroduction to VLSI Testing
Introduction to 李昆忠 KuenJong Lee Dept. of Electrical Engineering National ChengKung University Tainan, Taiwan Class Problems to Think How are you going to test A 32 bit adder A 32 bit counter A 32Mb
More informationUMBC. At the system level, DFT includes boundary scan and analog test bus. The DFT techniques discussed focus on improving testability of SAFs.
Overview Design for testability(dft) makes it possible to: Assure the detection of all faults in a circuit. Reduce the cost and time associated with test development. Reduce the execution time of performing
More informationSingle StuckAt Fault Model Other Fault Models Redundancy and Untestable Faults Fault Equivalence and Fault Dominance Method of Boolean Difference
Single StuckAt Fault Model Other Fault Models Redundancy and Untestable Faults Fault Equivalence and Fault Dominance Method of Boolean Difference Copyright 1998 Elizabeth M. Rudnick 1 Modeling the effects
More informationShift Register Counters
Shift Register Counters Shift register counter: a shift register with the serial output connected back to the serial input. They are classified as counters because they give a specified sequence of states.
More informationLecture 14: State Tables, Diagrams, Latches, and Flip Flop
EE210: Switching Systems Lecture 14: State Tables, Diagrams, Latches, and Flip Flop Prof. YingLi Tian Nov. 6, 2017 Department of Electrical Engineering The City College of New York The City University
More informationClock signal in digital circuit is responsible for synchronizing the transfer to the data between processing elements.
1 2 Introduction Clock signal in digital circuit is responsible for synchronizing the transfer to the data between processing elements. Defines the precise instants when the circuit is allowed to change
More informationECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering TIMING ANALYSIS Overview Circuits do not respond instantaneously to input changes
More informationEECS150  Digital Design Lecture 18  Counters
EECS150  Digital Design Lecture 18  Counters October 24, 2002 John Wawrzynek Fall 2002 EECS150  Lec18counters Page 1 Counters Special sequential circuits (FSMs) that sequence though a set outputs.
More informationEE115C Winter 2017 Digital Electronic Circuits. Lecture 19: Timing Analysis
EE115C Winter 2017 Digital Electronic Circuits Lecture 19: Timing Analysis Outline Timing parameters Clock nonidealities (skew and jitter) Impact of Clk skew on timing Impact of Clk jitter on timing Flipflop
More informationNCU EE  DSP VLSI Design. TsungHan Tsai 1
NCU EE  DSP VLSI Design. TsungHan Tsai 1 Multiprocessor vs. Multicomputer architecture µp vs. DSP RISC vs. DSP RISC Reducedinstructionset Registertoregister operation Higher throughput by using
More informationFor smaller NRE cost For faster time to market For smaller highvolume manufacturing cost For higher performance
University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences EECS5 J. Wawrzynek Spring 22 2/22/2. [2 pts] Short Answers. Midterm Exam I a) [2 pts]
More informationNTE74176 Integrated Circuit TTL 35Mhz Presettable Decade Counter/Latch
NTE74176 Integrated Circuit TTL 35Mhz Presettable Decade Counter/Latch Description: The NTE74176 is a high speed monolithic counter in a 14 Lead plastic DIP type package consisting of four DC coupled master
More informationEECS150  Digital Design Lecture 23  FFs revisited, FIFOs, ECCs, LSFRs. Crosscoupled NOR gates
EECS150  Digital Design Lecture 23  FFs revisited, FIFOs, ECCs, LSFRs April 16, 2009 John Wawrzynek Spring 2009 EECS150  Lec24blocks Page 1 Crosscoupled NOR gates remember, If both R=0 & S=0, then
More informationVLSI Design I. Defect Mechanisms and Fault Models
VLSI Design I Defect Mechanisms and Fault Models He s dead Jim... Overview Defects Fault models Goal: You know the difference between design and fabrication defects. You know sources of defects and you
More informationProgrammable Logic Devices
Programmable Logic Devices Mohammed Anvar P.K AP/ECE AlAmeen Engineering College PLDs Programmable Logic Devices (PLD) General purpose chip for implementing circuits Can be customized using programmable
More informationIntroduction EE 224: INTRODUCTION TO DIGITAL CIRCUITS & COMPUTER DESIGN. Lecture 6: Sequential Logic 3 Registers & Counters 5/9/2010
EE 224: INTROUCTION TO IGITAL CIRCUITS & COMPUTER ESIGN Lecture 6: Sequential Logic 3 Registers & Counters 05/10/2010 Avinash Kodi, kodi@ohio.edu Introduction 2 A FlipFlop stores one bit of information
More informationAdders, subtractors comparators, multipliers and other ALU elements
CSE4: Components and Design Techniques for Digital Systems Adders, subtractors comparators, multipliers and other ALU elements Instructor: Mohsen Imani UC San Diego Slides from: Prof.Tajana Simunic Rosing
More informationEECS150  Digital Design Lecture 23  FSMs & Counters
EECS150  Digital Design Lecture 23  FSMs & Counters April 8, 2010 John Wawrzynek Spring 2010 EECS150  Lec22counters Page 1 Onehot encoding of states. One FF per state. State Encoding Why onehot encoding?
More informationMemory, Latches, & Registers
Memory, Latches, & Registers 1) Structured Logic Arrays 2) Memory Arrays 3) Transparent Latches 4) How to save a few bucks at toll booths 5) Edgetriggered Registers L13 Memory 1 General Table Lookup Synthesis
More informationLecture 10: Synchronous Sequential Circuits Design
Lecture 0: Synchronous Sequential Circuits Design. General Form Input Combinational Flipflops Combinational Output Circuit Circuit Clock.. Moore type has outputs dependent only on the state, e.g. ripple
More informationECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 7 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Week 7 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering SEQUENTIAL CIRCUITS: LATCHES Overview Circuits require memory to store intermediate
More informationNTE4035B Integrated Circuit CMOS, 4 Bit Parallel In/Parallel Out Shift Register
NTE4035B Integrated Circuit CMOS, 4 Bit Parallel In/Parallel Out Shift Register Description: The NTE4035B is a 4 bit shift register in a 16 Lead DIP type package constructed with MOS P Channel an N Channel
More informationEECS150  Digital Design Lecture 26  Faults and Error Correction. Types of Faults in Digital Designs
EECS150  Digital Design Lecture 26  Faults and Error Correction April 25, 2013 John Wawrzynek 1 Types of Faults in Digital Designs Design Bugs (function, timing, power draw) detected and corrected at
More informationDesign for Manufacturability and Power Estimation. Physical issues verification (DSM)
Design for Manufacturability and Power Estimation Lecture 25 Alessandra Nardi Thanks to Prof. Jan Rabaey and Prof. K. Keutzer Physical issues verification (DSM) Interconnects Signal Integrity P/G integrity
More informationEE141Microelettronica. CMOS Logic
Microelettronica CMOS Logic CMOS logic Power consumption in CMOS logic gates Where Does Power Go in CMOS? Dynamic Power Consumption Charging and Discharging Capacitors Short Circuit Currents Short Circuit
More informationLecture 6: TimeDependent Behaviour of Digital Circuits
Lecture 6: TimeDependent Behaviour of Digital Circuits Two rather different quasiphysical models of an inverter gate were discussed in the previous lecture. The first one was a simple delay model. This
More informationCOE 328 Final Exam 2008
COE 328 Final Exam 2008 1. Design a comparator that compares a 4 bit number A to a 4 bit number B and gives an Output F=1 if A is not equal B. You must use 2 input LUTs only. 2. Given the following logic
More informationChapter 7 Logic Circuits
Chapter 7 Logic Circuits Goal. Advantages of digital technology compared to analog technology. 2. Terminology of Digital Circuits. 3. Convert Numbers between Decimal, Binary and Other forms. 5. Binary
More informationSequential vs. Combinational
Sequential Circuits Sequential vs. Combinational Combinational Logic: Output depends only on current input TV channel selector (9) inputs system outputs Sequential Logic: Output depends not only on current
More informationCHAPTER 9: SEQUENTIAL CIRCUITS
CHAPTER 9: ASYNCHRONOUS SEUENTIAL CIRCUITS Chapter Objectives 2 Sequential circuits that are not snchronized b a clock Asnchronous circuits Analsis of Asnchronous circuits Snthesis of Asnchronous circuits
More informationSTATIC TIMING ANALYSIS
STATIC TIMING ANALYSIS Standard Cell Library NanGate 45 nm Open Cell Library Opensource standard cell library Over 62 different functions ranging from buffers, to scanable FFs with set and reset, to
More informationNTE74HC109 Integrated Circuit TTL High Speed CMOS, Dual J K Positive Edge Triggered Flip Flop w/set & Reset
NTE74HC109 Integrated Circuit TTL High Speed CMOS, Dual J K Positive Edge Triggered Flip Flop w/set & Reset Description: The NTE74HC109 is a dual J K flip flip with set and reset in a 16 Lead plastic DIP
More informationUNIT 8A Computer Circuitry: Layers of Abstraction. Boolean Logic & Truth Tables
UNIT 8 Computer Circuitry: Layers of bstraction 1 oolean Logic & Truth Tables Computer circuitry works based on oolean logic: operations on true (1) and false (0) values. ( ND ) (Ruby: && ) 0 0 0 0 0 1
More informationDigital Logic: Boolean Algebra and Gates. Textbook Chapter 3
Digital Logic: Boolean Algebra and Gates Textbook Chapter 3 Basic Logic Gates XOR CMPE12 Summer 2009 022 Truth Table The most basic representation of a logic function Lists the output for all possible
More informationNTE74HC165 Integrated Circuit TTL High Speed CMOS, 8 Bit Parallel In/Serial Out Shift Register
NTE74HC165 Integrated Circuit TTL High Speed CMOS, 8 Bit Parallel In/Serial Out Shift Register Description: The NTE74HC165 is an 8 bit parallel in/serial out shift register in a 16 Lead DIP type package
More informationLecture 8: Sequential Networks and Finite State Machines
Lecture 8: Sequential Networks and Finite State Machines CSE 140: Components and Design Techniques for Digital Systems Spring 2014 CK Cheng, Diba Mirza Dept. of Computer Science and Engineering University
More informationPropositional Logic. Logical Expressions. Logic Minimization. CNF and DNF. Algebraic Laws for Logical Expressions CSC 173
Propositional Logic CSC 17 Propositional logic mathematical model (or algebra) for reasoning about the truth of logical expressions (propositions) Logical expressions propositional variables or logical
More informationOverview of Chapter 4
Overview of hapter 4 Types of Sequential ircuits Storage Elements Latches FlipFlops Sequential ircuit Analysis State Tables State Diagrams Sequential ircuit Design Specification Assignment of State odes
More informationENGG 1203 Tutorial _03 Laboratory 3 Build a ball counter. Lab 3. Lab 3 Gate Timing. Lab 3 Steps in designing a State Machine. Timing diagram of a DFF
ENGG 1203 Tutorial _03 Laboratory 3 Build a ball counter Timing diagram of a DFF Lab 3 Gate Timing difference timing for difference kind of gate, cost dependence (1) Setup Time = t2t1 (2) Propagation
More informationTate Bilinear Pairing Core Specification. Author: Homer Hsing
Tate Bilinear Pairing Core Specification Author: Homer Hsing homer.hsing@gmail.com Rev. 0.1 March 4, 2012 This page has been intentionally left blank. www.opencores.org Rev 0.1 ii Revision History Rev.
More informationDigital Fundamentals
Digital Fundamentals Tenth Edition Floyd Chapter 9 Sections 91 thru 95 2009 Pearson Education, Upper 2008 Pearson Saddle River, Education NJ 07458. All Rights Reserved ET285 Agenda Week 2 Quiz 0: Covered
More informationChapter 5 CMOS Logic Gate Design
Chapter 5 CMOS Logic Gate Design Section 5. To achieve correct operation of integrated logic gates, we need to satisfy 1. Functional specification. Temporal (timing) constraint. (1) In CMOS, incorrect
More informationEECS150  Digital Design Lecture 16 Counters. Announcements
EECS150  Digital Design Lecture 16 Counters October 20, 2011 Elad Alon Electrical Engineering and Computer Sciences University of California, Berkeley http://wwwinst.eecs.berkeley.edu/~cs150 Fall 2011
More informationLecture A: Logic Design and Gates
Lecture A: Logic Design and Gates Syllabus My office hours 9.1510.35am T,Th or gchoi@ece.tamu.edu 333G WERC Text: Brown and Vranesic Fundamentals of Digital Logic,» Buy it.. Or borrow it» Other book:
More informationDigital Integrated Circuits A Design Perspective
Digital Integrated Circuits A Design Perspective Jan M. Rabaey Anantha Chandrakasan Borivoje Nikolic Designing Sequential Logic Circuits November 2002 Sequential Logic Inputs Current State COMBINATIONAL
More informationCMPEN 411 VLSI Digital Circuits Spring Lecture 21: Shifters, Decoders, Muxes
CMPEN 411 VLSI Digital Circuits Spring 2011 Lecture 21: Shifters, Decoders, Muxes [Adapted from Rabaey s Digital Integrated Circuits, Second Edition, 2003 J. Rabaey, A. Chandrakasan, B. Nikolic] Sp11 CMPEN
More informationKINGS COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING QUESTION BANK
KINGS COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING QUESTION BANK SUBJECT CODE: EC 1354 SUB.NAME : VLSI DESIGN YEAR / SEMESTER: III / VI UNIT I MOS TRANSISTOR THEORY AND
More informationCMSC 313 Lecture 25 Registers Memory Organization DRAM
CMSC 33 Lecture 25 Registers Memory Organization DRAM UMBC, CMSC33, Richard Chang A75 FourBit Register Appendix A: Digital Logic Makes use of tristate buffers so that multiple registers
More informationDesign at the Register Transfer Level
Week7 Design at the Register Transfer Level Algorithmic State Machines Algorithmic State Machine (ASM) q Our design methodologies do not scale well to realworld problems. q 232  Logic Design / Algorithmic
More informationSample Test Paper  I
Scheme G Sample Test Paper  I Course Name : Computer Engineering Group Marks : 25 Hours: 1 Hrs. Q.1) Attempt any THREE: 09 Marks a) Define i) Propagation delay ii) Fanin iii) Fanout b) Convert the following:
More informationDigital Electronics Sequential Logic
/5/27 igital Electronics Sequential Logic r. I. J. Wassell Sequential Logic The logic circuits discussed previously are known as combinational, in that the output depends only on the condition of the latest
More informationEEC 216 Lecture #3: Power Estimation, Interconnect, & Architecture. Rajeevan Amirtharajah University of California, Davis
EEC 216 Lecture #3: Power Estimation, Interconnect, & Architecture Rajeevan Amirtharajah University of California, Davis Outline Announcements Review: PDP, EDP, Intersignal Correlations, Glitching, Top
More informationFinite State Machine (FSM)
Finite State Machine (FSM) Consists of: State register Stores current state Loads next state at clock edge Combinational logic Computes the next state Computes the outputs S S Next State CLK Current State
More informationDistributed by: www.jameco.com 18008314242 The content and copyrights of the attached material are the property of its owner. INTEGRATED CIRCUITS DATA SHEET For a complete data sheet, please also download:
More informationBoolean Algebra. Digital Logic Appendix A. Postulates, Identities in Boolean Algebra How can I manipulate expressions?
Digital Logic Appendix A Gates Combinatorial Circuits Sequential Circuits Other operations NAND A NAND B = NOT ( A ANDB) = AB NOR A NOR B = NOT ( A ORB) = A + B Truth tables What is the result of the operation
More informationSIR C.R.REDDY COLLEGE OF ENGINEERING ELURU DIGITAL INTEGRATED CIRCUITS (DIC) LABORATORY MANUAL III / IV B.E. (ECE) : I  SEMESTER
SIR C.R.REDDY COLLEGE OF ENGINEERING ELURU 534 007 DIGITAL INTEGRATED CIRCUITS (DIC) LABORATORY MANUAL III / IV B.E. (ECE) : I  SEMESTER DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING DIGITAL
More informationElliptic Curve Group Core Specification. Author: Homer Hsing
Elliptic Curve Group Core Specification Author: Homer Hsing homer.hsing@gmail.com Rev. 0.1 March 4, 2012 This page has been intentionally left blank. www.opencores.org Rev 0.1 ii Revision History Rev.
More informationCOMBINATIONAL LOGIC FUNCTIONS
COMBINATIONAL LOGIC FUNCTIONS Digital logic circuits can be classified as either combinational or sequential circuits. A combinational circuit is one where the output at any time depends only on the present
More informationLecture 3 Review on Digital Logic (Part 2)
Lecture 3 Review on Digital Logic (Part 2) Xuan Silvia Zhang Washington University in St. Louis http://classes.engineering.wustl.edu/ese461/ ircuit Optimization Simplest implementation ost criterion literal
More informationEECS150  Digital Design Lecture 15 SIFT2 + FSM. Recap and Outline
EECS150  Digital Design Lecture 15 SIFT2 + FSM Oct. 15, 2013 Prof. Ronald Fearing Electrical Engineering and Computer Sciences University of California, Berkeley (slides courtesy of Prof. John Wawrzynek)
More informationENGG 1203 Tutorial_9  Review. Boolean Algebra. Simplifying Logic Circuits. Combinational Logic. 1. Combinational & Sequential Logic
ENGG 1203 Tutorial_9  Review Boolean Algebra 1. Combinational & Sequential Logic 2. Computer Systems 3. Electronic Circuits 4. Signals, Systems, and Control Remark : Multiple Choice Questions : ** Check
More informationVLSI Signal Processing
VLSI Signal Processing Lecture 1 Pipelining & Retiming ADSP Lecture1  Pipelining & Retiming (cwliu@twins.ee.nctu.edu.tw) 11 Introduction DSP System Real time requirement Data driven synchronized by data
More information5. Sequential Logic x Computation Structures Part 1 Digital Circuits. Copyright 2015 MIT EECS
5. Sequential Logic 6.004x Computation Structures Part 1 igital Circuits Copyright 2015 MIT EECS 6.004 Computation Structures L5: Sequential Logic, Slide #1 Something We Can t Build (Yet) What if you were
More informationLaboratory Exercise #8 Introduction to Sequential Logic
Laboratory Exercise #8 Introduction to Sequential Logic ECEN 248: Introduction to Digital Design Department of Electrical and Computer Engineering Texas A&M University 2 Laboratory Exercise #8 1 Introduction
More informationCMPE12  Notes chapter 1. Digital Logic. (Textbook Chapter 3)
CMPE12  Notes chapter 1 Digital Logic (Textbook Chapter 3) Transistor: Building Block of Computers Microprocessors contain TONS of transistors Intel Montecito (2005): 1.72 billion Intel Pentium 4 (2000):
More informationBoolean Algebra. Digital Logic Appendix A. Boolean Algebra Other operations. Boolean Algebra. Postulates, Identities in Boolean Algebra
Digital Logic Appendix A Gates Combinatorial Circuits Sequential Circuits George Boole ideas 1854 Claude Shannon, apply to circuit design, 1938 (piirisuunnittelu) Describe digital circuitry function programming
More informationARITHMETIC COMBINATIONAL MODULES AND NETWORKS
ARITHMETIC COMBINATIONAL MODULES AND NETWORKS 1 SPECIFICATION OF ADDER MODULES FOR POSITIVE INTEGERS HALFADDER AND FULLADDER MODULES CARRYRIPPLE AND CARRYLOOKAHEAD ADDER MODULES NETWORKS OF ADDER MODULES
More informationCMPEN 411 VLSI Digital Circuits Spring 2012 Lecture 17: Dynamic Sequential Circuits And Timing Issues
CMPEN 411 VLSI Digital Circuits Spring 2012 Lecture 17: Dynamic Sequential Circuits And Timing Issues [Adapted from Rabaey s Digital Integrated Circuits, Second Edition, 2003 J. Rabaey, A. Chandrakasan,
More informationBoolean Algebra and Digital Logic 2009, University of Colombo School of Computing
IT 204 Section 3.0 Boolean Algebra and Digital Logic Boolean Algebra 2 Logic Equations to Truth Tables X = A. B + A. B + AB A B X 0 0 0 0 3 Sum of Products The OR operation performed on the products of
More informationVectorized 128bit Input FP16/FP32/ FP64 FloatingPoint Multiplier
Vectorized 128bit Input FP16/FP32/ FP64 FloatingPoint Multiplier Espen Stenersen Master of Science in Electronics Submission date: June 2008 Supervisor: Per Gunnar Kjeldsberg, IET Cosupervisor: Torstein
More informationUNIVERSITY OF WISCONSIN MADISON
CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING UNIVERSITY OF WISCONSIN MADISON Prof. Gurindar Sohi TAs: Minsub Shin, Lisa Ossian, Sujith Surendran Midterm Examination 2 In Class (50 minutes) Friday,
More informationCSE 140 Spring 2017: Final Solutions (Total 50 Points)
CSE 140 Spring 2017: Final Solutions (Total 50 Points) 1. (Boolean Algebra) Prove the following Boolean theorem using Boolean laws only, i.e. no theorem is allowed for the proof. State the name of the
More informationDecoding A Counter. svbitec.wordpress.com 1
ecoding A ounter ecoding a counter involves determining which state in the sequence the counter is in. ifferentiate between activehigh and activelow decoding. ActiveHIGH decoding: output HIGH if the
More informationClocked Synchronous Statemachine Analysis
Clocked Synchronous Statemachine Analysis Given the circuit diagram of a state machine: Analyze the combinational logic to determine flipflop input (excitation) equations: D i = F i (Q, inputs) The input
More informationSTRUCTURAL test offers several advantages over functional
Functional TestSequence Grading at RegisterTransfer Level Hongxia Fang, Krishnendu Chakrabarty, Abhijit Jas, Srinivas Patil, and Chandra Tirumurti Abstract Functional test sequences are often used in
More information9. Datapath Design. Jacob Abraham. Department of Electrical and Computer Engineering The University of Texas at Austin VLSI Design Fall 2017
9. Datapath Design Jacob Abraham Department of Electrical and Computer Engineering The University of Texas at Austin VLSI Design Fall 2017 October 2, 2017 ECE Department, University of Texas at Austin
More informationTiming Analysis with Clock Skew
, Mark Horowitz 1, & Dean Liu 1 David_Harris@hmc.edu, {horowitz, dliu}@vlsi.stanford.edu March, 1999 Harvey Mudd College Claremont, CA 1 (with Stanford University, Stanford, CA) Outline Introduction Timing
More informationDIGITAL TECHNICS. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute
DIGITAL TECHNICS Dr. Bálint Pődör Óbuda University, Microelectronics and Technology Institute 4. LECTURE: COMBINATIONAL LOGIC DESIGN: ARITHMETICS (THROUGH EXAMPLES) 2016/2017 COMBINATIONAL LOGIC DESIGN:
More informationDigital electronics form a class of circuitry where the ability of the electronics to process data is the primary focus.
Chapter 2 Digital Electronics Objectives 1. Understand the operation of basic digital electronic devices. 2. Understand how to describe circuits which can process digital data. 3. Understand how to design
More informationECE 448 Lecture 6. Finite State Machines. State Diagrams, State Tables, Algorithmic State Machine (ASM) Charts, and VHDL Code. George Mason University
ECE 448 Lecture 6 Finite State Machines State Diagrams, State Tables, Algorithmic State Machine (ASM) Charts, and VHDL Code George Mason University Required reading P. Chu, FPGA Prototyping by VHDL Examples
More informationIntroduction to Computer Engineering. CS/ECE 252, Fall 2012 Prof. Guri Sohi Computer Sciences Department University of Wisconsin Madison
Introduction to Computer Engineering CS/ECE 252, Fall 2012 Prof. Guri Sohi Computer Sciences Department University of Wisconsin Madison Chapter 3 Digital Logic Structures Slides based on set prepared by
More informationDigital Electronics Circuits 2017
JSS SCIENCE AND TECHNOLOGY UNIVERSITY Digital Electronics Circuits (EC37L) Lab incharge: Dr. Shankraiah Course outcomes: After the completion of laboratory the student will be able to, 1. Simplify, design
More informationReview: Designing with FSM. EECS Components and Design Techniques for Digital Systems. Lec09 Counters Outline.
Review: Designing with FSM EECS 150  Components and Design Techniques for Digital Systems Lec09 Counters 92804 David Culler Electrical Engineering and Computer Sciences University of California, Berkeley
More informationDO NOT COPY DO NOT COPY
Drill Problems 3 benches. Another practical book is VHDL for Programmable Logic, by Kevin Skahill of Cypress Semiconductor (Addisonesley, 1996). All of the ABEL and VHDL examples in this chapter and throughout
More informationCOVER SHEET: Problem#: Points
EEL 4712 Midterm 3 Spring 2017 VERSION 1 Name: UFID: Sign here to give permission for your test to be returned in class, where others might see your score: IMPORTANT: Please be neat and write (or draw)
More informationWORKBOOK. Try Yourself Questions. Electrical Engineering Digital Electronics. Detailed Explanations of
27 WORKBOOK Detailed Eplanations of Try Yourself Questions Electrical Engineering Digital Electronics Number Systems and Codes T : Solution Converting into decimal number system 2 + 3 + 5 + 8 2 + 4 8 +
More informationReg. No. Question Paper Code : B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER Second Semester. Computer Science and Engineering
Sp 6 Reg. No. Question Paper Code : 27156 B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2015. Second Semester Computer Science and Engineering CS 6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN (Common
More informationCombinational vs. Sequential. Summary of Combinational Logic. Combinational device/circuit: any circuit built using the basic gates Expressed as
Summary of Combinational Logic : Computer Architecture I Instructor: Prof. Bhagi Narahari Dept. of Computer Science Course URL: www.seas.gwu.edu/~bhagiweb/cs3/ Combinational device/circuit: any circuit
More informationDesign of Sequential Circuits
Design of Sequential Circuits Seven Steps: Construct a state diagram (showing contents of flip flop and inputs with next state) Assign letter variables to each flip flop and each input and output variable
More informationFrom Sequential Circuits to Real Computers
1 / 36 From Sequential Circuits to Real Computers Lecturer: Guillaume Beslon Original Author: Lionel Morel Computer Science and Information Technologies  INSA Lyon Fall 2017 2 / 36 Introduction What we
More informationSimulation of Logic Primitives and Dynamic Dlatch with VerilogXL
Simulation of Logic Primitives and Dynamic Dlatch with VerilogXL November 30, 2011 Robert D Angelo Tufts University Electrical and Computer Engineering EE103 Lab 3: Part I&II Professor: Dr. Valencia
More informationEECS 427 Lecture 15: Timing, Latches, and Registers Reading: Chapter 7. EECS 427 F09 Lecture Reminders
EECS 427 Lecture 15: Timing, Latches, and Registers Reading: Chapter 7 1 Reminders CA assignments CA7 is due Thursday at noon ECE Graduate Symposium Poster session in ECE Atrium on Friday HW4 (detailed
More informationThe Test Vector Problem and Limitations to Evolving Digital Circuits
The Test Vector Problem and Limitations to Evolving Digital Circuits Kosuke Imamura James A. Foster Axel W. Krings Computer Science Department University of Idaho Moscow, ID 838441010 {kosuke,foster,krings}@cs.uidaho.edu
More informationVery Large Scale Integration (VLSI)
Very Large Scale Integration (VLSI) Lecture 4 Dr. Ahmed H. Madian Ah_madian@hotmail.com Dr. Ahmed H. MadianVLSI Contents Delay estimation Simple RC model PenfieldRubenstein Model Logical effort Delay
More informationGMU, ECE 680 Physical VLSI Design
ECE680: Physical VLSI esign Chapter IV esigning Sequential Logic Circuits (Chapter 7) 1 Sequential Logic Inputs Current State COMBINATIONAL LOGIC Registers Outputs Next state 2 storage mechanisms positive
More informationCpE358/CS381. Switching Theory and Logical Design. Summer
Switching Theory and Logical Design  Class Schedule Monday Tuesday Wednesday Thursday Friday May 7 8 9  Class 2  Class 2 2 24  Class 3 25 26  Class 4 27 28 Quiz Commencement 3 June 2  Class 5 3 
More information9/18/2008 GMU, ECE 680 Physical VLSI Design
ECE680: Physical VLSI esign Chapter IV esigning Sequential Logic Circuits (Chapter 7) 1 Sequential Logic Inputs Current State COMBINATIONAL LOGIC Registers Outputs Next state 2 storage mechanisms positive
More informationOHW2013 workshop. An open source PCIe device virtualization framework
OHW2013 workshop An open source PCIe device virtualization framework Plan Context and objectives Design and implementation Future directions Questions Context  ESRF and the ISDD electronic laboratory
More information