Using the NOT realization from the NAND, we can NOT the output of the NAND gate making it a NOT NOT AND or simply an AND gate.

Similar documents
Sequential vs. Combinational

Introduction to Digital Logic

Synchronous Sequential Logic

Sequential Logic Circuits

Chapter 4. Sequential Logic Circuits

Mealy & Moore Machines

ELCT201: DIGITAL LOGIC DESIGN

Lecture 14: State Tables, Diagrams, Latches, and Flip Flop

Sequential Logic. Rab Nawaz Khan Jadoon DCS. Lecturer COMSATS Lahore Pakistan. Department of Computer Science

Gates and Flip-Flops

Chapter #6: Sequential Logic Design

EE40 Lec 15. Logic Synthesis and Sequential Logic Circuits

Lecture 9: Digital Electronics

Digital electronics form a class of circuitry where the ability of the electronics to process data is the primary focus.

Lecture 7: Sequential Networks

Chapter 7 Sequential Logic

Topic 8: Sequential Circuits

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

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 7 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering

Digital Logic: Boolean Algebra and Gates. Textbook Chapter 3

Chapter 14 Sequential logic, Latches and Flip-Flops

MOSIS REPORT. Spring MOSIS Report 1. MOSIS Report 2. MOSIS Report 3

Boolean Algebra and Digital Logic 2009, University of Colombo School of Computing

MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified) State any two Boolean laws. (Any 2 laws 1 mark each)

Introduction to Computer Engineering. CS/ECE 252, Fall 2012 Prof. Guri Sohi Computer Sciences Department University of Wisconsin Madison

Exercise booklet - Logic

EET 310 Flip-Flops 11/17/2011 1

Latches. October 13, 2003 Latches 1

XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.

Propositional Logic. Logical Expressions. Logic Minimization. CNF and DNF. Algebraic Laws for Logical Expressions CSC 173

LOGIC CIRCUITS. Basic Experiment and Design of Electronics

CHAPTER 7 MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES

CMPEN 411. Spring Lecture 18: Static Sequential Circuits

CSE140: Components and Design Techniques for Digital Systems. Midterm Information. Instructor: Mohsen Imani. Sources: TSR, Katz, Boriello & Vahid

CS61C : Machine Structures

1 Boolean Algebra Simplification

CMPE12 - Notes chapter 1. Digital Logic. (Textbook Chapter 3)

Schedule. ECEN 301 Discussion #25 Final Review 1. Date Day Class No. 1 Dec Mon 25 Final Review. Title Chapters HW Due date. Lab Due date.

Sequential Logic Worksheet

CS61C : Machine Structures

Digital Electronics. Delay Max. FF Rate Power/Gate High Low (ns) (MHz) (mw) (V) (V) Standard TTL (7400)

L4: Sequential Building Blocks (Flip-flops, Latches and Registers)

L4: Sequential Building Blocks (Flip-flops, Latches and Registers)

DIGITAL LOGIC CIRCUITS

Computers also need devices capable of Storing data and information Performing mathematical operations on such data

Unit II Chapter 4:- Digital Logic Contents 4.1 Introduction... 4

Topic 8: Sequential Circuits. Bistable Devices. S-R Latches. Consider the following element. Readings : Patterson & Hennesy, Appendix B.4 - B.

Lecture (02) NAND and NOR Gates

S.Y. Diploma : Sem. III [CO/CM/IF/CD/CW] Digital Techniques

The Design Procedure. Output Equation Determination - Derive output equations from the state table

MODEL ANSWER SUMMER 17 EXAMINATION Subject Title: Principles of Digital Techniques

UNIVERSITI TENAGA NASIONAL. College of Information Technology

Digital Logic Design ABC. Representing Logic Operations. Dr. Kenneth Wong. Determining output level from a diagram. Laws of Boolean Algebra

UNIT 8A Computer Circuitry: Layers of Abstraction. Boolean Logic & Truth Tables

Overview of Chapter 4

Every time has a value associated with it, not just some times. A variable can take on any value within a range

LOGIC CIRCUITS. Basic Experiment and Design of Electronics. Ho Kyung Kim, Ph.D.

University of Minnesota Department of Electrical and Computer Engineering

Chapter 5 Synchronous Sequential Logic

Menu. Part 2 of 3701: Sequential Digital Machines Latches and Flip-Flops: >S-R latches >D latches >T latches. Comb. n. Logic. m Q.

UNIVERSITY OF WISCONSIN MADISON

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering

Vidyalankar S.E. Sem. III [ETRX] Digital Circuits and Design Prelim Question Paper Solution

ELEN Electronique numérique

Roger L. Tokheim. Chapter 8 Counters Glencoe/McGraw-Hill

