B.Tech CSE Sem. 3 15CS202 DIGITAL SYSTEM DESIGN (Regulations 2015) UNIT -IV

Similar documents
Chapter 5: Synchronous Sequential Logic

Part II. Chapter2: Synchronous Sequential Logic

Sequential Logic Circuits

Synchronous Sequential Logic. Chapter 5

UNIT III. Combinational Circuit- Block Diagram. Sequential Circuit- Block Diagram

Sequential Circuits. Output depends only and immediately on the inputs Have no memory (dependence on past values of the inputs)

Synchronous Sequential Logic

Synchronous Sequential Logic

Digital Logic Design I

Chapter. Synchronous Sequential Circuits

Digital Logic Design Sequential Circuits. Dr. Basem ElHalawany

Digital Design, Kyung Hee Univ. Chapter 5. Synchronous Sequential Logic

Unit 11. Latches and Flip-Flops

Synchronous Sequential Logic

MC9211 Computer Organization

Other Flip-Flops. Lecture 27 1

Chapter 5 Synchronous Sequential Logic

Chapter 8 Sequential Circuits

NH 67, Karur Trichy Highways, Puliyur C.F, Karur District UNIT-III SEQUENTIAL CIRCUITS

Lecture 11: Synchronous Sequential Logic

D Latch (Transparent Latch)

CHAPTER 4: Logic Circuits

CHAPTER 4: Logic Circuits

CSE Latches and Flip-flops Dr. Izadi. NOR gate property: A B Z Cross coupled NOR gates: S M S R Q M

Chapter 5 Synchronous Sequential Logic

CS T34-DIGITAL SYSTEM DESIGN Y2/S3

Chapter 5. Introduction

ELCT201: DIGITAL LOGIC DESIGN

Synchronous Sequential Logic

ELE2120 Digital Circuits and Systems. Tutorial Note 7

CHAPTER1: Digital Logic Circuits

ELCT201: DIGITAL LOGIC DESIGN

Synchronous Sequential Logic

NH 67, Karur Trichy Highways, Puliyur C.F, Karur District DEPARTMENT OF INFORMATION TECHNOLOGY CS 2202 DIGITAL PRINCIPLES AND SYSTEM DESIGN

