More design examples, state assignment and reduction. Page 1
|
|
- Patrick Wilkins
- 6 years ago
- Views:
Transcription
1 More design examples, state assignment and reduction Page 1
2 Serial Parity Checker We have only 2 states (S 0, S 1 ): correspond to an even and odd number of 1 s received so far. x Clock D FF Q Z = 1 whenever circuit is in state S 1 or in State S 0 and X = 1 Z = 0 whenever circuit is in state S 0 or in State S 1 and X = 1 X/Q 0 1 state codes: S 0 S 1 :0 : Next State KM D=X Q+XQ Page 2
3 Serial Comparator Inputs: data inputs (A,B),; an enable input (E) Output: z= 1, if A>b 0, otherwise A B E comparator Z when enable is low, the output is zero Clock when enable is high, the circuit compares A and B numerically (assuming the values are presented with the most-significant bit, first) and outputs 1 if A>B. 1xx A>B /1 0xx EAB Three states implies at least 2 flip flops. One encoding is 00 for state:?? 10 for state: A>B, 01 for state: A<B 110 0xx, 100, 111??/ xx A< B/0 1xx Page 3
4 xx A>B /1 0xx EAB Output equation: A>B = Q 1 Q 0 (simplify to Q 1 ) Next state equations: D Q1 =(Q 1 +Q 0 AB )E =(Q 1 +Q 0 AB )E D Q0 =(Q 0 +Q 1 Q 0 AB )E =(Q 0 +Q 1 AB )E Q 1 Present State Q 1 Q xx, 100, 111 Inputs EAB??/ xx Next State Q 1 Q 0 A< B/0 1xx Output A>B xx xx 0xx 1xx 0xx Page 4
5 Example using JK PS Q1Q0 X NS Q1Q X X X 0 0 Using JK JK=1x JK=x0 0 1 JK=0x JK=x X= X=1 J(Q1) X=0 X=1 Q1Q0 00 (0->0):0 (0->0)0 01 (0->1):1 (0->1)1 10 (1->1):X (1->1)X 11 (1->0):X (1->0)X K(Q1) X=0 X=1 Q1Q0 00 X X 01 1 X Page 5
6 State Assignment Selecting binary patterns for the symbolic states impacts circuit complexity. Outputs and FF input equations depend on current state and are therefore influenced by the assignment of binary values to states. We also have an option in how many flip-flops we use. We can use more than the minimum number of flip-flops and this might result in much simpler logic equations for the flip-flop inputs and circuit outputs. We will consider several different encoding schemes. E&CE 223 Digital Circuits and Systems (A. Kennings) Page 6
7 Example Assume we have the following state diagram. Circuit requires 7 states (S0,, S6) and has 3 inputs (R, B, W). Circuit has 4 outputs (say A, B, C and D). R!W S2/0100 R S0/0000 S1/0000 W R B R R S3/1000 S4/1001 S5/1010 S6/1011 R!B R E&CE 223 Digital Circuits and Systems (A. Kennings) Page 7
8 Encoding Scheme Targeting Minimum FF Count With n-bits (i.e., n flip-flops) we can encode 2 n states. This always gives the minimum number of flip-flops required. In our example, we have 7 states and therefore would need 3 bits for encoding. S0 Ã 000, S1 Ã 001 S2 Ã 010, S3 Ã 011 S4 Ã 100, S5 Ã 101 S6 Ã 110 Note: There is still room for one more state to be encoded. Note: No particular method for assigning any given binary pattern to any particular symbolic state. Will need to derive next state equations and output equations E&CE 223 Digital Circuits and Systems (A. Kennings) Page 8
9 Encoding Scheme Output Encoding Method Sometimes, we can encode the states such that the output of the flip-flops are ALSO the outputs of the circuit!!! Counters are circuits that are good examples of output encodeing... We will see this again later when we talk about counters Consider listing the states of the system, along with their outputs. E&CE 223 Digital Circuits and Systems (A. Kennings) Page 9
10 Encoding Scheme Output Encoding Method When we list outputs along with states, we will see one of two cases: CASE 1: Outputs for each state are distinct (output value becomes the state encoding). CASE 2: Outputs for some states are identical (add additional bits to distinguish those states with identical outputs). E&CE 223 Digital Circuits and Systems (A. Kennings) Page 10
11 Encoding Scheme Output Encoding Method In our example, we need to add an extra bit to distinguish between S0 and S1: Can encode states using 5 flip-flops (let don t cares be 0 for illustration purposes): S0 Ã 00000, S1 Ã 00001, S2 Ã 01000, S3 Ã S4 Ã 10010, S5 Ã 10100, S6 Ã E&CE 223 Digital Circuits and Systems (A. Kennings) Page 11
12 Encoding Scheme Output Encoding Method Uses more flip-flops that minimum flip-flop method. However, no output equations (less logic, less output delays) since outputs come directly from flip-flop outputs. Potentially many unused states, and we might need to be careful about unused states. E&CE 223 Digital Circuits and Systems (A. Kennings) Page 12
13 Encoding Scheme One-Hot Encoding Use 1 flip-flop per state (i.e., n states means n flip-flops). Only the output of 1 flip-flop is ever high at any given time. When the flip-flop output is 1, then we know which state we are in. Generally (although not always), one-hot encoding reduces logic required for output equations and next state equations, but uses more flip-flops. For our example we have 7 states, so with one hot encoding, we would need 7 flipflops and use the following encoding scheme: S0 Ã , S1 Ã , S2 Ã , S3 Ã S4 Ã , S5 Ã , S6 Ã E&CE 223 Digital Circuits and Systems (A. Kennings) Page 13
14 State Reduction In generating a state table/diagram from a verbal description, can get more states than required. The number of flip-flops, complexity of next state and output equations, etc. all depend on the number of states, it is reasonable to ask if a state table/diagram can be simplified to remove redundant states. Sometimes, states are equivalent to each other and can be combine into a single state. E&CE 223 Digital Circuits and Systems (A. Kennings) Page 14
15 Equivalent States Two states are said to be equivalent if: For each circuit input, the states give exactly the same outputs, AND For each circuit input, the states give the same next state or an equivalent next state. E&CE 223 Digital Circuits and Systems (A. Kennings) Page 15
16 State Reduction Row Matching is based on the state-transition table: If two states have the same output and both transition to the same next state or both transition to each other or both self-loop then they are equivalent. Combine the equivalent states into a new renamed state. Repeat until no more states are combined State Transition Table NS output PS x=0 x=1 S0 S0 S1 0 S1 S1 S2 1 S2 S2 S1 0
17 Row Matching Example
18 Row Matching Example
19 Call d Call e Page 19
20 Reduced states Reduced State Transition Diagram E&CE 223 Digital Circuits and Systems (A. Kennings) Page 20
21 State Reduction Methods Other methods for state reduction: Implication charts and merger diagrams. Partitioning. E&CE 223 Digital Circuits and Systems (A. Kennings) Page 21
22 Example Implication Charts and Merger Diagrams Consider the following state table for a 1-input, 1-output circuit. Our initial design resulted in a state table with 5 states and needs at least 3 flipflops. But, we can do better E&CE 223 Digital Circuits and Systems (A. Kennings) Page 22
23 Implication Charts We can tabulate equivalencies in a so-called implication chart. The implication chart looks like the lower triangle of a matrix each entry is intended to tell us under what conditions two states are equivalent. S1 S2 S3 S4 S0 S1 S2 S3 State table Implication chart E&CE 223 Digital Circuits and Systems (A. Kennings) Page 23
24 Implication Charts We begin by marking entries in the implication chart with an x if two states cannot be equivalent due to different output values. S1 S2 S3 S4 S0 S1 S2 S3 State table Implication chart E&CE 223 Digital Circuits and Systems (A. Kennings) Page 24
25 Implication Chart Equivalent States Next, we mark entries that are definitely equivalent. We also mark entries that are equivalent under implied decisions. S1 S2 S3 (S0,S1) (S3,S4) S4 (S0,S2) (S1,S2) (S1,S3) S0 S1 S2 S3 State table Implication chart E&CE 223 Digital Circuits and Systems (A. Kennings) Page 25
26 Implication Chart Finally, we perform passes over the entries from top-left to bottom-right trying to cross out those states that cannot be equivalent due to implied decisions. S1 S2 S3 (S0,S1) (S3,S4) S4 (S0,S2) (S1,S2) (S1,S3) S0 S1 S2 S3 State table Implication chart E&CE 223 Digital Circuits and Systems (A. Kennings) Page 26
27 Merger Diagram From the implication chart, we can built a graph (Merger Diagram) that shows merges. Nodes are states and edges represent equivalency. Boxes with any x in them represent non-equivalent states. Boxes with all v in them represent equivalency and are represented by an edge. S1 S0 S2 S3 (S0,S1) (S3,S4) S1 S2 S4 (S0,S2) (S1,S2) (S1,S3) S0 S1 S2 S3 S3 S4 Implication chart Merger Diagram E&CE 223 Digital Circuits and Systems (A. Kennings) Page 27
28 Important We need to make sure each state is included somewhere: We are okay, since S0,, S4 are all included. We need to check the implied decisions hold E.g., (S0,S2) are always equivalent, so this is okay. E.g., (S1,S4) required that (S0,S2) are implied (see implication chart). We have this merge, so it is true, and we are okay. Since implied decisions all check out, our reduction is good and we are done. E&CE 223 Digital Circuits and Systems (A. Kennings) Page 28
29 Final Result Merge (S0,S2), (S1,S4) and (S3). Our original state table that had 5 states and needed at least 3 flip-flops. Our new, and reduced, state table that has only 3 states and needs only 2 flip-flops. Both tables will implement the same design, but the reduced state stable will likely result in a simpler and smaller circuit. E&CE 223 Digital Circuits and Systems (A. Kennings) Page 29
30 Textbook Reduction of state tables using implication charts and merger diagrams is covered in Chapter 9, Section 9.5 of the course textbook. E&CE 223 Digital Circuits and Systems (A. Kennings) Page 30
31 Example - Partitioning Consider the following state table for a circuit with 1 input A and 1 output Z: Can divide states into partitions (or groups) of equivalent states. E&CE 223 Digital Circuits and Systems (A. Kennings) Page 31
32 Partitioning - Procedure Procedure: FIRST: Group states according to circuit outputs produced. States are only equivalent if their outputs are the same for all input patterns. So, we get groups in which all the states in each group might be equivalent. LOOP: For each group, consider each input pattern. If, for any input pattern, different states in a group result in a transition to a different other groups, then those states are not equivalent. So, we separate the group in to two smaller groups. Continue dividing groups into smaller partitions until all the states in any group transition to the SAME other group for ANY input pattern. Once we reach the point where further division of groups is not required, we have identified the equivalent states. E&CE 223 Digital Circuits and Systems (A. Kennings) Page 32
33 Partitioning - Illustration Consider our example We can see that, in fact, there are only 3 required states (and not 5) since some states are equivalent. This means less flip-flops and (likely) less logic to produce next state and output equations. (S0,S2) (S0,S2) (S1,S4) (S0,S1,S2,S3,S4) (S1,S3,S4) (S3) divide based on outputs divide based on next state E&CE 223 Digital Circuits and Systems (A. Kennings) Page 33
34 Partitioning Final Result We can merge together equivalent states and end up with a smaller state diagram and state table: (S0,S2) (S0,S2) 1 (S0,S2) (S0,S1,S2,S3,S4) (S1,S4) (S1,S4) 1 0 divide based on outputs (S1,S3,S4) divide based on next state (S3) 1 (S3) 0 1 E&CE 223 Digital Circuits and Systems (A. Kennings) Page 34
35 Textbook State assignment and state reduction is covered in the textbook in Chapter 5, Section 5.6 E&CE 223 Digital Circuits and Systems (A. Kennings) Page 35
Section 6.8 Synthesis of Sequential Logic Page 1 of 8
Section 6.8 Synthesis of Sequential Logic Page of 8 6.8 Synthesis of Sequential Logic Steps:. Given a description (usually in words), develop the state diagram. 2. Convert the state diagram to a next-state
More informationECE 301 Digital Electronics
ECE 301 Digital Electronics Derivation of Flip-Flop Input Equations and State Assignment (Lecture #24) The slides included herein were taken from the materials accompanying Fundamentals of Logic Design,
More informationLecture 11: Synchronous Sequential Logic
Lecture 11: Synchronous Sequential Logic Syed M. Mahmud, Ph.D ECE Department Wayne State University Aby K George, ECE Department, Wayne State University Contents Characteristic equations Analysis of clocked
More informationDIGITAL TECHNICS. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute
27.2.2. DIGITAL TECHNICS Dr. Bálint Pődör Óbuda University, Microelectronics and Technology Institute 6. LECTURE (ANALYSIS AND SYNTHESIS OF SYNCHRONOUS SEQUENTIAL CIRCUITS) 26/27 6. LECTURE Analysis and
More informationLogic Design II (17.342) Spring Lecture Outline
Logic Design II (17.342) Spring 2012 Lecture Outline Class # 05 February 23, 2012 Dohn Bowden 1 Today s Lecture Analysis of Clocked Sequential Circuits Chapter 13 2 Course Admin 3 Administrative Admin
More informationWEEK 10. Sequential Circuits: Analysis and Design. Page 1
WEEK 10 Sequential Circuits: Analysis and Design Page 1 Analysis of Clocked (Synchronous) Sequential Circuits Now that we have flip-flops and the concept of memory in our circuit, we might want to determine
More informationEECS150 - Digital Design Lecture 19 - Finite State Machines Revisited
EECS150 - Digital Design Lecture 19 - Finite State Machines Revisited April 2, 2013 John Wawrzynek Spring 2013 EECS150 - Lec19-fsm Page 1 Finite State Machines (FSMs) FSM circuits are a type of sequential
More informationThe reduction in the number of flip-flops in a sequential circuit is referred to as the state-reduction problem.
State Reduction The reduction in the number of flip-flops in a sequential circuit is referred to as the state-reduction problem. State-reduction algorithms are concerned with procedures for reducing the
More informationChapter 5 Synchronous Sequential Logic
Chapter 5 Synchronous Sequential Logic Chih-Tsun Huang ( 黃稚存 ) http://nthucad.cs.nthu.edu.tw/~cthuang/ Department of Computer Science National Tsing Hua University Outline Introduction Storage Elements:
More informationEECS150 - Digital Design Lecture 15 Finite State Machines. Announcements
EECS150 - Digital Design Lecture 15 Finite State Machines October 18, 2011 Elad Alon Electrical Engineering and Computer Sciences University of California, Berkeley http://www-inst.eecs.berkeley.edu/~cs150
More informationSwitching Circuits & Logic Design, Fall Final Examination (1/13/2012, 3:30pm~5:20pm)
Switching Circuits & Logic Design, Fall 2011 Final Examination (1/13/2012, 3:30pm~5:20pm) Problem 1: (15 points) Consider a new FF with three inputs, S, R, and T. No more than one of these inputs can be
More informationDIGITAL TECHNICS II. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute
26.3.9. DIGITAL TECHNICS II Dr. Bálint Pődör Óbuda University, Microelectronics and Technology Institute 5. LECTURE: ANALYSIS AND SYNTHESIS OF SYNCHRONOUS SEQUENTIAL CIRCUITS 2nd (Spring) term 25/26 5.
More informationFinal Examination (Open Katz, Calculators OK, 3 hours)
Your Name: UNIVERSITY OF CALIFORNIA AT BERKELEY BERKELEY DAVIS IRVINE LOS ANGELES RIVERSIDE SAN DIEGO SAN FRANCISCO Department of Electrical Engineering and Computer Sciences SANTA BARBARA SANTA CRUZ CS
More informationSequential Circuits. Output depends only and immediately on the inputs Have no memory (dependence on past values of the inputs)
Sequential Circuits Combinational circuits Output depends only and immediately on the inputs Have no memory (dependence on past values of the inputs) Sequential circuits Combination circuits with memory
More informationDr.Mohamed Elmahdy Winter 2015 Eng.Yasmin Mohamed. Problem Set 6. Analysis and Design of Clocked Sequential Circuits. Discussion: 7/11/ /11/2015
Dr. Elmahdy Winter 2015 Problem Set 6 Analysis and Design of Clocked Sequential Circuits Discussion: 7/11/2015 17/11/2015 *Exercise 6-1: (Problem 5.10) A sequential circuit has two JK flip-flops A and
More informationUnit 11. Latches and Flip-Flops
Unit 11 Latches and Flip-Flops 1 Combinational Circuits A combinational circuit consists of logic gates whose outputs, at any time, are determined by combining the values of the inputs. For n input variables,
More informationEE292: Fundamentals of ECE
EE292: Fundamentals of ECE Fall 2012 TTh 10:00-11:15 SEB 1242 Lecture 23 121120 http://www.ee.unlv.edu/~b1morris/ee292/ 2 Outline Review Combinatorial Logic Sequential Logic 3 Combinatorial Logic Circuits
More informationUNIT 1 NUMBER SYSTEMS AND DIGITAL LOGIC FAMILIES 1. Briefly explain the stream lined method of converting binary to decimal number with example. 2. Give the Gray code for the binary number (111) 2. 3.
More informationChapter 5. Introduction
Chapter 5 Synchronous Sequential Logic Chapter 5 Introduction Circuits require memory to store intermediate data Sequential circuits use a periodic signal to determine when to store values. A clock signal
More information1. Convert the decimal number to binary, octal, and hexadecimal.
1. Convert the decimal number 435.64 to binary, octal, and hexadecimal. 2. Part A. Convert the circuit below into NAND gates. Insert or remove inverters as necessary. Part B. What is the propagation delay
More informationECE 331 Digital System Design
ECE 331 Digital System Design Counters (Lecture #20) The slides included herein were taken from the materials accompanying Fundamentals of Logic Design, 6 th Edition, by Roth and Kinney, and were used
More informationECE 301 Digital Electronics
ECE 301 Digital Electronics Counters (Lecture #20) The slides included herein were taken from the materials accompanying Fundamentals of Logic Design, 6 th Edition, by Roth and Kinney, and were used with
More informationL5 Sequential Circuit Design
L Sequential Circuit Design Sequential Circuit Design Mealy and Moore Characteristic Equations Design Procedure Example Sequential Problem from specification to implementation Ref: Unit 14 of text 9/2/2012
More informationCSE Latches and Flip-flops Dr. Izadi. NOR gate property: A B Z Cross coupled NOR gates: S M S R Q M
CSE-4523 Latches and Flip-flops Dr. Izadi NOR gate property: A B Z A B Z Cross coupled NOR gates: S M S R M R S M R S R S R M S S M R R S ' Gate R Gate S R S G R S R (t+) S G R Flip_flops:. S-R flip-flop
More informationDigital Logic Design I
Digital Logic Design I Synchronous Sequential Logic Mustafa Kemal Uyguroğlu Sequential Circuits Asynchronous Inputs Combinational Circuit Memory Elements Outputs Synchronous Inputs Combinational Circuit
More informationUNIT III. Combinational Circuit- Block Diagram. Sequential Circuit- Block Diagram
UNIT III INTRODUCTION In combinational logic circuits, the outputs at any instant of time depend only on the input signals present at that time. For a change in input, the output occurs immediately. Combinational
More informationChapter 6. Flip-Flops and Simple Flip-Flop Applications
Chapter 6 Flip-Flops and Simple Flip-Flop Applications Basic bistable element It is a circuit having two stable conditions (states). It can be used to store binary symbols. J. C. Huang, 2004 Digital Logic
More informationAsynchronous (Ripple) Counters
Circuits for counting events are frequently used in computers and other digital systems. Since a counter circuit must remember its past states, it has to possess memory. The chapter about flip-flops introduced
More informationFinal Exam review: chapter 4 and 5. Supplement 3 and 4
Final Exam review: chapter 4 and 5. Supplement 3 and 4 1. A new type of synchronous flip-flop has the following characteristic table. Find the corresponding excitation table with don t cares used as much
More informationFlip-Flops and Sequential Circuit Design
Flip-Flops and Sequential Circuit Design ECE 52 Summer 29 Reading ssignment Brown and Vranesic 7 Flip-Flops, Registers, Counters and a Simple Processor 7.5 T Flip-Flop 7.5. Configurable Flip-Flops 7.6
More informationChapter 5: Synchronous Sequential Logic
Chapter 5: Synchronous Sequential Logic NCNU_2016_DD_5_1 Digital systems may contain memory for storing information. Combinational circuits contains no memory elements the outputs depends only on the inputs
More informationCHAPTER 4: Logic Circuits
CHAPTER 4: Logic Circuits II. Sequential Circuits Combinational circuits o The outputs depend only on the current input values o It uses only logic gates, decoders, multiplexers, ALUs Sequential circuits
More informationChapter 3. Boolean Algebra and Digital Logic
Chapter 3 Boolean Algebra and Digital Logic Chapter 3 Objectives Understand the relationship between Boolean logic and digital computer circuits. Learn how to design simple logic circuits. Understand how
More informationUNIT IV. Sequential circuit
UNIT IV Sequential circuit Introduction In the previous session, we said that the output of a combinational circuit depends solely upon the input. The implication is that combinational circuits have no
More informationCHAPTER 4: Logic Circuits
CHAPTER 4: Logic Circuits II. Sequential Circuits Combinational circuits o The outputs depend only on the current input values o It uses only logic gates, decoders, multiplexers, ALUs Sequential circuits
More informationRS flip-flop using NOR gate
RS flip-flop using NOR gate Triggering and triggering methods Triggering : Applying train of pulses, to set or reset the memory cell is known as Triggering. Triggering methods:- There are basically two
More informationMC9211 Computer Organization
MC9211 Computer Organization Unit 2 : Combinational and Sequential Circuits Lesson2 : Sequential Circuits (KSB) (MCA) (2009-12/ODD) (2009-10/1 A&B) Coverage Lesson2 Outlines the formal procedures for the
More informationDr. Shahram Shirani COE2DI4 Midterm Test #2 Nov 19, 2008
Page 1 Dr. Shahram Shirani COE2DI4 Midterm Test #2 Nov 19, 2008 Instructions: This examination paper includes 13 pages and 20 multiple-choice questions starting on page 3. You are responsible for ensuring
More informationFPGA Implementation of Sequential Logic
ECE 428 Programmable ASIC Design FPGA Implementation of Sequential Logic Haibo Wang ECE Department Southern Illinois University Carbondale, IL 62901 8-1 Sequential Circuit Model Combinational Circuit:
More informationCS61C : Machine Structures
CS 6C L4 State () inst.eecs.berkeley.edu/~cs6c/su5 CS6C : Machine Structures Lecture #4: State and FSMs Outline Waveforms State Clocks FSMs 25-7-3 Andy Carle CS 6C L4 State (2) Review (/3) (2/3): Circuit
More informationLogic and Computer Design Fundamentals. Chapter 7. Registers and Counters
Logic and Computer Design Fundamentals Chapter 7 Registers and Counters Registers Register a collection of binary storage elements In theory, a register is sequential logic which can be defined by a state
More informationDesign and Simulation of a Digital CMOS Synchronous 4-bit Up-Counter with Set and Reset
Design and Simulation of a Digital CMOS Synchronous 4-bit Up-Counter with Set and Reset Course Number: ECE 533 Spring 2013 University of Tennessee Knoxville Instructor: Dr. Syed Kamrul Islam Prepared by
More informationChapter. Synchronous Sequential Circuits
Chapter 5 Synchronous Sequential Circuits Logic Circuits- Review Logic Circuits 2 Combinational Circuits Consists of logic gates whose outputs are determined from the current combination of inputs. Performs
More informationELE2120 Digital Circuits and Systems. Tutorial Note 8
ELE2120 Digital Circuits and Systems Tutorial Note 8 Outline 1. Register 2. Counters 3. Synchronous Counter 4. Asynchronous Counter 5. Sequential Circuit Design Overview 1. Register Applications: temporally
More informationSequential Logic Circuits
Sequential Logic Circuits By Dr. M. Hebaishy Digital Logic Design Ch- Rem.!) Types of Logic Circuits Combinational Logic Memoryless Outputs determined by current values of inputs Sequential Logic Has memory
More informationCounter dan Register
Counter dan Register Introduction Circuits for counting events are frequently used in computers and other digital systems. Since a counter circuit must remember its past states, it has to possess memory.
More informationChapter 5 Sequential Circuits
Logic and Computer Design Fundamentals Chapter 5 Sequential Circuits Part 2 Sequential Circuit Design Charles Kime & Thomas Kaminski 28 Pearson Education, Inc. (Hyperlinks are active in View Show mode)
More informationUniversity of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Science SOLUTIONS
University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Science EECS 5 Fall 25 R. H. Katz SOLUTIONS Problem Set #3: Combinational and Sequential Logic
More informationChapter 5 Synchronous Sequential Logic
EEA051 - Digital Logic 數位邏輯 Chapter 5 Synchronous Sequential Logic 吳俊興國立高雄大學資訊工程學系 December 2005 Chapter 5 Synchronous Sequential Logic 5-1 Sequential Circuits 5-2 Latches 5-3 Flip-Flops 5-4 Analysis of
More information1. a) For the circuit shown in figure 1.1, draw a truth table showing the output Q for all combinations of inputs A, B and C. [4] Figure 1.
[Question 1 is compulsory] 1. a) For the circuit shown in figure 1.1, draw a truth table showing the output Q for all combinations of inputs A, B and C. Figure 1.1 b) Minimize the following Boolean functions:
More informationUniversal Asynchronous Receiver- Transmitter (UART)
Universal Asynchronous Receiver- Transmitter (UART) (UART) Block Diagram Four-Bit Bidirectional Shift Register Shift Register Counters Shift registers can form useful counters by recirculating a pattern
More informationOther Flip-Flops. Lecture 27 1
Other Flip-Flops Other types of flip-flops can be constructed by using the D flip-flop and external logic. Two flip-flops less widely used in the design of digital systems are the JK and T flip-flops.
More informationSoftware Engineering 2DA4. Slides 9: Asynchronous Sequential Circuits
Software Engineering 2DA4 Slides 9: Asynchronous Sequential Circuits Dr. Ryan Leduc Department of Computing and Software McMaster University Material based on S. Brown and Z. Vranesic, Fundamentals of
More informationCHAPTER 11 LATCHES AND FLIP-FLOPS
CHAPTER 11 1/25 LATCHES AND FLIP-FLOPS This chapter in the book includes: Objectives Study Guide 11.1 Introduction 11.2 Set-Reset Latch 11.3 Gated D Latch 11.4 Edge-Triggered D Flip-Flop 11.5 S-R Flip-Flop
More information1.b. Realize a 5-input NOR function using 2-input NOR gates only.
. [3 points] Short Questions.a. Prove or disprove that the operators (,XOR) form a complete set. Remember that the operator ( ) is implication such that: A B A B.b. Realize a 5-input NOR function using
More informationVignana Bharathi Institute of Technology UNIT 4 DLD
DLD UNIT IV Synchronous Sequential Circuits, Latches, Flip-flops, analysis of clocked sequential circuits, Registers, Shift registers, Ripple counters, Synchronous counters, other counters. Asynchronous
More informationNH 67, Karur Trichy Highways, Puliyur C.F, Karur District UNIT-III SEQUENTIAL CIRCUITS
NH 67, Karur Trichy Highways, Puliyur C.F, 639 114 Karur District DEPARTMENT OF ELETRONICS AND COMMUNICATION ENGINEERING COURSE NOTES SUBJECT: DIGITAL ELECTRONICS CLASS: II YEAR ECE SUBJECT CODE: EC2203
More informationQuiz #4 Thursday, April 25, 2002, 5:30-6:45 PM
Last (family) name: First (given) name: Student I.D. #: Circle section: Hu Saluja Department of Electrical and Computer Engineering University of Wisconsin - Madison ECE/CS 352 Digital System Fundamentals
More informationLAB 7. Latches & Flip Flops
بسام عب د الكريم جاد هللا النبريص Bass am Ak J Alnabr iss Islamic University of Gaza Faculty of Engineering Computer Engineering Dept. Digital Design Lab : ECOM 2112 Fall 2016 Eng. Bassam Nabriss LAB 7
More information# "$ $ # %!"$!# &!'$("!)!"! $ # *!"! $ '!!$ #!!)! $ "# ' "
!" #!""! # "$ $ # %!"$!# &!'$("!)!"! $ # *!"! $ '!!$ #!!)! $ "# ' " % &! # Design a combinational logic circuit 10:4 encoder which has a 10-bit input (D9 to D0) and a 4-bit output. If bit position i of
More informationSynchronous Sequential Logic
Synchronous Sequential Logic ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall, 2017 ldvan@cs.nctu.edu.tw http://www.cs.nctu.edu.tw/~ldvan/ Outlines Sequential
More informationYEDITEPE UNIVERSITY DEPARTMENT OF COMPUTER ENGINEERING. EXPERIMENT VIII: FLIP-FLOPS, COUNTERS 2014 Fall
YEDITEPE UNIVERSITY DEPARTMENT OF COMPUTER ENGINEERING EXPERIMENT VIII: FLIP-FLOPS, COUNTERS 2014 Fall Objective: - Dealing with the operation of simple sequential devices. Learning invalid condition in
More informationSt. MARTIN S ENGINEERING COLLEGE
St. MARTIN S ENGINEERING COLLEGE Dhulapally, Kompally, Secunderabad-500014. Branch Year&Sem Subject Name : Electronics and Communication Engineering : II B. Tech I Semester : SWITCHING THEORY AND LOGIC
More informationMUHAMMAD NAEEM LATIF MCS 3 RD SEMESTER KHANEWAL
1. A stage in a shift register consists of (a) a latch (b) a flip-flop (c) a byte of storage (d) from bits of storage 2. To serially shift a byte of data into a shift register, there must be (a) one click
More informationLecture 8: Sequential Logic
Lecture 8: Sequential Logic Last lecture discussed how we can use digital electronics to do combinatorial logic we designed circuits that gave an immediate output when presented with a given set of inputs
More informationSynchronous sequential circuits
8.6.5 Synchronous sequential Table of content. Combinational circuit design. Elementary combinatorial for data transmission. Memory structures 4. Programmable logic devices 5. Algorithmic minimization
More informationFactory configured macros for the user logic
Factory configured macros for the user logic Document ID: VERSION 1.0 Budapest, November 2011. User s manual version information Version Date Modification Compiled by Version 1.0 11.11.2011. First edition
More informationUnit 9 Latches and Flip-Flops. Dept. of Electrical and Computer Eng., NCTU 1
Unit 9 Latches and Flip-Flops Dept. of Electrical and Computer Eng., NCTU 1 9.1 Introduction Dept. of Electrical and Computer Eng., NCTU 2 What is the characteristic of sequential circuits in contrast
More informationDigital Logic Design Sequential Circuits. Dr. Basem ElHalawany
Digital Logic Design Sequential Circuits Dr. Basem ElHalawany Combinational vs Sequential inputs X Combinational Circuits outputs Z A combinational circuit: At any time, outputs depends only on inputs
More informationMODEL QUESTIONS WITH ANSWERS THIRD SEMESTER B.TECH DEGREE EXAMINATION DECEMBER CS 203: Switching Theory and Logic Design. Time: 3 Hrs Marks: 100
MODEL QUESTIONS WITH ANSWERS THIRD SEMESTER B.TECH DEGREE EXAMINATION DECEMBER 2016 CS 203: Switching Theory and Logic Design Time: 3 Hrs Marks: 100 PART A ( Answer All Questions Each carries 3 Marks )
More informationSequential Logic. E&CE 223 Digital Circuits and Systems (A. Kennings) Page 1
Sequential Logic E&CE 223 igital Circuits and Systems (A. Kennings) Page 1 Sequential Circuits Have considered only combinational circuits in which circuit outputs are determined entirely by current circuit
More informationPart II. Chapter2: Synchronous Sequential Logic
課程名稱 : 數位系統設計導論 P-/77 Part II Chapter2: Synchronous Sequential Logic 教師 : 郭峻因教授 INSTRUCTOR: Prof. Jiun-In Guo E-mail: jiguo@cs.ccu.edu.tw 課程名稱 : 數位系統設計導論 P-2/77 Special thanks to Prof. CHING-LING SU for
More informationIntroduction. NAND Gate Latch. Digital Logic Design 1 FLIP-FLOP. Digital Logic Design 1
2007 Introduction BK TP.HCM FLIP-FLOP So far we have seen Combinational Logic The output(s) depends only on the current values of the input variables Here we will look at Sequential Logic circuits The
More information11.1 As mentioned in Experiment 10, sequential logic circuits are a type of logic circuit where the output
EE 2449 Experiment JL and NWP //8 CALIFORNIA STATE UNIVERSITY LOS ANGELES Department of Electrical and Computer Engineering EE-2449 Digital Logic Lab EXPERIMENT SEQUENTIAL CIRCUITS Text: Mano and Ciletti,
More informationCPS311 Lecture: Sequential Circuits
CPS311 Lecture: Sequential Circuits Last revised August 4, 2015 Objectives: 1. To introduce asynchronous and synchronous flip-flops (latches and pulsetriggered, plus asynchronous preset/clear) 2. To introduce
More informationREPEAT EXAMINATIONS 2002
REPEAT EXAMINATIONS 2002 EE101 Digital Electronics Solutions Question 1. An engine has 4 fail-safe sensors. The engine should keep running unless any of the following conditions arise: o If sensor 2 is
More informationSEMESTER ONE EXAMINATIONS 2002
SEMESTER ONE EXAMINATIONS 2002 EE101 Digital Electronics Solutions Question 1. An assembly line has 3 failsafe sensors and 1 emergency shutdown switch. The Line should keep moving unless any of the following
More informationCourse Administration
EE 224: INTRODUCTION TO DIGITAL CIRCUITS & COMPUTER DESIGN Lecture 5: Sequential Logic - 2 Analysis of Clocked Sequential Systems 4/2/2 Avinash Kodi, kodi@ohio.edu Course Administration 2 Hw 2 due on today
More informationAC103/AT103 ANALOG & DIGITAL ELECTRONICS JUN 2015
Q.2 a. Draw and explain the V-I characteristics (forward and reverse biasing) of a pn junction. (8) Please refer Page No 14-17 I.J.Nagrath Electronic Devices and Circuits 5th Edition. b. Draw and explain
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 8 Following the slides of Dr. Ahmed H. Madian محرم 1439 ه Winter
More informationIn this lecture we will work through a design example from problem statement to digital circuits.
Lecture : A Design Example - Traffic Lights In this lecture we will work through a design example from problem statement to digital circuits. The Problem: The traffic department is trying out a new system
More informationEXPERIMENT 13 ITERATIVE CIRCUITS
EE 2449 Experiment 13 Revised 4/17/2017 CALIFORNIA STATE UNIVERSITY LOS ANGELES Department of Electrical and Computer Engineering EE-246 Digital Logic Lab EXPERIMENT 13 ITERATIVE CIRCUITS Text: Mano, Digital
More informationComputer Organization & Architecture Lecture #5
Computer Organization & Architecture Lecture #5 Shift Register A shift register is a register in which binary data can be stored and then shifted left or right when a shift signal is applied. Bits shifted
More informationCombinational / Sequential Logic
Digital Circuit Design and Language Combinational / Sequential Logic Chang, Ik Joon Kyunghee University Combinational Logic + The outputs are determined by the present inputs + Consist of input/output
More informationDepartment of Computer Science and Engineering Question Bank- Even Semester:
Department of Computer Science and Engineering Question Bank- Even Semester: 2014-2015 CS6201& DIGITAL PRINCIPLES AND SYSTEM DESIGN (Common to IT & CSE, Regulation 2013) UNIT-I 1. Convert the following
More informationBISHOP ANSTEY HIGH SCHOOL & TRINITY COLLEGE EAST SIXTH FORM CXC CAPE PHYSICS, UNIT 2 Ms. S. S. CALBIO NOTES lesson #39
BISHOP ANSTEY HIGH SCHOOL & TRINITY COLLEGE EAST SIXTH FORM CXC CAPE PHYSICS, UNIT 2 Ms. S. S. CALBIO NOTES lesson #39 Objectives: Students should be able to Thursday 21 st January 2016 @ 10:45 am Module
More informationASYNCHRONOUS COUNTER CIRCUITS
ASYNCHRONOUS COUNTER CIRCUITS Asynchronous counters do not have a common clock that controls all the Hipflop stages. The control clock is input into the first stage, or the LSB stage of the counter. The
More informationDigital Circuits I and II Nov. 17, 1999
Physics 623 Digital Circuits I and II Nov. 17, 1999 Digital Circuits I 1 Purpose To introduce the basic principles of digital circuitry. To understand the small signal response of various gates and circuits
More informationCS6201 UNIT I PART-A. Develop or build the following Boolean function with NAND gate F(x,y,z)=(1,2,3,5,7).
VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur-603203 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Academic Year: 2015-16 BANK - EVEN SEMESTER UNIT I PART-A 1 Find the octal equivalent of hexadecimal
More informationTo design a sequential logic circuit using D-Flip-flop. To implement the designed circuit.
6.1 Objectives To design a sequential logic circuit using D-Flip-flop. To implement the designed circuit. 6.2 Sequential Logic So far we have implemented digital circuits whose outputs depend only on its
More informationSequential Logic Notes
Sequential Logic Notes Andrew H. Fagg igital logic circuits composed of components such as AN, OR and NOT gates and that do not contain loops are what we refer to as stateless. In other words, the output
More informationSynchronous Sequential Logic
Synchronous Sequential Logic ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall, 2012 ldvan@cs.nctu.edu.tw http://www.cs.nctu.edu.tw/~ldvan/ Outlines Sequential
More informationSynchronous Sequential Logic. Chapter 5
Synchronous Sequential Logic Chapter 5 5-1 Introduction Combinational circuits contains no memory elements the outputs depends on the inputs Synchronous Sequential Logic 5-2 5-2 Sequential Circuits Sequential
More informationDepartment of Electrical and Computer Engineering Mid-Term Examination Winter 2012
1 McGill University Faculty of Engineering ECSE-221B Introduction to Computer Engineering Department of Electrical and Computer Engineering Mid-Term Examination Winter 2012 Examiner: Rola Harmouche Date:
More informationECE 172 Digital Systems. Chapter 2.2 Review: Ring Counter, Johnson Counter. Herbert G. Mayer, PSU Status 7/14/2018
ECE 172 Digital Systems Chapter 2.2 Review: Ring Counter, Johnson Counter Herbert G. Mayer, PSU Status 7/14/2018 1 Syllabus l Ring Counter l Parallel Output Ring Counter l Ring Counter via D Flip-Flops
More informationDigital Design, Kyung Hee Univ. Chapter 5. Synchronous Sequential Logic
Chapter 5. Synchronous Sequential Logic 1 5.1 Introduction Electronic products: ability to send, receive, store, retrieve, and process information in binary format Dependence on past values of inputs Sequential
More informationCourse Plan. Course Articulation Matrix: Mapping of Course Outcomes (COs) with Program Outcomes (POs) PSO-1 PSO-2
Course Plan Semester: 4 - Semester Year: 2019 Course Title: DIGITAL ELECTRONICS Course Code: EC106 Semester End Examination: 70 Continuous Internal Evaluation: 30 Lesson Plan Author: Ms. CH SRIDEVI Last
More informationDIGITAL SYSTEM DESIGN UNIT I (2 MARKS)
DIGITAL SYSTEM DESIGN UNIT I (2 MARKS) 1. Convert Binary number (111101100) 2 to Octal equivalent. 2. Convert Binary (1101100010011011) 2 to Hexadecimal equivalent. 3. Simplify the following Boolean function
More informationCounters
Counters A counter is the most versatile and useful subsystems in the digital system. A counter driven by a clock can be used to count the number of clock cycles. Since clock pulses occur at known intervals,
More informationPart 4: Introduction to Sequential Logic. Basic Sequential structure. Positive-edge-triggered D flip-flop. Flip-flops classified by inputs
Part 4: Introduction to Sequential Logic Basic Sequential structure There are two kinds of components in a sequential circuit: () combinational blocks (2) storage elements Combinational blocks provide
More information