Some Useful Circuits Lecture for CPSC 5155 Edward Bosworth, Ph.D. Computer Science Department Columbus State University.

Slides:



Advertisements
Similar presentations
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Chapter 7 – Registers.
Advertisements

Latches/Flip-Flops. Overview We focuses on sequential circuits – We add memory to the hardware that we’ve already seen Our schedule will be very similar.
Give qualifications of instructors: DAP
COE 202: Digital Logic Design Sequential Circuits Part 1 Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office: Ahmad Almulhem, KFUPM.
Computer Science 210 Computer Organization Clocks and Memory Elements.
A. Abhari CPS2131 Sequential Circuits Most digital systems like digital watches, digital phones, digital computers, digital traffic light controllers and.
Digital Logic Design ESGD2201
Flip-Flops Computer Organization I 1 June 2010 © McQuain, Feng & Ribbens A clock is a free-running signal with a cycle time. A clock may be.
CS 151 Digital Systems Design Lecture 19 Sequential Circuits: Latches.
Classification of Digital Circuits  Combinational. Output depends only on current input values.  Sequential. Output depends on current input values and.
1 Kuliah Rangkaian Digital Kuliah 8: Rangkaian Logika Sekuensial Teknik Komputer Universitas Gunadarma.
Sequential Circuits1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Introduction to Sequential Logic Design Bistable elements Latches.
1 Sequential Circuits –Digital circuits that use memory elements as part of their operation –Characterized by feedback path –Outputs depend not only on.
1 Lecture 20 Sequential Circuits: Latches. 2 Overview °Circuits require memory to store intermediate data °Sequential circuits use a periodic signal to.
October 16, 2002Flip-flops1 Summary : Latches A sequential circuit has memory. It may respond differently to the same inputs, depending on its current.
Asynchronous Sequential Logic
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.
1 © 2014 B. Wilkinson Modification date: Dec Sequential Logic Circuits – I Flip-Flops A sequential circuit is a logic components whose outputs.
Flip-Flops Last time, we saw how latches can be used as memory in a circuit. Latches introduce new problems: We need to know when to enable a latch. We.
EECC341 - Shaaban #1 Lec # 13 Winter Sequential Logic Circuits Unlike combinational logic circuits, the output of sequential logic circuits.
Chapter 4 Gates and Circuits.
Logic and Computer Design Fundamentals Registers and Counters
More Basics of CPU Design Lecture for CPSC 5155 Edward Bosworth, Ph.D. Computer Science Department Columbus State University.
Digital Logic Design CHAPTER 5 Sequential Logic. 2 Sequential Circuits Combinational circuits – The outputs are entirely dependent on the current inputs.
Sequential Circuits Chapter 4 S. Dandamudi To be used with S. Dandamudi, “Fundamentals of Computer Organization and Design,” Springer,  S.
ETE Digital Electronics Latches and Flip-Flops [Lecture:12] Instructor: Sajib Roy Lecturer, ETE, ULAB.
Lecture 10 Topics: Sequential circuits Basic concepts Clocks
Digital Computer Design Fundamental
Introduction to Digital Logic Design Appendix A of CO&A Dr. Farag
COE 202: Digital Logic Design Sequential Circuits Part 1
EE2174: Digital Logic and Lab Professor Shiyan Hu Department of Electrical and Computer Engineering Michigan Technological University CHAPTER 9 Sequential.
Rabie A. Ramadan Lecture 3
School of Computer Science G51CSA 1 Computer Systems Architecture Fundamentals Of Digital Logic.
1 DIGITAL ELECTRONICS. 2 OVERVIEW –electronic circuits capable of carrying out logical (boolean) and arithmetic operations on information stored as binary.
1 Boolean Algebra & Logic Gates. 2 Objectives Understand the relationship between Boolean logic and digital computer circuits. Learn how to design simple.
Digital Logic Design Review Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office: Ahmad Almulhem, KFUPM 2010.
Chap 4. Sequential Circuits
ENG241 Digital Design Week #6 Sequential Circuits (Part A)
Unit 11 Latches and Flip-Flops Fundamentals of Logic Design By Roth and Kinney.
 Counters are sequential circuits which "count" through a specific state sequence. They can count up, count down, or count through other fixed sequences.