`COEN 312 DIGITAL SYSTEMS DESIGN - LECTURE NOTES Concordia University

Chapter 5 Sequential Circuits

The word digital implies information in computers is represented by variables that take a limited number of discrete values.

Logic and Computer Design Fundamentals. Chapter 7. Registers and Counters

Combinational / Sequential Logic

Flip-Flops. Because of this the state of the latch may keep changing in circuits with feedback as long as the clock pulse remains active.

Logic Design. Flip Flops, Registers and Counters

ELCT201: DIGITAL LOGIC DESIGN

Experiment 8 Introduction to Latches and Flip-Flops and registers

Chapter 6. Flip-Flops and Simple Flip-Flop Applications

Chapter 5 Sequential Circuits

Analysis of Clocked Sequential Circuits

COE 202: Digital Logic Design Sequential Circuits Part 1. Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:

Vignana Bharathi Institute of Technology UNIT 4 DLD

ECE 341. Lecture # 2

Introduction to Sequential Circuits

Chapter 5 Synchronous Sequential Logic

Lecture 12. Amirali Baniasadi

MODULE 3. Combinational & Sequential logic

Sequential Digital Design. Laboratory Manual. Experiment #3. Flip Flop Storage Elements

EMT 125 Digital Electronic Principles I CHAPTER 6 : FLIP-FLOP

RS flip-flop using NOR gate

EE292: Fundamentals of ECE

Combinational vs Sequential

Flip-Flops and Sequential Circuit Design

Digital Circuit And Logic Design I. Lecture 8

Digital Circuit And Logic Design I

Chapter 4. Logic Design

The reduction in the number of flip-flops in a sequential circuit is referred to as the state-reduction problem.

Department of CSIT. Class: B.SC Semester: II Year: 2013 Paper Title: Introduction to logics of Computer Max Marks: 30

ELE2120 Digital Circuits and Systems. Tutorial Note 8

LAB 7. Latches & Flip Flops

Chapter 3 Unit Combinational

Figure 30.1a Timing diagram of the divide by 60 minutes/seconds counter

Module -5 Sequential Logic Design

Final Exam review: chapter 4 and 5. Supplement 3 and 4

1. Convert the decimal number to binary, octal, and hexadecimal.

ECE 25 Introduction to Digital Design. Chapter 5 Sequential Circuits ( ) Part 1 Storage Elements and Sequential Circuit Analysis

Course Administration

Registers and Counters

(CSC-3501) Lecture 7 (07 Feb 2008) Seung-Jong Park (Jay) CSC S.J. Park. Announcement

YEDITEPE UNIVERSITY DEPARTMENT OF COMPUTER ENGINEERING. EXPERIMENT VIII: FLIP-FLOPS, COUNTERS 2014 Fall

LAB #4 SEQUENTIAL LOGIC CIRCUIT

Digital Logic Design ENEE x. Lecture 19


UNIT IV. Sequential circuit

Problems with D-Latch

2 Sequential Circuits

RS flip-flop using NOR gate

CS302 - Digital Logic Design FAQs By

MODU LE DAY. Class-A, B, AB and C amplifiers - basic concepts, power, efficiency Basic concepts of Feedback and Oscillation. Day 1

To design a sequential logic circuit using D-Flip-flop. To implement the designed circuit.

Solution to Digital Logic )What is the magnitude comparator? Design a logic circuit for 4 bit magnitude comparator and explain it,

Engr354: Digital Logic Circuits


CS8803: Advanced Digital Design for Embedded Hardware

Sequential Logic. E&CE 223 Digital Circuits and Systems (A. Kennings) Page 1

DIGITAL SYSTEM FUNDAMENTALS (ECE421) DIGITAL ELECTRONICS FUNDAMENTAL (ECE422) COUNTERS

Asynchronous (Ripple) Counters

Logic Design II (17.342) Spring Lecture Outline

Sequential Logic and Clocked Circuits

11.1 As mentioned in Experiment 10, sequential logic circuits are a type of logic circuit where the output

Registers and Counters

DIGITAL CIRCUIT LOGIC UNIT 11: SEQUENTIAL CIRCUITS (LATCHES AND FLIP-FLOPS)

Chapter 3. Boolean Algebra and Digital Logic

EKT 121/4 ELEKTRONIK DIGIT 1

Transcription:

B.Tech CSE Sem. 3 5CS22 DIGITAL SYSTEM DESIGN (Regulations 25) UNIT -IV

SYNCHRONOUS SEQUENTIAL CIRCUITS OUTLINE FlipFlops SR,D,JK,T Analysis of Synchronous Sequential Circuit State Reduction and Assignment Design-Sequence Detector BCD Counter Registers-Shift Register Analysis

Sequential Circuits Every digital system is likely to have combinational circuits, most systems encountered in practice also include storage elements, which require that the system be described in term of sequential logic. 3

Synchronous Clocked Sequential Circuit A sequential circuit may use many flip-flops to store as many bits as necessary. The outputs can come either from the combinational circuit or from the flip-flops or both. 4

Latches --SR Latch The SR latch is a circuit with two cross-coupled NOR gates or two cross-coupled NAND gates. It has two inputs labeled S for set and R for reset. 5

SR Latch with NAND Gates 6

SR Latch with Control Input The operation of the basic SR latch can be modified by providing an additional control input that determines when the state of the latch can be changed. In Fig. 5-5, it consists of the basic SR latch and two additional NAND gates. 7

D Latch One way to eliminate the undesirable condition of the indeterminate state in SR latch is to ensure that inputs S and R are never equal to at the same time in Fig 5-5. This is done in the D latch. 8

Graphic Symbols for latches A latch is designated by a rectangular block with inputs on the left and outputs on the right. One output designates the normal output, and the other designates the complement output. 9

Flip-Flops The state of a latch or flip-flop is switched by a change in the control input. This momentary change is called a trigger and the transition it cause is said to trigger the flip-flop. The D latch with pulses in its control input is essentially a flip-flop that is triggered every time the pulse goes to the logic level. As long as the pulse input remains in the level, any changes in the data input will change the output and the state of the latch.

Clock Response in Latch In Fig (a) a positive level response in the control input allows changes, in the output when the D input changes while the clock pulse stays at logic.

Clock Response in Flip-Flop 2

Edge-Triggered D Flip-Flop The first latch is called the master and the second the slave. The circuit samples the D input and changes its output Q only at the negative-edge of the controlling clock. D Y Q CLK?. 3

D-Type Positive-Edge-Triggered Flip- Flop Another more efficient construction of an edge-triggered D flip-flop uses three SR latches. Two latches respond to the external D(data) and CLK(clock) inputs. The third latch provides the outputs for the flip-flop. 4

Graphic Symbol for Edge- Triggered D Flip-Flop 5

Other Flip-Flops -JK Flip-Flop There are three operations that can be performed with a flip-flop: set it to, reset it to, or complement its output. The JK flip-flop performs all three operations. The circuit diagram of a JK flip-flop constructed with a D flip-flop and gates. 6

JK Flip-Flop The J input sets the flip-flop to, the K input resets it to, and when both inputs are enabled, the output is complemented. This can be verified by investigating the circuit applied to the D input: D = J Q` + K` Q 7

T Flip-Flop The T(toggle) flip-flop is a complementing flip-flop and can be obtained from a JK flip-flop when inputs J and K are tied together. 8

T Flip-Flop The T flip-flop can be constructed with a D flip-flop and an exclusive-or gates as shown in Fig. (b). The expression for the D input is D = T Q = TQ` + T`Q 9

Characteristic Equations D flip-flop Characteristic Equations Q(t + ) = D JK flip-flop Characteristic Equations Q(t + ) = JQ` + K`Q T flip-flop Characteristic Equations Q(t + ) = T Q = TQ` + T`Q 2

Direct Inputs Some flip-flops have asynchronous inputs that are used to force the flip-flop to a particular state independent of the clock. The input that sets the flip-flop to is called present or direct set. The input that clears the flip-flop to is called clear or direct reset. When power is turned on a digital system, the state of the flip-flops is unknown. The direct inputs are useful for bringing all flip-flops in the system to a known starting state prior to the clocked operation. 2

D Flip-Flop with Asynchronous Reset A positive-edge-triggered D flip-flop with asynchronous reset is shown in Fig(a). 22

D Flip-Flop with Asynchronous Reset 23

Analysis of Clocked Sequential Circuits The analysis of a sequential circuit consists of obtaining a table or a diagram for the time sequence of inputs, outputs, and internal states. It is also possible to write Boolean expressions that describe the behavior of the sequential circuit. These expressions must include the necessary time sequence, either directly or indirectly. 24

Example of Sequential Circuit 25

State Equation A(t+) = A(t) x(t) + B(t) x(t) B(t+) = A`(t) x(t) A state equation is an algebraic expression that specifies the condition for a flip-flop state transition. The left side of the equation with (t+) denotes the next state of the flipflop one clock edge later. The right side of the equation is Boolean expression that specifies the present state and input conditions that make the next state equal to. Y(t) = (A(t) + B(t)) x(t)` 26

State Equations The behavior of a clocked sequential circuit can be described algebraically by means of state equations. A state equation specifies the next state as a function of the present state and inputs. Consider the sequential circuit shown in Fig. 5-5. It consists of two D flip-flops A and B, an input x and an output y. 27

State Table The time sequence of inputs, outputs, and flip-flop states can be enumerated in a state table (sometimes called transition table). 28

State Diagram The information available in a state table can be represented graphically in the form of a state diagram. In this type of diagram, a state is represented by a circle, and the transitions between states are indicated by directed lines connecting the circles. / : means input = output= 29

Flip-Flop Input Equations The part of the combinational circuit that generates external outputs is descirbed algebraically by a set of Boolean functions called output equations. The part of the circuit that generates the inputs to flip-flops is described algebraically by a set of Boolean functions called flip-flop input equations. The sequential circuit of Fig. 5-5 consists of two D flip-flops A and B, an input x, and an output y. The logic diagram of the circuit can be expressed algebraically with two flip-flop input equations and an output equation: DA = Ax + Bx DB = A`x y = (A + B)x` 3

Analysis with D Flip-Flop The circuit we want to analyze is described by the input equation DA = A x y The DA symbol implies a D flip-flop with output A. The x and y variables are the inputs to the circuit. No output equations are given, so the output is implied to come from the output of the flip-flop. 3

Analysis with D Flip-Flop The binary numbers under Axy are listed from through as shown in Fig. 5-7(b). The next state values are obtained from the state equation A(t+) = A x y The state diagram consists of two circles-one for each state as shown in Fig. 5-7(c) 32

Analysis with JK Flip-Flops 33

Analysis with JK Flip-Flop The circuit can be specified by the flip-flop input equations JA = B KA = Bx` JB = x` KB = A`x + Ax` = A x 34

Analysis with JK Flip-Flops A(t + ) = JA` + K`A B(t + ) = JB` + K`B Substituting the values of JA and KA from the input equations, we obtain the state equation for A: A(t + ) = BA` + (Bx`)`A = A`B + AB` +Ax The state equation provides the bit values for the column under next state of A in the state table. Similarly, the state equation for flip-flop B can be derived from the characteristic equation by substituting the values of JB and KB: B(t + ) = x`b` + (A x)`b = B`x` + ABx + A`Bx` 35

Analysis with JK Flip-Flops The state diagram of the sequential circuit is shown in Fig 36

Analysis With T Flip-Flops Characteristic equation Q(t + ) = T Q = T`Q + TQ` / : means state is output is 37

Analysis With T Flip-Flops Consider the sequential circuit shown in Fig. 5-2. It has two flip-flops A and B, one input x, and one output y. It can be described algebraically by two input equations and an output equation: TA = Bx TB = x y = AB A(t+)=(Bx) A+(Bx)A =AB +Ax +A Bx B(t+)=x B Use present state as inputs 38

Synthesis Using T Flip-Flops 39

State Reduction and Assignment

State Reduction and Assignment (Contd.)

State Reduction and Assignment (Contd.)

State Reduction and Assignment (Contd.)

State Reduction and Assignment (Contd.) State Assignment State a b c d e Binary Gray CodeOne-Hot

State Reduction and Assignment (Contd.) Reduced State Table: Binary State Assignment State Next State x= x= Output x= x=

State Reduction and Assignment (Contd.) State Reduced State Table: Binary State Assignment Next State x= x= Output x= x=

Design Procedure Develop State Diagram From Specs Reduce States Assign Binary values to States Write Binary-coded State Table Choose Flip-Flops Derive Input and Output Equations Draw the Logic Diagram

Develop State Diagram: Sequence Detector Detect 3 or more s in sequence (a Moore Model)

D Flip-Flop Input Equations State A B Input equations come directly from the next state in D Flip-Flop design Input x Next State A B A(t+) = D A (A,B,x) = (3,5,7) B(t+) = D B (A,B,x) = (,5,7) y(a,b,x) = (6,7) Output y

Simplified Boolean Equations

Sequence Detector: D Flip-Flops

Using JK or T Flip-Flops. Develop Excitation Table Using Excitation Tables JK Flip-Flop T Flip-Flop Q(t) Q(t+) J K Q(t) Q(t+) T X X X X

State Table: JK Flip-Flop Inputs B A Present State x Input B A Next State K A J A K B J B Flip-Flop Inputs

Maps for J and K Input Equations

JK Flip-Flop Sequence Detector

Registers and Counter The filp-flops are essential component in clocked sequential circuits. Circuits that include filp-flops are usually classified by the function they perform. Two such circuits are registers and counters. An n-bit register consists of a group of n flip-flops capable of storing n bits of binary information. 56

UP-DOWN COUNTER

BCD Counter Because of the return to after a count of 9, a BCD counter does not have a regular pattern as in a straight binary count. To derive the circuit of a BCD synchronous counter, it is necessary to go through a sequential circuit design procedure. 58

BCD Counter State Table for BCD Counter Present State Next State Output Flip-Flop inputs Q8 Q4 Q2 Q Q8 Q4 Q2 Q Y TQ8 TQ4 TQ2 TQ 59

BCD COUNTER

BCD Counter The flip flop input equations can be simplified by means of maps. The simplified functions are T Q = T Q2 =Q 8 Q T Q4 =Q 2 Q T Q8 =Q 8 Q +Q 4 Q 2 Q y=q 8 Q The circuit can be easily drawn with four T flipflops, five AND gates, and one OR gate. 6

An Example of Counter

Registers In its broadest definition, a register consists a group of flip-flops and gates that effect their transition. The flip-flops hold the binary information. The gates determine how the information is transferred into the register. Counters are a special type of register. A counter goes through a predetermined sequence of states. 63

Registers Fig 6- shows a register constructed with four D- type filpflops. Clock triggers all flipfolps on the positive edge of each pulse. Clear is useful for clearing the register to all s prior to its clocked operation. 64

Shift Registers 65

Shift Registers A register capable of shifting its binary information in one or both direction is called a shift register. All flip-flops receive common clock pulses, which activate the shift from one stage to the next. The simplest possible shift register is one that uses only flip-flops, as shown in Fig. 6-3. 66

THANK YOU