Multiplexors Sequential Circuits and Finite State Machines Prof. Sin-Min Lee Department of Computer Science.

Slides:



Advertisements
Similar presentations
التصميم المنطقي Second Course
Advertisements

COE 202: Digital Logic Design Sequential Circuits Part 1 Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office: Ahmad Almulhem, KFUPM.
A. Abhari CPS2131 Sequential Circuits Most digital systems like digital watches, digital phones, digital computers, digital traffic light controllers and.
1 Fundamentals of Computer Science Sequential Circuits.
Classification of Digital Circuits  Combinational. Output depends only on current input values.  Sequential. Output depends on current input values and.
Princess Sumaya University
Sequential Circuits1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Sequential circuits The digital circuits considered thus far have been combinational, where the outputs are entirely dependent on the current inputs. Although.
Module 12.  In Module 9, 10, 11, you have been introduced to examples of combinational logic circuits whereby the outputs are entirely dependent on the.
1 Sequential Circuits –Digital circuits that use memory elements as part of their operation –Characterized by feedback path –Outputs depend not only on.
Circuits require memory to store intermediate data
Dr. ClincyLecture1 Appendix A – Part 2: Logic Circuits Current State or output of the device is affected by the previous states Circuit Flip Flops New.
Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh.
EKT 124 / 3 DIGITAL ELEKTRONIC 1
Revision Mid 2 Prof. Sin-Min Lee Department of Computer Science.
ENGIN112 L20: Sequential Circuits: Flip flops October 20, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 20 Sequential Circuits: Flip.
Sequential Circuits and Finite State Machines Prof. Sin-Min Lee
CHAPTER 3 Digital Logic Structures
CS 151 Digital Systems Design Lecture 20 Sequential Circuits: Flip flops.
Sequential Circuits. 2 Sequential vs. Combinational Combinational Logic:  Output depends only on current input −TV channel selector (0-9) Sequential.
ECE 301 – Digital Electronics Introduction to Sequential Logic Circuits (aka. Finite State Machines) and FSM Analysis (Lecture #17)
ECE 331 – Digital Systems Design Introduction to Sequential Logic Circuits (aka. Finite State Machines) and FSM Analysis (Lecture #19)
Overview Part 1 - Storage Elements and Sequential Circuit Analysis
So far, all of the logic circuits we have studied were basically based on the analysis and design of combinational digital circuits. The other major aspect.
Digital Logic Design CHAPTER 5 Sequential Logic. 2 Sequential Circuits Combinational circuits – The outputs are entirely dependent on the current inputs.
Flip Flops. Clock Signal Sequential logic circuits have memory Output is a function of input and present state Sequential circuits are synchronized by.
Digital Computer Design Fundamental
COE 202: Digital Logic Design Sequential Circuits Part 1
Flip Flop
EE2174: Digital Logic and Lab Professor Shiyan Hu Department of Electrical and Computer Engineering Michigan Technological University CHAPTER 9 Sequential.
Chap 4. Sequential Circuits
Unit 11 Latches and Flip-Flops Fundamentals of Logic Design By Roth and Kinney.
FLIP FLOP By : Pn Siti Nor Diana Ismail CHAPTER 1.
ECA1212 Introduction to Electrical & Electronics Engineering Chapter 9: Digital Electronics – Sequential Logic by Muhazam Mustapha, November 2011.
Sequential Logic Combinatorial components: the output values are computed only from their present input values. Sequential components: their output values.
Synchronous Sequential Circuits by Dr. Amin Danial Asham.
Hamming Code,Decoders and D,T-flip flops Prof. Sin-Min Lee Department of Computer Science.
1 Lecture #11 EGR 277 – Digital Logic Ch. 5 - Synchronous Sequential Logic There are two primary classifications of logic circuits: 1.Combinational logic.
1 Synchronous Sequential Logic Sequential Circuits Every digital system is likely to have combinational circuits, most systems encountered in practice.
Synchronous Sequential Logic A digital system has combinational logic as well as sequential logic. The latter includes storage elements. feedback path.
Synchronous Sequential Logic Part I
5 Chapter Synchronous Sequential Circuits 1. Logic Circuits- Review 2 Logic Circuits Sequential Circuits Combinational Circuits Consists of logic gates.
Sahar Mosleh PageCalifornia State University San Marcos 1 More on Flip Flop State Table and State Diagram.
Chapter 6 – Digital Electronics – Part 1 1.D (Data) Flip Flops 2.RS (Set-Reset) Flip Flops 3.T Flip Flops 4.JK Flip Flops 5.JKMS Flip Flops Information.
Lecture 5. Sequential Logic 1 Prof. Taeweon Suh Computer Science Education Korea University 2010 R&E Computer System Education & Research.
Chapter5: Synchronous Sequential Logic – Part 1
Synchronous Sequential Circuits by Dr. Amin Danial Asham.
Synchronous Sequential Circuits by Dr. Amin Danial Asham.
Lecture 1 Gunjeet kaur Dronacharya group of institutions.
Lecture 9 Sequential Logic Prof. Sin-Min Lee Department of Computer Science.
Lecture 10 Flip-Flops/Latches
LATCHES AND FLIP-FLOPS
And Decoders Prof. Sin-Min Lee Department of Computer Science
And Decoders Prof. Sin-Min Lee Department of Computer Science
Lecture 8 Dr. Nermi Hamza.
Flip Flops.
FIGURE 5.1 Block diagram of sequential circuit
Digital Design Lecture 9
Synchronous Sequential Circuits
CISE204: Design of Digital Systems Lecture 18 : Sequential Circuits
Asynchronous Inputs of a Flip-Flop
Assistant Prof. Fareena Saqib Florida Institute of Technology
ECE Digital logic Lecture 16: Synchronous Sequential Logic
Digital Logic Design Sequential Circuits (Chapter 6)
Sequential logic circuits
Synchronous Sequential Circuits
Synchronous sequential
Synchronous Sequential
Flip-Flops.
SEQUENTIAL CIRCUITS __________________________________________________
Presentation transcript:

Multiplexors Sequential Circuits and Finite State Machines Prof. Sin-Min Lee Department of Computer Science

Two-Level NAND Gate Implementation Example 1

Two-Level NAND Gate Implementation Example 1

Design Procedure Determine the required number of inputs and outputs and assign letter symbols to them. Derive the truth table that defines the required relationship between inputs and outputs. Obtain the Boolean function. Draw the logic diagram. Verify the correctness of the design.

Example Design a circuit that converts a BCD codeword to its corresponding excess-3 codeword. We need 4 input variables and 4 output variables. Let us designate the 4 input binary variables by the symbols A, B, and C and D, and the four output variables by w, x, y, and z. The truth table relating the input and output variables is shown below:

Note that the outputs for inputs 1010 through 1111 are don't care.

Two-Lvel NOR Gate Implementation Example 2 e

Multiplexers A combinational circuit that selects info from one of many input lines and directs it to the output line. The selection of the input line is controlled by input variables called selection inputs. They are commonly abbreviated as “MUX”.

Combinational circuit implementation using MUX We can use Multiplexers to express Boolean functions also. Expressing Boolean functions as MUXs is more efficient than as decoders. First n-1 variables of the function used as selection inputs; last variable used as data inputs. If last variable is called Z, then each data input has to be Z, Z’, 0, or 1.

Karnaugh Map Method of Multiplexer Implementation Consider the function: A is taken to be the data variable and B,C to be the select variables.

Example of MUX combo circuit F(X,Y,Z) =  m(1,2,6,7)

Sequential Logic Combinatorial components: the output values are computed only from their present input values. Sequential components: their output values are computed using both the present and past input values. Sequential circuits can contain only a finite number of states  finite state machines Synchronous and Asynchronous

Sequential Circuits Contains Memory Elements Asynchronous sequential circuits change their state and output values when input changes Synchronous sequential circuits change their output values at fixed points of time, which are specified by the rising or falling edge of a clock signal Clock period is the time between successive transitions in the same direction Active high – state changes occur at the clock’s rising edge( on higher voltage) Active low – state changes occur at the clock’s falling edge( on lower voltage)

4 Basic types of Flip-Flops SR, JK, D, and T JK ff has 2 inputs, J and K need to be asserted at the same time to change the state D ff has 1 input D (DATA), which sets the ff when D = 1 and resets it when D = 0 T ff has1 input T (Toggle), which forces the ff to change states when T = 1 SR ff has 2 inputs, S (set) and R (reset) that set or reset the output Q when asserted

Gated D-Latch Ensures S and R inputs never equal to 1 at the same time Useful in control application where setting or resetting a flag to some condition is needed Stores bits of information Constructed from a gated SR latch and a Data latch

Recap - Sequential Systems Example: –Design a D FF with a JK FF and AND, OR, NOT gates: D To Be Designed JQ Q’ CLK K

Sequential Systems - Cont. D(t) JK 0 1

Sequential Systems - Cont. D Q D Q J = D K = D’ D JQ Q’ CLK K

Analysis of Sequential Systems Goal: –Decide the timing and functional behavior from the implementation of a sequential system composed of FFs and logic gates Types: –Functional analysis –Timing analysis

Characteristic Equation of FFs

D Flip-Flop Characteristics :  Synchronous  Avoids the instability of RS flip-flop  Retains its last input value To set the ff, place 1 on D input and pause the CK input To reset, place 1 on D input and pause the CK input DQ+Q Q + = Next State

T Flip-Flop TQ+Q Q Q’ T = 1 force the state change T = 0 state remain the same

JK – Flip Flop J – Set K – Reset J = K = 0 – output does not change J = K = 1 – invert the outputs

Clocked JK – Flip Flop

D and JK Flip-Flop DQ+Q J KQ+Q Q 0 1 Q’

X Y Z F 2 – TO –1 MUX

T CLK Q1

T CLK Q1

J CLK Q1 K

How to use JK to implement D Flip-Flop DQ+Q J KQ+Q Q 0 1 Q’ D ff’s property: When in = 0, the out(Q + ) = 0. When in = 1, the out(Q+) is 1  invert K D  

How to use JK to implement T Flip-Flop TQ+Q Q Q’ J KQ+Q Q 0 1 Q’ T ff’s property: When in = 0, the out(Q + ) = no change When in = 1, the out(Q+) is = complement  No change  State change T

How to use D to implement JK Flip-Flop KQ J 0 1 0( Q ) 1( Q ) ( Q’ ) 1( Q’ ) J KQ+Q Q 0 1 Q’ DQ+Q D = JQ’ + K’Q (Q ) = no state change (Q’) = state change

How to use D to implement JK Flip-Flop D = JQ’ + K’Q J K

How to use T to implement JK Flip-Flop KQ J01J J KQ+Q Q 0 1 Q’ TQ+Q Q Q’ T = KQ + JQ’

How to use T to implement JK Flip-Flop T = KQ + JQ’

How to use D to implement T Flip-Flop TQ+Q Q Q’ Q T D = TQ’ + T’Q DQ+Q

How to use D to implement T Flip-Flop D = TQ’ + T’Q T

How to use T to implement D Flip-Flop TQ+Q Q Q’ DQ+Q T = DQ’ + D’Q Q D01D

How to use T to implement D Flip-Flop T = DQ’ + D’Q D

SR-Flip Flop S RQ Q’ Q Q’ S RQ Q’ Q Q’  RESET  SET  RESET

SR-Flip Flop Asynchronous If S=0 and R=1, Q is set to 1, and Q’ is reset to 0 IF R=0 and S=1, Q is reset to 0, and Q’ is set to 1 If S=1 and R=1, Q and Q’ maintain their previous state If S=0 and R=0, a transition to S=1, R=1 will cause oscillation

Instability RS flip-flops can become unstable if both R and S are set to 0 All sequential elements are fundamentally unstable under certain conditions –Invalid transitions –Transitions too close together –Transitions at the wrong time

Edge and level-triggered Flip Flop Digital circuit often form loops, flip-flops oscillations can Oscillation will not occur because by the time an output change cause an input change, the activating edge of the CK signal will be gone Positive edge triggered – ff responds to a positive going edge of clock Negative edge triggered – responds to a negative-going edge

Positive-edge-triggered D Flip-Flop When CLK=0 the master latch is open and the content of D is transferred to QM When CLK=1 the master is closed and its output is transferred to the slave Master and slave latches are never enabled at the same time