Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP 2610 1.

Slides:

Advertisements

Similar presentations

Sequential Logic Circuits. Set-Reset Latch The Set-Reset latch or bistable is a simple sequential logic circuit that remembers what has happened to the.

Advertisements

IN2305-II Embedded Programming Lecture 2: Digital Logic.

TOPIC : Finite State Machine(FSM) and Flow Tables UNIT 1 : Modeling Module 1.4 : Modeling Sequential circuits.

Give qualifications of instructors: DAP

Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP

CS 151 Digital Systems Design Lecture 19 Sequential Circuits: Latches.

Sequential Circuits1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.

SYEN 3330 Digital SystemsJung H. Kim 1 SYEN 3330 Digital Systems Chapter 6 – Part 1.

CPEN Digital System Design Chapter 5 Sequential Circuits Storage Elements and Sequential Circuit Analysis C. Gerousis © Logic and Computer Design.

Logical Circuit Design Week 11: Sequential Logic Circuits Mentor Hamiti, MSc Office ,

Circuits require memory to store intermediate data

Chapter 3 Digital Logic Structures

Chapter 3 Digital Logic Structures. 3-2 Transistor: Building Block of Computers Microprocessors contain millions of transistors Intel Pentium 4 (2000):

Sequential circuit Digital electronics is classified into combinational logic and sequential logic. In combinational circuit outpus depends only on present.

Logic Circuits Another look at Floating Point Numbers Common Combinational Logic Circuits Timing Sequential Circuits Note: Multiplication & Division in.

Overview Finite State Machines - Sequential circuits with inputs and outputs State Diagrams - An abstraction tool to visualize and analyze sequential circuits.

Midterm Wednesday Chapter 1-3: Number /character representation and conversion Number arithmetic Combinational logic elements and design (DeMorgan’s Law)

Overview Finite State Machines - Sequential circuits with inputs and outputs State Diagrams - An abstraction tool to visualize and analyze sequential circuits.

State Machines Timing Computer Bus Computer Performance Instruction Set Architectures RISC / CISC Machines.

Seqeuential Logic State Machines Memory

State Machines Used to Design Sequential Circuits.

Overview Finite State Machines

Chapter #6: Sequential Logic Design 6.2 Timing Methodologies

Midterm Wednesday Chapter 1-3: Number /character representation and conversion Number arithmetic CMOS logic elements Combinational logic elements and design.

ECE/CS 352 Digital System Fundamentals© T. Kaminski & C. Kime 1 ECE/CS 352 Digital Systems Fundamentals Spring 2001 Chapter 4 – Part 3 Tom Kaminski & Charles.

Lecture 10 Topics: Sequential circuits Basic concepts Clocks

Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Building Functions.

Introduction to Computing Systems from bits & gates to C & beyond Chapter 3 Digital Logic Structures Transistors Logic gates & Boolean logic Combinational.

©Brooks/Cole, 2003 Foundations of Computer Science from Data Manipulation to Theory of Computation Behrouz A. Forouzan, Brooks/Cole — Thomson Learning,

Digital Components and Combinational Circuits Sachin Kharady.

Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Basic Logic Gates.

Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Combinational vs.

Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP

Introduction to Computer Engineering ECE/CS 252, Fall 2010 Prof. Mikko Lipasti Department of Electrical and Computer Engineering University of Wisconsin.

Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP

Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits II.

Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Complete Example.

Chapter 3 Digital Logic Structures. 3-2 Combinational vs. Sequential Combinational Circuit always gives the same output for a given set of inputs  ex:

PART 3 Digital Logic 1.Logic Gates 2.Logic Circuits 3.Memory 4.Sequential Circuits 5.LC-3 Data Path.

1 ENGG 1203 Tutorial Combinational Logic (II) and Sequential Logic (I) 8 Feb Learning Objectives  Apply Karnaugh map for logic simplification  Design.

The von Neumann Model – Chapter 4 COMP 2620 Dr. James Money COMP

Introduction to Computer Engineering CS/ECE 252, Fall 2007 Prof. David A. Wood Computer Sciences Department University of Wisconsin – Madison.

Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP

Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Transistor: Building.

Chapter 5 Computer Systems Organization. Levels of Abstraction – Figure 5.1e The Concept of Abstraction.

SYEN 3330 Digital SystemsJung H. Kim 1 SYEN 3330 Digital Systems Chapter 6 – Part 4.

CS151 Introduction to Digital Design Chapter 5: Sequential Circuits 5-1 : Sequential Circuit Definition 5-2: Latches 1Created by: Ms.Amany AlSaleh.

TOPIC : Introduction to Sequential Circuits UNIT 1: Modeling and Simulation Module 4 : Modeling Sequential Circuits.

Govt. Engineering College- Gandhinagar. It is all about……  STATE MACHINE.

Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP

Computer Science 210 Computer Organization

Class Exercise 1B.

Instructor：Po-Yu Kuo 教師：郭柏佑

Computer Science 210 Computer Organization

Computer Science 210 Computer Organization

Jeremy R. Johnson Mon. Apr. 3, 2000

Computer Science 210 Computer Organization

Computer Science 210 Computer Organization

Digital Logic Structures Logic gates & Boolean logic

Lecture No. 24 Sequential Logic.

CS341 Digital Logic and Computer Organization F2003

Chapter 6 – Part 4 SYEN 3330 Digital Systems SYEN 3330 Digital Systems

Instructor：Po-Yu Kuo 教師：郭柏佑

Lecture 17 Logistics Last lecture Today HW5 due on Wednesday

Combinational Circuits

SYEN 3330 Digital Systems Chapter 6 – Part 3 SYEN 3330 Digital Systems.

Systems Architecture I

Reference: Moris Mano 4th Edition Chapter 5

Lecture 17 Logistics Last lecture Today HW5 due on Wednesday

Logic Gates By: Asst Lec. Besma Nazar Nadhem

Presentation transcript:

Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP

Sequential Logic Circuits So far we’ve discussed logic structures that depend solely on the input at the moment These are called combination logic circuits There is no capacity to store information from prior values

Sequential Logic Circuits We also discussed logic circuits that would store information These included Gated D latches, registers, and memory We want to now to discuss logic structures that both process and store information

Sequential Logic Circuits These types of circuits base their decision on the current inputs values and what has happened before These are called sequential logic circuits These are used to implement finite state machines

Sequential Logic Circuits State Machine Combinational Logic Circuit Storage Elements InputsOutputs

Combination Lock A simple example of these types of structures is a combination lock Suppose we wish to lock a bike, but do not want to require a physical key A typical approach is to use a combination of numbers

Combination Lock Two types of “combination” locks Combinational Success depends only on the values, not the order in which they are set. Sequential Success depends on the sequence of values (e.g, R-13, L-22, R-3).

Concept of State For a sequential lock to work properly, we need to keep track of sequence of rotations We have to track the correct sequence versus all the other incorrect ones R13-L22-R3 opens, but R13-L29-R3 does not

Concept of State There are several situations we identify: – (A) The lock is not open and NO operations have been performed – (B) The lock is not open, but the user has completed the R13 operation – (C) The lock is not open, but the user has completed R13 followed by L22 – (D) The lock is open

Concept of State We refer to A-D as the state of the lock This notion of state is important in computer engineering The state of the system is a snapshot of that system at a given point in time

Concept of State In our case, there are four states : A-D Is there a fifth state? No!

State Diagram