Sequential Design Basics. Lecture 2 topics  A review of devices that hold state A review of Latches A review of Flip-Flops 8/22/2012 – ECE 3561 Lect.
מבנה מחשב תרגול 2. 2 Boolean AND Operation Truth Table Equivalent Gate Different notations:
Computer Architecture and Organization Unit -1. Digital Logic Circuits – Logic Gates – Boolean Algebra – Map Simplification – Combinational Circuits –
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.
Sequential Logic Computer Organization II 1 © McQuain A clock is a free-running signal with a cycle time. A clock may be either high or.
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.
CO5023 Latches, Flip-Flops and Decoders. Sequential Circuit What does this do? The OUTPUT of a sequential circuit is determined by the current output.
How does the CPU work? CPU’s program counter (PC) register has address i of the first instruction Control circuits “fetch” the contents of the location.
Chapter5: Synchronous Sequential Logic – Part 1
CS151 Introduction to Digital Design Chapter 5: Sequential Circuits 5-1 : Sequential Circuit Definition 5-2: Latches 1Created by: Ms.Amany AlSaleh.
COMBINATIONAL AND SEQUENTIAL CIRCUITS Guided By: Prof. P. B. Swadas Prepared By: BIRLA VISHVAKARMA MAHAVDYALAYA.
Chapter 3 Boolean Algebra and Digital Logic T103: Computer architecture, logic and information processing.
1 CS 352 Introduction to Logic Design Lecture 6 Ahmed Ezzat Latches, Flip/Flops, Registers, and Counters Ch-11 + Ch-12.
Introduction to Computer Science Robert Sedgewick and Kevin Wayne Copyright © Recap: Combinational Circuits Please.
Memory Elements. Outline  Introduction  Memory elements.
Sequential logic circuits First Class 1Dr. AMMAR ABDUL-HAMED KHADER.
Clocks A clock is a free-running signal with a cycle time.
Lecture 8 Dr. Nermi Hamza.
Overview Introduction Logic Gates Flip Flops Registers Counters
ECE Digital logic Lecture 16: Synchronous Sequential Logic
Basics Combinational Circuits Sequential Circuits Ahmad Jawdat
How does the CPU work? CPU’s program counter (PC) register has address i of the first instruction Control circuits “fetch” the contents of the location.
触发器 Flip-Flops 刘鹏 浙江大学信息与电子工程学院 March 27, 2018
CSE 370 – Winter Sequential Logic - 1
Synchronous sequential
Synchronous Sequential
Presentation transcript:

Some Useful Circuits Lecture for CPSC 5155 Edward Bosworth, Ph.D. Computer Science Department Columbus State University

Outline of the Lecture 1.The basic Boolean circuits: NOT, AND, OR, and XOR (exclusive OR) 2.Another useful gate: the tri-state buffer. 3.A few interesting combinational circuits, including multiplexers and decoders. 4.Basics of flip-flops.

The NOT Gate This implements the Boolean NOT function. NOT(0) = 1 and NOT(1) = 0. This is often denoted as f(X) = X’, as the apostrophe is easier for word processors.

The Logical AND Gate This is a function of two Boolean variables. We denote the logical AND of two Boolean variables X and Y by “X  Y”. Some logic books denote logical AND as “X  Y”. For multiple-input AND, if any input is 0 the output is 0.

The Logical OR Gate This is a function of two Boolean variables. We denote the logical OR of two Boolean variables X and Y by “X + Y”. Some logic books denote logical OR as “X  Y”. For multiple-input OR, if any input is 1, the output is 1.

Exclusive OR: XOR This is a function of two Boolean variables. We denote the logical XOR of two Boolean variables X and Y by “X  Y”. Most logic books seem to ignore this function.

NAND and NOR The top gate shows the NOR gate and its logical equivalent. The bottom line shows the NAND gate and its logical equivalent.

The Non-Inverting Buffer The non-inverting buffer is logically equivalent to two NOT gates in a row. It serves as a “voltage adjuster”. If the input is logic 1 (2.8 to 5.0 volts), the output will be exactly 5.0 volts.

The Tri-State Buffer Consider an enabled–high tri–state buffer, with the enable signal called “C”. When C = 1, the buffer is enabled. When C = 0, the buffer is not enabled. What does the buffer do?

Sample Use of Tri-State Buffers Here is a circuit that uses a pair of tri–state buffers to connect exactly one of two inputs to an output. This is equivalent to the following:

Decoders Decoders are typically N–to–2 N devices. Typical examples include 2–to–4 decoders, 3–to–8 decoders, and 4–to–16 decoders Due to the prevalence of decimal arithmetic, we also have 4–to–10 decoders. These are specialized 4–to–16 decoders with 6 fewer pins. The input is viewed as a binary code, specifying which of the outputs is selected.

Circuit for a 3–to–8 Active-High Decoder

The Enable Input Again, in the above circuit one output will always be active. Suppose we want to have a decoder with no outputs active. We use an enable input, often denoted as “E”.

Multiplexers and Demultiplexers Multiplexer – MUX Associates One of Many Inputs to a Single Output Demultiplexer – DEMUX Associates One Input with One of Many Outputs Circuit InputsControlOutputs Signals Multiplexer2 N N 1 Demultiplexer1 N 2 N

4–to–1 MUX and 1–to–4 DEMUX

Build a 4–to–1 MUX

Gate Delays The output of a circuit element does not change instantaneously with the input, but only after a delay time during which the circuit processes the signal. This delay interval, called “gate delay” is about 10 nanoseconds for most simple TTL circuits and about 25 nanoseconds for TTL Flip–Flops. The simplest example is the NOT gate.