Sequential Circuit Analysis

ELEC Digital Logic Circuits Fall 2014 Sequential Circuits (Chapter 6) Finite State Machines (Ch. 7-10)

S.Y. Diploma : Sem. III [DE/ED/EI/EJ/EN/ET/EV/EX/IC/IE/IS/IU/MU] Principles of Digital Techniques

Different encodings generate different circuits

Introduction to Computer Engineering. CS/ECE 252, Spring 2017 Rahul Nayar Computer Sciences Department University of Wisconsin Madison

CS 226: Digital Logic Design

Logic Gate Level. Part 2

ALU A functional unit

Chapter 2: Princess Sumaya Univ. Computer Engineering Dept.

EE 209 Spiral 1 Exam Solutions Name:

10/14/2009. Reading: Hambley Chapters

Combinational Logic Design Principles

Boolean algebra. Examples of these individual laws of Boolean, rules and theorems for Boolean algebra are given in the following table.

Digital Electronic Meters

Week-5. Sequential Circuit Design. Acknowledgement: Most of the following slides are adapted from Prof. Kale's slides at UIUC, USA.


Vidyalankar S.E. Sem. III [CMPN] Digital Logic Design and Analysis Prelim Question Paper Solution

Chapter 9 Asynchronous Sequential Logic

CSE370 HW6 Solutions (Winter 2010)

BER KELEY D AV IS IR VINE LOS AN GELES RIVERS IDE SAN D IEGO S AN FRANCISCO

Homework Assignment #1 Solutions EE 477 Spring 2017 Professor Parker

MAHALAKSHMI ENGINEERING COLLEGE TIRUCHIRAPALLI

Additional Gates COE 202. Digital Logic Design. Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals

Synchronous Sequential Circuit

Konstruktion av Vippor och Latchar

XOR - XNOR Gates. The graphic symbol and truth table of XOR gate is shown in the figure.

CMPE12 - Notes chapter 2. Digital Logic. (Textbook Chapters and 2.1)"

Digital Circuits. 1. Inputs & Outputs are quantized at two levels. 2. Binary arithmetic, only digits are 0 & 1. Position indicates power of 2.

Cs302 Quiz for MID TERM Exam Solved

PAST EXAM PAPER & MEMO N3 ABOUT THE QUESTION PAPERS:

Sequential Circuit Design

15.1 Elimination of Redundant States

EE 209 Logic Cumulative Exam Name:

Lecture 3 Review on Digital Logic (Part 2)

Computer Organization: Boolean Logic

Transcription:

CSC 216 NAND/NOR Equivalents and Flip/Flops Dr. Anthony S. Pyzdrowski 10/28/2016 The NAND gate is a NOT AND gate. It is false when all inputs are true and true otherwise. The NOR gate is a NOT OR gate. It is true when all inputs are false and true otherwise. A B A NAND B A B A NOR B F F T F F T F T T F T F T F T T F F T T F T T F Both the NAND and NOR gates can be used to realize all of the logic operations. If both inputs of the NAND gate, A and B, are the same, i.e. connected together, then there are just two entries of the truth table used, the false, false and the true, true. When both inputs of the NAND gate are false the function is true and when both inputs are true the function is false, this realizes the NOT gate. AB A NAND B F T T F Likewise if both inputs of the NOR gate, A and B, are the same, i.e. connected together, then there are just two entries of the truth table used, the false, false and the true, true. When both inputs of the NOR gate are false the function is true and when both inputs are true the function is false, this realizes the NOT gate. AB A NOR B F T T F Using the NOT realization from the NAND, we can NOT the output of the NAND gate making it a NOT NOT AND or simply an AND gate. A B A NAND B NOT(A NAND B) = A AND B F F T F F T T F T F T F T T F T

Using the NOT realization from of the NOR, we can NOT the output of the NOR gate making it a NOT NOT OR or simply an OR gate. A B A NOR B NOT(A NOR B) = A OR B F F T F F T F T T F F T T T F T Using DeMorgan's theorm on the AND gate we have a NOR gate with the inputs NOTted: AB A B By NOTting the inputs of a NOR gate we can realize an AND gate. A B A& B& (NOT A) NOR (NOT B) = A B F F T T F F T T F F T F F T F T T F F T Using DeMorgan's theorem on the OR gate we have a NAND gate with the inputs NOTted: A B AB By NOTting the inputs of a NAND gate we can realize an OR gate. A B A& B& A& NAND B& = A + B F F T T F F T T F T T F F T T T T F F T By NOTting the inputs and the output of a NOR gate we can realize a NAND gate. A B A& B& A& NOR B& NOT(A& NOR B&) = A NAND B F F T T F T F T T F F T T F F T F T T T F F T F

