5.3 Sequential Circuits - An Introduction to Informatics - 2008. 11. 3 WMN Lab. Hey-Jin Lee.

Slides:



Advertisements
Similar presentations
Sequential Circuits Storage elements
Advertisements

Give qualifications of instructors: DAP
التصميم المنطقي Second Course
Sequential Circuits1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Computing Machinery Chapter 5: Sequential Circuits.
CS 151 Digital Systems Design Lecture 37 Register Transfer Level
The Map Method Boolean expressions may be simplified by algebraic means as discussed in Previous lecture However, this procedure of minimization is awkward.
Review and Overview. Review  Combinational logic circuit – Decoder, Encoder, Multiplexer, De-multiplexer, Full Adder, Multiplier  Sequential logic circuit.
CSE-221 Digital Logic Design (DLD)
Give qualifications of instructors: DAP
ECE 331 – Digital Systems Design Introduction to Sequential Logic Circuits (aka. Finite State Machines) and FSM Analysis (Lecture #19)
ENGIN112 L26: Shift Registers November 3, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 26 Shift Registers.
Registers and Counters
Unit 12 Registers and Counters Ku-Yaw Chang Assistant Professor, Department of Computer Science and Information Engineering Da-Yeh.
1 Sequential Circuits Registers and Counters. 2 Master Slave Flip Flops.
Introduction to Digital Logic Design Appendix A of CO&A Dr. Farag
Circuit, State Diagram, State Table
Chap 4. Sequential Circuits
SUPLEMENTARY CHAPTER 1: An Introduction to Digital Logic The Architecture of Computer Hardware and Systems Software: An Information Technology Approach.
Registers CPE 49 RMUTI KOTAT.
1 Registers and Counters A register consists of a group of flip-flops and gates that affect their transition. An n-bit register consists of n-bit flip-flops.
Registers and Counters
Digital Logic Design Sequential circuits
Rabie A. Ramadan Lecture 3
Conversion and Coding (12) 10. Conversion and Coding (12) Conversion.
Digital Logic Design Review Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office: Ahmad Almulhem, KFUPM 2010.
Chap 8. Sequencing and Control. 8.1 Introduction Binary information in a digital computer –data manipulated in a datapath with ALUs, registers, multiplexers,
Module 9.  Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates.
CPEN Digital System Design Chapter 5 - Sequential Circuits Sequential Circuit Design C. Gerousis © Logic and Computer Design Fundamentals, 4 rd Ed.,
Chap 5. Registers and Counters. Chap Definition of Register and Counter l a clocked sequential circuit o consist of a group of flip-flops & combinational.
REGISTER A register is a group of flip-flops. Each flip- flop is capable of storing one bit of informa­ tion. An n-bit register consists of a group of.
Computer Science 101 Circuit Design - Examples. Sum of Products Algorithm Identify each row of the output that has a 1. Identify each row of the output.
DLD Lecture 26 Finite State Machine Design Procedure.
Arithmetic Circuits. Half Adder ABSumCarry
DESIGN OF SEQUENTIAL CIRCUITS by Dr. Amin Danial Asham.
CHAPTER 6 Sequential Circuits’ Analysis CHAPTER 6 Sequential Circuits’ Analysis Sichuan University Software College.
Registers; State Machines Analysis Section 7-1 Section 5-4.
Logic Design / Processor and Control Units Tony Diep.
1 State Reduction Goal: reduce the number of states while keeping the external input-output requirements unchanged. State reduction example: a: input 0.
Combinational Circuits
Sequential Circuit Design By : Pn Siti Nor Diana Ismail CHAPTER 6.
A combinational circuit is a connected arrangement of logic gate with a set of input and output.
Introduction to Sequential Logic Design Finite State-Machine Analysis.
Chap 5. Registers and Counters
Sequential Circuit: Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.
Cpe 252: Computer Organization1 Lo’ai Tawalbeh Lecture #3 Flip-Flops, Registers, Shift registers, Counters, Memory 3/3/2005.
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Dr. Shi Dept. of Electrical and Computer Engineering.
Counters and registers Eng.Maha Alqubali. Registers Registers are groups of flip-flops, where each flip- flop is capable of storing one bit of information.
Explain Half Adder and Full Adder with Truth Table.
COMBINATIONAL AND SEQUENTIAL CIRCUITS Guided By: Prof. P. B. Swadas Prepared By: BIRLA VISHVAKARMA MAHAVDYALAYA.
1 Registers A register is a group of n flip-flops each of them capable of storing one bit of information There are two types of registers: parallel and.
1 CHAPTER 12 REGISTERS AND COUNTERS This chapter in the book includes: Objectives Study Guide 12.1Registers and Register Transfers 12.2Shift Registers.
Finite Automata (FA) with Output FA discussed so far, is just associated with R.Es or language. Is there exist an FA which generates an output string corresponding.
Introduction to Sequential Logic Design
Digital Decode & Correction Logic
EKT 221 : Digital 2 Serial Transfers & Microoperations
Digital System Design Review.
Digital Design Fundamentals
Jeremy R. Johnson Mon. Apr. 3, 2000
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN
CSE 370 – Winter Sequential Logic-2 - 1
Number Systems and Circuits for Addition
Lecture 17 Logistics Last lecture Today HW5 due on Wednesday
DESIGN OF SEQUENTIAL CIRCUITS
Overview Part 1 - Registers, Microoperations and Implementations
Digital Logic Department of CNET Chapter-6
Digital Logic Department of CNET Chapter-6
Systems Architecture I
Lecture 17 Logistics Last lecture Today HW5 due on Wednesday
Forward Design by state transition table, and state graph
Presentation transcript:

5.3 Sequential Circuits - An Introduction to Informatics WMN Lab. Hey-Jin Lee

outline Computer Organization Euclid’s Algorithm Sequential Circuits –Shift Registers –Sequential Adder –Counters Sequential Circuit Design 2

Computer Organization s d d d d d Storage Cell Addressing 0000~9999 [ Instruction set ] operand operation code Console Input / Output Arithmetic Unit AC Control Unit IC Figure Computer Organization ….. Storage Unit …… 3

Euclid’s Algorithm Address InstructionRemarks 1.Compute remainder AC ← m AC ← AC – n (r - n) Transfer if ( r – n ) < Transfer back to Add n back in. 2. Test for termination Go to end if r = Store result in r. 3. Replace m by n and n by r AC ← n m ← AC AC ← r n ← AC Return to main loop Halt. Answer is in n. … … … Value of m Value of n Initial value of r Figure 1-23 : The Complete gcd Program 4

Sequential Circuits What is the Sequential Circuits? –Circuit interconnected with combinational circuit and storage elements. –State Machine Storage Elements –Circuit capable of storing binary information representing the state of the sequential circuits. 5 Combinational Circuit n inputm output Storage Element Present states Next states Flip- Flop Clock pulses

Shift registers One important class of sequential circuits. For example Algoric If Shift then begin for i := 0 upto 2 do X[ i ] := X[ i+1 ]; x[3] := 0 end 6 Figure 5-9 : Shift Register FF FF FF FF Shift 1001

Sequential Adder 7 Figure 5-10 : Sequential Adder Block Diagram Figure 5-11 : Sequential Adder Algorithm Augend X, addend Y, and sum Z, the sum Z = X + Y can be obtained with a single one-bit full adder (FA) and a flip-flop to store a carry bit. Figure 5-11 : Sequential Adder Algorithm

Counters This procedure can be generalized to implement ANY finite state machine Counters are a very simple way to start: –no decisions on what state to advance to next current state is the output 8

Sequential Circuit Design Step 1: Making a state table. Step 2: Assigning binary codes to states. at least [ log 2 n ] digits  at least [ log 2 n ] flip-flops. Step 3: Finding flip-flop input values. Step 4: Find simplified equations for the flip-flop inputs and the outputs. Step 5: Build the circuit! For example  Recognizing a String of three One’s 9

Sequential Circuit Design Step 1: Making a state table. Input string : Output : input/output present state next state Step 1: Making a state table. Input string : Output : Figure 5-16 State Transition Graph Present StateInput Next StateOutput Start0 0 1One0 1Two0 1Start1 0 0 Two0Start0 Not used0X0 0x0

Sequential Circuit Design Step 2: Assigning binary codes to states. 11 State Transition Table

Sequential Circuit Design Step 3: Finding flip-flop input values. Use D flip-flop –You can just use the Next State columns 12

Sequential Circuit Design Step 4: Find simplified equations for the flip-flop inputs and the outputs. D A = A’ B I D A = B I D B = A’ B’ I O = A B’ I O=A B’ I + A B I =A I 13

Sequential Circuit Design Step 5: Build the circuit! D A = A’ B I D A = B I D B = A’ B’ I O = A B’ I O = A B’ I + A B I = A I 14 Figure 5-18 Recognizing Strings of Three One’s

Q & A 15 Thank you.