The Pulse Generator Here is the circuit Here is a time plot of the circuit’s behavior.

Sequential Circuits Sequential circuits are those with memory, also called “feedback”. In this, they differ from combinational circuits, which have no memory. The stable output of a combinational circuit does not depend on the order in which its inputs are changed. The stable output of a sequential circuit usually does depend on the order in which the inputs are changed. We usually focus on clocked sequential circuits, in which the circuit changes state at fixed times in a clock cycle. Clocked circuits are easier to design and understand. All sequential circuits depend on a phenomenon called gate delay. This reflects the fact that the output of any logic gate (implementing a Boolean function) does not change immediately when the input changes, but only some time later.

The System Clock There are a number of ways to view the system clock. In general, the view depends on the detail that we need in discussing the problem. The logical view is shown in the next figure, which illustrates some of the terms commonly used for a clock.

Views of the System Clock

Latches and Flip–Flops: First Definition We consider a latch or a flip–flop as a device that stores a single binary value. Flip–flops and clocked latches are devices that accept input at fixed times dictated by the system clock. For this reason they are called “synchronous sequential circuits”. Denote the present time by the symbol t. Denote the clock period by . Rather than directly discussing the clock period, we merely say thatthe current time is t after the next clock tick the time is (t + 1) The present state of the device is often called Q(t) The next state of the device is often called Q(t + 1)

Latches and Flip–Flops: When Triggered Clocked latches accept input when the system clock is at logic high. Flip–flops accept input on either edge of the system clock. Here we show the rising edge.

A NOR Gate with Feedback We consider yet another circuit that is based on gate delays. This is based on the NOR gate, which is an OR gate followed by a NOT gate. The important thing to note is can be expressed in two equations.

A NOR Gate with Feedback (Part 2) Consider the following circuit. When X = 1, Z = 0, and Y = 0. It is stable. Just after X becomes 0, we still have Z = 0 and Y = 0 due to gate delays. But NOR(0, 0) = 1, so after one gate delay, we have Z = 1 and Y = 1. But NOR(0, 1) = 0, so after another gate delay, we have Z = 0.

Cross–Coupled NOR Gates: The SR Latch The two inputs to the top NOR gate are 0 and Q. But so this part of the circuit is stable. The two inputs to the bottom NOR gate are 0 and. This circuit is stable for S = 0 and R = 0.

The SR Latch S = 1, R = 0 (Step 1) Let the above be in either state (Q = 0 or Q = 1) and change the external input. At first, the output does not change (remember the gate delays).

The SR Latch S = 1, R = 0 (Step 2) After one gate delay, the output of the top NOR gate changes to 0. This holds for any value of Q, either 0 or 1.

The SR Latch S = 1, R = 0 (Step 3) The inputs to the bottom NOR gate are now 0 and 0. After another gate delay it changes. This situation is stable.

The SR Latch S = 0, R = 1 We can trace the sequence for S = 0 and R = 1. Again, what happens does not depend on the present state, denoted by Q. Here is the final stable state

What about S = 1 and R = 1? Remember that if one input of a NOR gate is logic 1, its output is logic 0. Specifically for any value of Q, we have: What we have is logical nonsense. It is stable.

The SR Characteristic Table The response of any flip-flop is described by a table called the “characteristic table”. There is another table, called the “excitation table” that is useful for digital design. SRNext State 00Present State ERROR

The Clocked SR Latch Clocked latches are sometimes called “level triggered flip–flops”. This is sensitive for clock high.

The Clocked D Latch Here is a variant of the SR latch specialized to store data. The D Latch, also called the “Data Latch”, storing data on every clock pulse.

The Feedback Problem Clocked latches have one major problem: they are sensitive to input for too long a time. Overly extended sensitivity to input can lead to instabilities. Consider the following problem, which is routinely addressed in a computer. There is a register called the PC (Program Counter). As a regular part of program execution it is incremented: PC  (PC) + 1. This operation is so frequently done that every CPU has a dedicated path for it.

The Feedback Problem (Part 2) If the feedback comes too soon, this adds 2.

Making an Edge-Triggered Device We need to reduce the time during which the register will accept input. What we need is reflected in the following timing diagram.

How About the Pulse Generator A clocked latch modified to be edge triggered is called a flip-flop.

The SR Flip-Flop

The D Flip-Flop

The SR Flip-Flop (Again) Here is the standard diagram for the SR flip–flop. Here is the characteristic table SR Q( t + 1) 00 Q( t ) Error

The D Flip-Flop (Again) Here is the standard diagram for the D flip-flop. The characteristic table is quite simple. D Q( t + 1) 00 11

Another Flip-Flop: The T For input T = 0, this stays the same. For input T = 1, this changes state between 0 and 1. TQ(t + 1) 0Q(t) 1

The JK Flip-Flop as a General Device A JK flip–flop generalizes the SR to allow for both inputs to be 1. The characteristic table JK Q( t + 1) 00 Q( t )

Tri–States Attach Flip–Flops to a Bus