|
|
- Jody Hubbard
- 5 years ago
- Views:
Transcription
1 Roland Dobai Elena Institute of Informatics, Slovak Academy of Sciences, Slovakia Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, November 13 15, 2009, Znojmo, Czechia
2 Outline
3 circuits circuits are fundamentally different from their synchronous counterparts. They do not use clock signal for synchronization.
4 circuits circuits are fundamentally different from their synchronous counterparts. They do not use clock signal for synchronization. This difference allows us to achieve: lower power consumption, higher operating speed, less electro-magnetic noise emission, better modularity, better robustness. Sparsø et al.: Principles of asynchronous circuit design: A systems perspective [1]
5 C-elements C-elements are used in the asynchronous circuits as basic construction elements. A B C Y A B Y previous value 1 0 previous value C-element symbol and truth table
6 Classes of the asynchronous circuits circuits can be classified at the gate level as self-timed, speed-independent, delay-insensitive, quasi-delay-insensitive.
7 Classes of the asynchronous circuits circuits can be classified at the gate level as self-timed, speed-independent, delay-insensitive, quasi-delay-insensitive. In this work only the speed-independent circuits are considered. Other classes of asynchronous circuits can be represented under this model Shi et al.: Test Generation for Ultra-High-Speed Pipelines [2].
8 About this work Developed and implemented a deductive simulator for stuck-at s of speed-independent circuits.
9 About this work Developed and implemented a deductive simulator for stuck-at s of speed-independent circuits. Implemented serial simulator. Based on Shi et al.: SPIN-SIM: Logic and Speed-Independent [3]. Reason of the implementation: to compare the results with the deductive simulator in the same environment.
10 About this work Developed and implemented a deductive simulator for stuck-at s of speed-independent circuits. Implemented serial simulator. Based on Shi et al.: SPIN-SIM: Logic and Speed-Independent [3]. Reason of the implementation: to compare the results with the deductive simulator in the same environment. Random test pattern generator was implemented based on Shi et al.: Simulation and Random Test Generation for Speed-Independent [4].
11 of the asynchronous circuits is more difficult.
12 of the asynchronous circuits is more difficult. It needs to deal with hazards (unwanted glitches on signals), oscillations (feedback signals never stabilize), races (two or more feedback signals are changing simultaneously). Shi et al.: SPIN-SIM: Logic and Speed-Independent [3]
13 simulators SPIN-SIM Shi et al.: SPIN-SIM: Logic and Speed-Independent [3] simulator for the speed-independent circuits. Uses the 13-valued logic and the time stamps for hazard detection. Time stamps determination of difference between signal transitions and hazards. Transforms circuits into combinational representation: replaces C-elements with a set of simple gates, cuts each feedback path into pseudo-primary inputs and outputs.
14 simulators SPIN-SIM Shi et al.: SPIN-SIM: Logic and Speed-Independent [3] simulator for the speed-independent circuits. Uses the 13-valued logic and the time stamps for hazard detection. Time stamps determination of difference between signal transitions and hazards. Transforms circuits into combinational representation: replaces C-elements with a set of simple gates, cuts each feedback path into pseudo-primary inputs and outputs. Fsimac Sur-Kolay et al.: Fsimac: A simulator for asynchronous sequential circuits [5] Uses the 13-valued logic. Can not be used for the speed-independent circuits.
15 simulator was implemented based on Shi et al.: SPIN-SIM: Logic and Speed-Independent [3]. Simulation of the y circuit with inserted s one-by-one for the current test pattern.
16 simulator was implemented based on Shi et al.: SPIN-SIM: Logic and Speed-Independent [3]. Simulation of the y circuit with inserted s one-by-one for the current test pattern.
17 is not a new technique. Creation of detectable s lists and their propagation to outputs for the current test pattern in a single overpass.
18 is not a new technique. Creation of detectable s lists and their propagation to outputs for the current test pattern in a single overpass. It was used mainly for combinational circuits. A method for synchronous sequential circuits was also proposed Walczak: Module [6]. The list for the sequential blocks modelled by Moore-type automaton is propagated using the automaton states.
19 Our achievements Application for the asynchronous circuits. list propagation algorithm for the complex gates. Hazard detection during deductive.
20 The developed deductive simulator can propagate the lists in the speed-independent circuits with complex gates. The propagation algorithm is universal and can be used for any gate which is represented by a Boolean function expressed by the Disjunctive Normal Form. The proposed algorithm is presented in the paper. Main principles. Example.
21 Main principles Analyzing the Boolean function. lists from inputs of the gate are placed in 4 temporary lists. The output list is generated based on the temporary lists.
22 Main principles The meaning of the variables used in the algorithm is as follows: andintersectionlist the list of s for the examined conjunction which contains the s of inputs with a logic 0 which is the controlling value for the logic operation AND; orintersectionlist the list of s for the whole disjunction which contains the s of conjunctions with a logic 1 which is the controlling value for the logic operation OR;
23 Main principles andunionlist the list of s for the examined conjunction which contains the s of inputs with a logic 1 which is the non-controlling value for the logic operation AND; orunionlist the list of s for the whole disjunction which contains the s of conjunctions with a logic 0 which is the non-controlling value for the logic operation OR;
24 Example Consider the complex gate with the function Y = A.B + A.B.C, where A, B, C are the inputs and Y is the output of the gate. A = B = C = 1, L A ={A_sa0, G_sa0, H_sa1}, L B ={B_sa0, G_sa0, H_sa1}, L C ={C_sa0, H_sa1, L_sa1} Y = A.B + A.B.C 1 Y = A.B + A.B.C A = 1 andunionlist ={A_sa0, G_sa0, H_sa1} 2 Y = A.B + A.B.C B = 1 andunionlist ={A_sa0, G_sa0, H_sa1, B_sa0} 3 andcontrollingsetisempty = true and A.B = 1 orintersectionlist ={A_sa0, G_sa0, H_sa1, B_sa0} (G, H, L are lines in the circuit which are situated before the examined complex gate.)
25 Example Y = A.B + A.B.C 1 Y = A.B + A.B.C A = 0 andintersectionlist ={A_sa0, G_sa0, H_sa1} 2 Y = A.B + A.B.C B = 0 andintersectionlist ={G_sa0, H_sa1} 3 Y = A.B + A.B.C C = 1 andunionlist ={C_sa0, H_sa1, L_sa1} 4 andcontrollingsetisempty = false and A.B.C = 0 orunionlist ={G_sa0} orcontrollingsetisempty = false ListOf (Y ) ={A_sa0, H_sa1, B_sa0}
26 Example Y = A.B + A.B.C 1 Y = A.B + A.B.C A = 0 andintersectionlist ={A_sa0, G_sa0, H_sa1} 2 Y = A.B + A.B.C B = 0 andintersectionlist ={G_sa0, H_sa1} 3 Y = A.B + A.B.C C = 1 andunionlist ={C_sa0, H_sa1, L_sa1} 4 andcontrollingsetisempty = false and A.B.C = 0 orunionlist ={G_sa0} orcontrollingsetisempty = false ListOf (Y ) ={A_sa0, H_sa1, B_sa0} This example is very simple and not demonstrating all capabilities of the proposed algorithm.
27 Implementation in C++. Evaluation has been done over a set of speed-independent benchmark circuits synthetized by Petrify Cortadella et al.: Petrify: a tool for manipulating concurrent specifications and synthesis of asynchronous controllers [7].
28 coverage comparison Circuit name Number Average stuck-at coverage of s [4] [3] serial deductive alloc_outbound 58 92% 100.0% % % chu % 96.9% 98.33% 98.33% chu % 97.1% 95.00% 95.00% converta 56 46% 91.9% 96.43% 96.43% dff 34 79% 85.7% % % ebergen 46 N/A 95.7% % % half 34 N/A 100.0% 94.12% 94.12% hazard 40 86% 97.0% % % master_read % 97.7% 95.45% 95.45% mp_forward_pkt 66 95% 100.0% % % nak_pa 76 91% 100.0% % % nowick 50 98% 100.0% % % ram_read_sbuf 84 89% 100.0% % % rcv_setup 36 93% 100.0% % % rpdft 26 92% 100.0% % % sbuf_ram_write 82 78% 100.0% % % sbuf_send_ctl 66 49% 94.9% 98.48% 98.48%
29 Time and memory comparison Circuit name Time [s] Time Memory [kb] Mem. ser. ded. decr. ser. ded. incr. alloc_outbound % % chu % % chu % % converta % % dff % % ebergen % % half % % hazard % % master_read % % mp_forward_pkt % % nak_pa % % nowick % % ram_read_sbuf % % rcv_setup % % rpdft % % sbuf_ram_write % % sbuf_send_ctl % %
30 In most of the cases the deductive simulator is by 60% 80% faster than the serial one. For 3 circuits the deductive simulator was slower than the serial one. The dropping technique was implemented in the serial simulator. This problem will be eliminated by implementing a deterministic test pattern generator. For 2 circuits lower memory requirements are reported for the deductive simulator than for the serial one. Could be caused by low execution time. Could be caused by the relatively small size of the circuits.
31 Improvements of the deductive technique Application for the asynchronous circuits. list propagation algorithm for the complex gates. Hazard detection during deductive.
32 simulator was developed and implemented for the stuck-at of the speed-independent asynchronous circuits. The experimental results show 60% 80% reduction of the computational time and max. 14% increase of the memory requirements. Future work Deterministic test pattern generator based on the algorithm FAN. Without using external tools reduction of the test generation time. Test pattern generator for delay s.
33 References I J. Sparsø and S. Furber, Principles of asynchronous circuit design: A systems perspective, ch Kluwer Academic Publishers, F. Shi, Y. Makris, S. M. Nowick, and M. Singh, Test generation for ultra-high-speed asynchronous pipelines, in Proceedings of the IEEE International Conference on Test, p. 1018, F. Shi and Y. Makris, SPIN-SIM: Logic and for speed-independent circuits, in Proceedings of the 2004 International Test Conference, pp , 2004.
34 References II F. Shi and Y. Makris, and random test generation for speed-independent circuits, in Proceedings of the 2004 Great Lakes Symposium on VLSI, pp , S. Sur-Kolay, M. Roncken, K. Stevens, P. Chaudhuri, and R. Roy, Fsimac: A simulator for asynchronous sequential circuits, in Proceedings of the 9 th Asian Test Symposium, pp , K. Walczak, for sequential module circuits, IEEE Transactions on Computers, vol. 37, no. 2, pp , 1988.
35 References III J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, and A. Yakovlev, Petrify: a tool for manipulating concurrent specifications and synthesis of asynchronous controllers, IEICE Transactions on Information and Systems, vol. E80-D, no. 3, pp , F. Shi and Y. Makris, SPIN-TEST: Automatic test pattern generation for speed-independent circuits, in Proceedings of the 2004 International Conference on Computer Aided Design, pp , H. K. Lee and D. S. Ha, On the generation of test patterns for combinational circuits, Tech. Rep. 12_93, Dep t of Electrical Eng., Virginia Polytechnic Institute, 1993.
36 Thank you for attention
37 propagation rules for single gates The deductive simulator is based on the following propagation rules for the logic gates OR and AND, where I 1 is the set of logic gate inputs with logic one, I 0 is the set of logic gate inputs with logic zero and L j is the list for input j. list propagation through gate AND: if I 0 = then{ L j } j I 1 else{ L j } { L j } j I 0 j I 1 list propagation through gate OR: if I 1 = then{ L j } j I 0 else{ j I 1 L j } { j I 0 L j }
38 Boolean function for the D flip-flop substitute Q clk d
39 Test pattern generator SPIN-TEST Shi et al.: SPIN-TEST: Automatic Test Pattern Generation for Speed-Independent [8] Cooperates with SPIN-SIM. Uses ATALANTA Lee et al.: On the Generation of Test Patterns for Combinational [9]. Automatic test pattern generator for stuck-at of combinational circuits. Generate test sequence for the asynchronous circuit. Uses the test patterns for the combinational representation.
40 Test pattern generation Random test pattern generator was implemented based on Shi et al.: Simulation and Random Test Generation for Speed-Independent [4]. It has the following properties: To avoid long meaningless test sequences the circuit is reseted to its initial state in the presence of hazards. s can be detected on the hazard-free outputs even in the presence of hazards, so it is not always necessary to reset the hazardous circuit. Circuit is reseted with a computed probability based on the number of hazards.
41 Test pattern generation Our proposal for improving the performance Simple equation for the probability computation. Our equation: P = n h 100%, (1) n where n is the total number of outputs and n h is the number of outputs with a hazard. Hazard-free circuit: P = 0%. Hazard on all of the outputs: P = 100%. Linear dependency. Simplification without decreasing of the coverage.
42 Handling of D-flip-flops Pseudo-gate implementation was proposed previously only for C-elements. circuits can contain other memory elements too, for example D-flip-flops. We propose the set of gates for replacing D-flip-flops in the circuits.
43 Handling of D-flip-flops Pseudo-gate implementation of the D flip-flop The role of the pseudo-gate p-and-3 is to eliminate the hazard which could occur on the output Q when d = 1, Q = 1 and a signal transition 0 1 or 1 0 occurs on clk.
44 injection The circuit contain complex gates which are represented using the Disjunctive Normal Form. injection is handled by inserting gates to circuit with the following Boolean functions: for stuck-at-one: O = I + I, (2) for stuck-at-zero: O = I I, (3) where I is the gate input and O is the gate output.
45 injection The circuit contain complex gates which are represented using the Disjunctive Normal Form. injection is handled by inserting gates to circuit with the following Boolean functions: for stuck-at-one: O = I + I, (2) for stuck-at-zero: O = I I, (3) where I is the gate input and O is the gate output. Advantage The of -free and y circuit can be done in the same way.
Synchronous Sequential Circuit Design. Digital Computer Design
Synchronous Sequential Circuit Design Digital Computer Design Races and Instability Combinational logic has no cyclic paths and no races If inputs are applied to combinational logic, the outputs will always
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 informationELEC Digital Logic Circuits Fall 2014 Sequential Circuits (Chapter 6) Finite State Machines (Ch. 7-10)
ELEC 2200-002 Digital Logic Circuits Fall 2014 Sequential Circuits (Chapter 6) Finite State Machines (Ch. 7-10) Vishwani D. Agrawal James J. Danaher Professor Department of Electrical and Computer Engineering
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) Fan-in iii) Fan-out b) Convert the following:
More informationSynchronous Sequential Circuit
Synchronous Sequential Circuit The change of internal state occurs in response to the synchronized clock pulses. Data are read during the clock pulse (e.g. rising-edge triggered) It is supposed to wait
More informationEE40 Lec 15. Logic Synthesis and Sequential Logic Circuits
EE40 Lec 15 Logic Synthesis and Sequential Logic Circuits Prof. Nathan Cheung 10/20/2009 Reading: Hambley Chapters 7.4-7.6 Karnaugh Maps: Read following before reading textbook http://www.facstaff.bucknell.edu/mastascu/elessonshtml/logic/logic3.html
More informationSynchronous Sequential Logic
1 IT 201 DIGITAL SYSTEMS DESIGN MODULE4 NOTES Synchronous Sequential Logic Sequential Circuits - A sequential circuit consists of a combinational circuit and a feedback through the storage elements in
More informationPartial Scan Delay Fault Testing of Asynchronous Circuits
Partial Scan Delay Fault Testing of Asynchronous Circuits Michael Kishinevsky The University of Aizu Aizu-Wakamatsu, 9-8 Japan Aleander Saldanha Cadence Berkeley Laboratories Berkeley - CA 97 Ale Kondratyev
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 6 Following the slides of Dr. Ahmed H. Madian محرم 1439 ه Winter
More informationSequential Synchronous Circuit Analysis
Sequential Synchronous Circuit Analysis General Model Current State at time (t) is stored in an array of flip-flops. Next State at time (t+1) is a Boolean function of State and Inputs. Outputs at time
More information10/12/2016. An FSM with No Inputs Moves from State to State. ECE 120: Introduction to Computing. Eventually, the States Form a Loop
University of Illinois at Urbana-Champaign Dept. of Electrical and Computer Engineering An FSM with No Inputs Moves from State to State What happens if an FSM has no inputs? ECE 120: Introduction to Computing
More informationCPE/EE 422/522. Chapter 1 - Review of Logic Design Fundamentals. Dr. Rhonda Kay Gaede UAH. 1.1 Combinational Logic
CPE/EE 422/522 Chapter - Review of Logic Design Fundamentals Dr. Rhonda Kay Gaede UAH UAH Chapter CPE/EE 422/522. Combinational Logic Combinational Logic has no control inputs. When the inputs to a combinational
More informationvidyarthiplus.com vidyarthiplus.com vidyarthiplus.com ANNA UNIVERSITY- COMBATORE B.E./ B.TECH. DEGREE EXAMINATION - JUNE 2009. ELECTRICAL & ELECTONICS ENGG. - FOURTH SEMESTER DIGITAL LOGIC CIRCUITS PART-A
More informationEECS Components and Design Techniques for Digital Systems. FSMs 9/11/2007
EECS 150 - Components and Design Techniques for Digital Systems FSMs 9/11/2007 Sarah Bird Electrical Engineering and Computer Sciences University of California, Berkeley Slides borrowed from David Culler
More informationAutomatic Generation of Synchronous Test Patterns for Asynchronous Circuits
Automatic Generation of Synchronous Test Patterns for Asynchronous Circuits Oriol Roig Jordi Cortadella Marco A. Peña Enric Pastor Department of Computer Architecture, Universitat Politècnica de Catalunya.
More informationClocked Synchronous State-machine Analysis
Clocked Synchronous State-machine Analysis Given the circuit diagram of a state machine: Analyze the combinational logic to determine flip-flop input (excitation) equations: D i = F i (Q, inputs) The input
More informationChapter 7 Sequential Logic
Chapter 7 Sequential Logic SKEE2263 Digital Systems Mun im/ismahani/izam {munim@utm.my,e-izam@utm.my,ismahani@fke.utm.my} March 28, 2016 Table of Contents 1 Intro 2 Bistable Circuits 3 FF Characteristics
More informationDigital Logic Appendix A
Digital Logic Appendix A Boolean Algebra Gates Combinatorial Circuits Sequential Circuits 1 Boolean Algebra George Boole ideas 1854 Claude Shannon, apply to circuit design, 1938 Describe digital circuitry
More informationAppendix B. Review of Digital Logic. Baback Izadi Division of Engineering Programs
Appendix B Review of Digital Logic Baback Izadi Division of Engineering Programs bai@engr.newpaltz.edu Elect. & Comp. Eng. 2 DeMorgan Symbols NAND (A.B) = A +B NOR (A+B) = A.B AND A.B = A.B = (A +B ) OR
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 informationChapter 4. Sequential Logic Circuits
Chapter 4 Sequential Logic Circuits 1 2 Chapter 4 4 1 The defining characteristic of a combinational circuit is that its output depends only on the current inputs applied to the circuit. The output of
More informationVidyalankar S.E. Sem. III [ETRX] Digital Circuits and Design Prelim Question Paper Solution
S.E. Sem. III [ETRX] Digital Circuits and Design Prelim uestion Paper Solution. (a) Static Hazard Static hazards have two cases: static and static. static- hazard exists when the output variable should
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 informationMAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified) State any two Boolean laws. (Any 2 laws 1 mark each)
Subject Code: 17333 Model Answer Page 1/ 27 Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given in the model answer scheme. 2) The model
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 informationS.Y. Diploma : Sem. III [CO/CM/IF/CD/CW] Digital Techniques
S.Y. Diploma : Sem. III [CO/CM/IF/CD/CW] Digital Techniques Time: 3 Hrs.] Prelim Question Paper Solution [Marks : 100 Q.1(a) Attempt any SIX of the following : [12] Q.1(a) (i) Derive AND gate and OR gate
More informationEECS150 - Digital Design Lecture 23 - FSMs & Counters
EECS150 - Digital Design Lecture 23 - FSMs & Counters April 8, 2010 John Wawrzynek Spring 2010 EECS150 - Lec22-counters Page 1 One-hot encoding of states. One FF per state. State Encoding Why one-hot encoding?
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 informationPhiladelphia University Student Name: Student Number:
Philadelphia University Student Name: Student Number: Faculty of Engineering Serial Number: Final Exam, First Semester: 2017/2018 Dept. of Computer Engineering Course Title: Logic Circuits Date: 29/01/2018
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 informationTestability. 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 informationTopic 8: Sequential Circuits
Topic 8: Sequential Circuits Readings : Patterson & Hennesy, Appendix B.4 - B.6 Goals Basic Principles behind Memory Elements Clocks Applications of sequential circuits Introduction to the concept of the
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 informationZ = F(X) Combinational circuit. A combinational circuit can be specified either by a truth table. Truth Table
Lesson Objectives In this lesson, you will learn about What are combinational circuits Design procedure of combinational circuits Examples of combinational circuit design Combinational Circuits Logic circuit
More informationECE/Comp Sci 352 Digital Systems Fundamentals. Charles R. Kime Section 2 Fall Logic and Computer Design Fundamentals
University of Wisconsin - Madison ECE/Comp Sci 352 Digital Systems Fundamentals Charles R. Kime Section 2 Fall 2001 Lecture 5 Registers & Counters Part 2 Charles Kime Counters Counters are sequential circuits
More informationKing Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department
King Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department Page 1 of 13 COE 202: Digital Logic Design (3-0-3) Term 112 (Spring 2012) Final
More informationDigital Electronics. Part A
Digital Electronics Final Examination Part A Winter 2004-05 Student Name: Date: lass Period: Total Points: Multiple hoice Directions: Select the letter of the response which best completes the item or
More information( c) Give logic symbol, Truth table and circuit diagram for a clocked SR flip-flop. A combinational circuit is defined by the function
Question Paper Digital Electronics (EE-204-F) MDU Examination May 2015 1. (a) represent (32)10 in (i) BCD 8421 code (ii) Excess-3 code (iii) ASCII code (b) Design half adder using only NAND gates. ( c)
More informationSequential Logic Circuits
Chapter 4 Sequential Logic Circuits 4 1 The defining characteristic of a combinational circuit is that its output depends only on the current inputs applied to the circuit. The output of a sequential circuit,
More informationChapter 9 Asynchronous Sequential Logic
9.1 Introduction EEA051 - Digital Logic 數位邏輯 Chapter 9 Asynchronous Sequential Logic 吳俊興高雄大學資訊工程學系 December 2004 Two major types of sequential circuits: depending on timing of their signals Asynchronous
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 informationTest Pattern Generator for Built-in Self-Test using Spectral Methods
Test Pattern Generator for Built-in Self-Test using Spectral Methods Alok S. Doshi and Anand S. Mudlapur Auburn University 2 Dept. of Electrical and Computer Engineering, Auburn, AL, USA doshias,anand@auburn.edu
More informationChapter 13. Clocked Circuits SEQUENTIAL VS. COMBINATIONAL CMOS TG LATCHES, FLIP FLOPS. Baker Ch. 13 Clocked Circuits. Introduction to VLSI
Chapter 13 Clocked Circuits SEQUENTIAL VS. COMBINATIONAL CMOS TG LATCHES, FLIP FLOPS SET-RESET (SR) ARBITER LATCHES FLIP FLOPS EDGE TRIGGERED DFF FF TIMING Joseph A. Elias, Ph.D. Adjunct Professor, University
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 informationDesign of Control Modules for Use in a Globally Asynchronous, Locally Synchronous Design Methodology
Design of Control Modules for Use in a Globally Asynchronous, Locally Synchronous Design Methodology Pradnya Deokar Department of Electrical and Computer Engineering, VLSI Design Research Laboratory, Southern
More informationLecture 7: Logic design. Combinational logic circuits
/24/28 Lecture 7: Logic design Binary digital circuits: Two voltage levels: and (ground and supply voltage) Built from transistors used as on/off switches Analog circuits not very suitable for generic
More informationMealy & Moore Machines
Mealy & Moore Machines Moore Machine is a finite-state machine whose output values are determined solely by its current state and can be defined as six elements (S, S 0, Σ, Λ, T, G), consisting of the
More informationMODULE 5 Chapter 7. Clocked Storage Elements
MODULE 5 Chapter 7 Clocked Storage Elements 3/9/2015 1 Outline Background Clocked Storage Elements Timing, terminology, classification Static CSEs Latches Registers Dynamic CSEs Latches Registers 3/9/2015
More informationDesigning Sequential Logic Circuits
igital Integrated Circuits (83-313) Lecture 5: esigning Sequential Logic Circuits Semester B, 2016-17 Lecturer: r. Adam Teman TAs: Itamar Levi, Robert Giterman 26 April 2017 isclaimer: This course was
More informationPhiladelphia University Student Name: Student Number:
Philadelphia University Student Name: Student Number: Faculty of Engineering Serial Number: Final Exam, Second Semester: 2015/2016 Dept. of Computer Engineering Course Title: Logic Circuits Date: 08/06/2016
More informationECE 407 Computer Aided Design for Electronic Systems. Simulation. Instructor: Maria K. Michael. Overview
407 Computer Aided Design for Electronic Systems Simulation Instructor: Maria K. Michael Overview What is simulation? Design verification Modeling Levels Modeling circuits for simulation True-value simulation
More informationControl Network Generator For Latency Insensitive Designs
Control Network Generator For Latency Insensitive Designs Eliyah Kilada, Kenneth S. Stevens University of Utah Eliyah.Kilada@utah.edu, kstevens@ece.utah.edu Abstract Creating latency insensitive or asynchronous
More informationECE 1767 University of Toronto
Applications Why Two Fault Simulators Never Agree General Techniques Parallel Pattern Simulation Inactive Fault Removal Critical Path Tracing Fault Sampling Statistical Fault Analysis ECE 767 Fault grading
More informationCPE100: Digital Logic Design I
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu CPE100: Digital Logic Design I Midterm02 Review http://www.ee.unlv.edu/~b1morris/cpe100/ 2 Logistics Thursday Nov. 16 th In normal lecture (13:00-14:15)
More informationGeneralized FSM model: Moore and Mealy
Lecture 18 Logistics HW7 is due on Monday (and topic included in midterm 2) Midterm 2 on Wednesday in lecture slot cover materials up to today s lecture Review session Tuesday 4:15pm in EEB125 Last lecture
More informationTemporal Formula Specifications of Asynchronous Control Module in Model Checking
Proceedings of the 6th WSEAS International Conference on Applied Computer Science, Tenerife, Canary Islands, Spain, December 16-18, 2006 214 Temporal Formula Specifications of Asynchronous Control Module
More informationLecture 9: Sequential Logic Circuits. Reading: CH 7
Lecture 9: Sequential Logic Circuits Reading: CH 7 Sequential Logic FSM (Finite-state machine) Inputs Current State COMBINATIONAL LOGIC Registers Outputs = f(current, inputs) Next state 2 storage mechanisms
More informationCh 7. Finite State Machines. VII - Finite State Machines Contemporary Logic Design 1
Ch 7. Finite State Machines VII - Finite State Machines Contemporary Logic esign 1 Finite State Machines Sequential circuits primitive sequential elements combinational logic Models for representing sequential
More informationEEE2135 Digital Logic Design
EEE2135 Digital Logic Design Chapter 7. Sequential Circuits Design 서강대학교 전자공학과 1. Model of Sequential Circuits 1) Sequential vs. Combinational Circuits a. Sequential circuits: Outputs depend on both the
More informationSynthesizing Asynchronous Burst-Mode Machines without the Fundamental-Mode Timing Assumption
Synthesizing synchronous urst-mode Machines without the Fundamental-Mode Timing ssumption Gennette Gill Montek Singh Univ. of North Carolina Chapel Hill, NC, US Contribution Synthesize robust asynchronous
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 = t2-t1 (2) Propagation
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 informationChapter 5. Digital Design and Computer Architecture, 2 nd Edition. David Money Harris and Sarah L. Harris. Chapter 5 <1>
Chapter 5 Digital Design and Computer Architecture, 2 nd Edition David Money Harris and Sarah L. Harris Chapter 5 Chapter 5 :: Topics Introduction Arithmetic Circuits umber Systems Sequential Building
More informationUniversity of Toronto Faculty of Applied Science and Engineering Edward S. Rogers Sr. Department of Electrical and Computer Engineering
University of Toronto Faculty of Applied Science and Engineering Edward S. Rogers Sr. Department of Electrical and Computer Engineering Final Examination ECE 241F - Digital Systems Examiners: J. Rose and
More informationSequential Circuit Analysis
Sequential Circuit Analysis Last time we started talking about latches and flip-flops, which are basic one-bit memory units. Today we ll talk about sequential circuit analysis and design. First, we ll
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 informationAsynchronous sequence circuits
Asynchronous sequence circuits An asynchronous sequence machine is a sequence circuit without flip-flops Asynchronous sequence machines are based on combinational gates with feedback Upon analysis it is
More informationEECS150 - Digital Design Lecture 11 - Shifters & Counters. Register Summary
EECS50 - Digital Design Lecture - Shifters & Counters February 24, 2003 John Wawrzynek Spring 2005 EECS50 - Lec-counters Page Register Summary All registers (this semester) based on Flip-flops: q 3 q 2
More informationDifferent encodings generate different circuits
FSM State Encoding Different encodings generate different circuits no easy way to find best encoding with fewest logic gates or shortest propagation delay. Binary encoding: K states need log 2 K bits i.e.,
More informationSynthesis for Testability Techniques for Asynchronous Circuits
Synthesis for Testability Techniques for Asynchronous Circuits Kurt Keutzer Synopsys Mountain View, CA Luciano Lavagno University of California Berkeley, CA Alberto Sangiovanni-Vincentelli University of
More informationEECS 579: Logic and Fault Simulation. Simulation
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
More informationProgrammable Logic Devices II
Lecture 04: Efficient Design of Sequential Circuits Prof. Arliones Hoeller arliones.hoeller@ifsc.edu.br Prof. Marcos Moecke moecke@ifsc.edu.br 1 / 94 Reference These slides are based on the material made
More informationChapter 5 Synchronous Sequential Logic
Chapter 5 Synchronous Sequential Logic Sequential circuit: A circuit that includes memory elements. In this case the output depends not only on the current input but also on the past inputs. Memory A synchronous
More informationLOGIC CIRCUITS. Basic Experiment and Design of Electronics. Ho Kyung Kim, Ph.D.
Basic Experiment and Design of Electronics LOGIC CIRCUITS Ho Kyung Kim, Ph.D. hokyung@pusan.ac.kr School of Mechanical Engineering Pusan National University Digital IC packages TTL (transistor-transistor
More informationDigital Logic and Design (Course Code: EE222) Lecture 19: Sequential Circuits Contd..
Indian Institute of Technology Jodhpur, Year 2017-2018 Digital Logic and Design (Course Code: EE222) Lecture 19: Sequential Circuits Contd.. Course Instructor: Shree Prakash Tiwari Email: sptiwari@iitj.ac.in
More informationUniversity of Minnesota Department of Electrical and Computer Engineering
University of Minnesota Department of Electrical and Computer Engineering EE2301 Fall 2008 Introduction to Digital System Design L. L. Kinney Final Eam (Closed Book) Solutions Please enter your name, ID
More informationLecture A: Logic Design and Gates
Lecture A: Logic Design and Gates Syllabus My office hours 9.15-10.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 informationIntegrated Circuits & Systems
Federal University of Santa Catarina Center for Technology Computer Science & Electronics Engineering Integrated Circuits & Systems INE 5442 Lecture 18 CMOS Sequential Circuits - 1 guntzel@inf.ufsc.br
More informationDesign of Datapath Controllers
Design of Datapath Controllers Speaker: 俞子豪 Adviser: Prof. An-Yeu Wu ACCESS IC LAB Outline vsequential Circuit Model vfinite State Machines vuseful Modeling Techniques P. 2 Model of Sequential Circuits
More informationGates and Flip-Flops
Gates and Flip-Flops Chris Kervick (11355511) With Evan Sheridan and Tom Power December 2012 On a scale of 1 to 10, how likely is it that this question is using binary?...4? What s a 4? Abstract The operation
More informationChapter 5 Synchronous Sequential Logic
Chapter 5 Synchronous Sequential Logic Sequential Circuits Latches and Flip Flops Analysis of Clocked Sequential Circuits HDL Optimization Design Procedure Sequential Circuits Various definitions Combinational
More informationLecture 27: Latches. Final presentations May 8, 1-5pm, BWRC Final reports due May 7 Final exam, Monday, May :30pm, 241 Cory
EE241 - Spring 2008 Advanced Digital Integrated Circuits Lecture 27: Latches Timing Announcements Wrapping-up the class: Final presentations May 8, 1-5pm, BWRC Final reports due May 7 Final exam, Monday,
More information3. Complete the following table of equivalent values. Use binary numbers with a sign bit and 7 bits for the value
EGC22 Digital Logic Fundamental Additional Practice Problems. Complete the following table of equivalent values. Binary. Octal 35.77 33.23.875 29.99 27 9 64 Hexadecimal B.3 D.FD B.4C 2. Calculate the following
More informationLOGIC CIRCUITS. Basic Experiment and Design of Electronics
Basic Experiment and Design of Electronics LOGIC CIRCUITS Ho Kyung Kim, Ph.D. hokyung@pusan.ac.kr School of Mechanical Engineering Pusan National University Outline Combinational logic circuits Output
More informationPreparation of Examination Questions and Exercises: Solutions
Questions Preparation of Examination Questions and Exercises: Solutions. -bit Subtraction: DIF = B - BI B BI BO DIF 2 DIF: B BI 4 6 BI 5 BO: BI BI 4 5 7 3 2 6 7 3 B B B B B DIF = B BI ; B = ( B) BI ( B),
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 informationLecture 9: Clocking, Clock Skew, Clock Jitter, Clock Distribution and some FM
Lecture 9: Clocking, Clock Skew, Clock Jitter, Clock Distribution and some FM Mark McDermott Electrical and Computer Engineering The University of Texas at Austin 9/27/18 VLSI-1 Class Notes Why Clocking?
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 informationCounters. We ll look at different kinds of counters and discuss how to build them
Counters We ll look at different kinds of counters and discuss how to build them These are not only examples of sequential analysis and design, but also real devices used in larger circuits 1 Introducing
More informationL4: Sequential Building Blocks (Flip-flops, Latches and Registers)
L4: Sequential Building Blocks (Flip-flops, Latches and Registers) Acknowledgements:., Materials in this lecture are courtesy of the following people and used with permission. - Randy H. Katz (University
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 Flip-Flop stores one bit of information
More informationEET 310 Flip-Flops 11/17/2011 1
EET 310 Flip-Flops 11/17/2011 1 FF s and some Definitions Clock Input: FF s are controlled by a trigger or Clock signal. All FF s have a clock input. If a device which attempts to do a FF s task does not
More informationProblem Set 9 Solutions
CSE 26 Digital Computers: Organization and Logical Design - 27 Jon Turner Problem Set 9 Solutions. For each of the sequential circuits shown below, draw in the missing parts of the timing diagrams. You
More informationL4: Sequential Building Blocks (Flip-flops, Latches and Registers)
L4: Sequential Building Blocks (Flip-flops, Latches and Registers) Acknowledgements: Lecture material adapted from R. Katz, G. Borriello, Contemporary Logic esign (second edition), Prentice-Hall/Pearson
More informationDigital Circuits ECS 371
Digital Circuits ECS 371 Dr. Prapun Suksompong prapun@siit.tu.ac.th Lecture 18 Office Hours: BKD 3601-7 Monday 9:00-10:30, 1:30-3:30 Tuesday 10:30-11:30 1 Announcement Reading Assignment: Chapter 7: 7-1,
More informationTopic 8: Sequential Circuits. Bistable Devices. S-R Latches. Consider the following element. Readings : Patterson & Hennesy, Appendix B.4 - B.
Topic 8: Sequential Circuits Bistable Devices Readings : Consider the following element Patterson & Hennesy, Appendix B.4 - B.6 Goals Basic Principles behind Memory Elements Clocks Applications of sequential
More informationIntroduction. Simulation methodology. Simulation results
Introduction Simulation methodology Simulation results Conclusion and Perspectives Introduction Simulation methodology Simulation results Conclusion and Perspectives Radiation induced particles Solar Flare
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 informationCSE140: Components and Design Techniques for Digital Systems. Midterm Information. Instructor: Mohsen Imani. Sources: TSR, Katz, Boriello & Vahid
CSE140: Components and Design Techniques for Digital Systems Midterm Information Instructor: Mohsen Imani Midterm Topics In general: everything that was covered in homework 1 and 2 and related lectures,
More informationCPE100: Digital Logic Design I
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu CPE100: Digital Logic Design I Final Review http://www.ee.unlv.edu/~b1morris/cpe100/ 2 Logistics Tuesday Dec 12 th 13:00-15:00 (1-3pm) 2 hour
More information