By NOTting the inputs and output of a NAND gate we can realize a NOR gate. A B A& B& A& NAND B& NOT(A& NAND B&) = A NOR B F F T T F T F T T F T F T F F T T F T T F F T F NAND NOR AND OR NOT NAND NOR

Any circuit can be realized with either all NAND's or all NOR's by substituting the equivalent module for each component in the circuit. Circuit Circuit realized with all NAND's Circuit with all NAND's and NOT-NOT removed Try to realize the same circuit using all NOR's. The S-R Flip/Flop Using two NOR gates and feedback, outputs feed the inputs, we can make a logic device which can store data. In this circuit the output X is A NOR Y, X A Y and the output Y is B NOR X, Y B X Substituting the expression for Y into the first equation we get X A B X and applying DeMorgan's theorem we get X A B X A B X AB A X In order to analyze this equation we must break the feedback line and step time from the old value to the new value. A B old X new X 0 0 0 0 X becomes and remains 0 because both B and X are 0 and &A is 1 0 0 1 1 X remains 1 since &A X remain 1 0 1 0 1 X becomes 1 and stays 1 because of &A B is a 1 0 1 1 1 X becomes and remains 1 because of &A B is a 1 1 0 0 0 X becomes and remains 0 because of &A is a 0 1 0 1 0 X becomes and remains 0 because of &A is a 0 1 1 0 0 X becomes and remains 0 because of &A is a 0 1 1 1 0 X becomes and remains 0 because of &A is a 0

Rename the inputs A and B to R for Reset and S for Set and the output X to Q, q is old Q and Q is new Q. R S q Q' 0 0 0 0 No change in X 0 0 1 1 No change in X 0 1 0 1 X becomes and remains 1, Set 0 1 1 1 X remains 1, Set 1 0 0 0 X remains 0, Reset 1 0 1 0 X becomes and remains 0, Reset 1 1 0? Undefined, can't Reset and Set at the same time 1 1 1? Undefined, can't Reset and Set at the same time This is a SR or Set Reset Flip/Flop R S Q 0 0 q No Change 0 1 1 Set 1 0 0 Reset 1 1 X Undefined This device can be set, made true, by making the input S true and the input R false. The state can remain set, true, by making both the S and R inputs false. The state can be changed to false by setting the input R true and the input S false. The state can remain reset, false, by making both the S and R inputs false. This device, RS F/F, is a simple storage device. A &S &R F/F can be made using NAND gates in the same configuration as the SR F/F made from NOR Gates. The truth table for the &S &R F/F is: &S &R Q 0 0 X Undefined 0 1 1 Set 1 0 0 Reset 1 1 q No Change Adding AND gates to the inputs of a SR F/F alows for "clocking" of the device, i.e. the inputs of the F/F are not changed until the inputs of the AND gates become true. Only when the Clock is true will the R and S inputs pass through to the RS F/F. Anytime the Clock is false both the inputs to the RS F/F will be false and the state of the RS F/F will remain unchanged. This is a level Clock. If the Clock input is NOTted, it will become a negative level Clock and the inputs will pass through to the F/F whenever the Clock is false, otherwise the F/F inputs will be false and the state will remain unchanged. By making R = &S of a clocked RS F/F through the use of an inverter, NOT, we create a Data

storage unit. Clock S=D R=&S Q 0 0 1 q No Change 0 1 0 q No Change 1 0 1 0 Reset 1 1 0 1 Set D Q (When clock is true) 0 0 1 1 Adding feedback to the AND gates can resolve the undefined state of the SR F/F. The true-true input results in the state of the Flip/Flop toggling from it's previous state. J K Q (When clock is true) 0 0 q No Change 0 1 0 Reset 1 0 1 Set 1 1 q' Toggle The last Flip/Flop that we will use is the T F/F. T stands for toggle. Making both J and K inputs equal to each other results in only two input sequences, false-false and true-true, T Q (When clock is true) 0 q No Change 1 q' Toggle There are two additional types of clocks, edge triggered. Unlike the level triggered Clocks which allow the inputs to pass through to the F/F over a period of time which allows the inputs to change while the Clock is true, the edge triggered Clocks only allow the inputs to pass through during the brief instant of time that the level of the Clock changes. There is the positive edge triggered Clock and the negative edge triggered Clock. The inputs will pass through to the F/F on the rising edge of the Clock signal for the positive edge Clock and the inputs will pass through to the F/F on the falling edge of the Clock signal for the negative edge Clock. The period of time the Clock is true is very short compared to the time it takes the other signals in a system to change, think of it as the shutter on your high speed camera.