NAND, NOR and XOR functions properties

Similar documents
Chapter 2 Combinational Logic Circuits

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

Boolean Algebra, Gates and Circuits

Chapter 2: Switching Algebra and Logic Circuits

EGC221: Digital Logic Lab

Experiment 7: Magnitude comparators

CHAPTER 2 BOOLEAN ALGEBRA

Chapter 2 (Lect 2) Canonical and Standard Forms. Standard Form. Other Logic Operators Logic Gates. Sum of Minterms Product of Maxterms

Logic Gate Level. Part 2

CSE20: Discrete Mathematics for Computer Science. Lecture Unit 2: Boolan Functions, Logic Circuits, and Implication

In Module 3, we have learned about Exclusive OR (XOR) gate. Boolean Expression AB + A B = Y also A B = Y. Logic Gate. Truth table

DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA

Boolean Algebra. Philipp Koehn. 9 September 2016

Logic Gates and Boolean Algebra

Chapter 2 Boolean Algebra and Logic Gates

Discrete Mathematics. CS204: Spring, Jong C. Park Computer Science Department KAIST

Number System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary

CS 121 Digital Logic Design. Chapter 2. Teacher Assistant. Hanin Abdulrahman

Logic Design. Chapter 2: Introduction to Logic Circuits

Circuits & Boolean algebra.

Learning Objectives 10/7/2010. CE 411 Digital System Design. Fundamental of Logic Design. Review the basic concepts of logic circuits. Dr.

Unit 8A Computer Organization. Boolean Logic and Gates

Chapter 2 Boolean Algebra and Logic Gates

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

EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits)

Mealy & Moore Machines

E&CE 223 Digital Circuits & Systems. Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev

Outline. EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) Combinational Logic (CL) Defined

Unit 2 Boolean Algebra

ITTC Introduction to Digital Logic Design The University of Kansas EECS 140 / 141 Summary

CS 226: Digital Logic Design

Computer Organization: Boolean Logic

UC Berkeley College of Engineering, EECS Department CS61C: Representations of Combinational Logic Circuits

Unit 2 Boolean Algebra

Ex: Boolean expression for majority function F = A'BC + AB'C + ABC ' + ABC.

EEA051 - Digital Logic 數位邏輯 吳俊興高雄大學資訊工程學系. September 2004

Boolean Algebra and Logic Gates Chapter 2. Topics. Boolean Algebra 9/21/10. EECE 256 Dr. Sidney Fels Steven Oldridge

Digital Circuit And Logic Design I. Lecture 3

Floating Point Representation and Digital Logic. Lecture 11 CS301

Chapter 2 Combinational Logic Circuits

XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.

BOOLEAN ALGEBRA TRUTH TABLE

ELCT201: DIGITAL LOGIC DESIGN

Chapter 2 Boolean Algebra and Logic Gates

CHAPTER1: Digital Logic Circuits Combination Circuits

Switches: basic element of physical implementations

Digital Logic. Lecture 5 - Chapter 2. Outline. Other Logic Gates and their uses. Other Logic Operations. CS 2420 Husain Gholoom - lecturer Page 1

Chapter 2: Boolean Algebra and Logic Gates

DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA

Contents. Chapter 2 Digital Circuits Page 1 of 30

Gates and Flip-Flops

EC-121 Digital Logic Design

BOOLEAN LOGIC. By- Neha Tyagi PGT CS KV 5 Jaipur II Shift, Jaipur Region. Based on CBSE curriculum Class 11. Neha Tyagi, KV 5 Jaipur II Shift

Combinational Logic. Review of Combinational Logic 1

Boolean Algebra. The Building Blocks of Digital Logic Design. Section. Section Overview. Binary Operations and Their Representation.

Boolean Algebra & Logic Gates. By : Ali Mustafa

4 Switching Algebra 4.1 Axioms; Signals and Switching Algebra

UNIVERSITI TENAGA NASIONAL. College of Information Technology

Combinational Logic Design Principles

E&CE 223 Digital Circuits & Systems. Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev. Section 2: Boolean Algebra & Logic Gates

Lecture 2 Review on Digital Logic (Part 1)

KP/Worksheets: Propositional Logic, Boolean Algebra and Computer Hardware Page 1 of 8

Digital Logic (2) Boolean Algebra

Logic Gates - Introduction

CS61c: Representations of Combinational Logic Circuits

ENGR4300 Fall 2005 Test 3A. Name. Section. Question 1 (25 points) Question 2 (25 points) Question 3 (25 points) Question 4 (25 points)

CHAPTER 12 Boolean Algebra

Boole Algebra and Logic Series

Chap 2. Combinational Logic Circuits

ECE 545 Digital System Design with VHDL Lecture 1A. Digital Logic Refresher Part A Combinational Logic Building Blocks

COS 140: Foundations of Computer Science

BOOLEAN ALGEBRA. Introduction. 1854: Logical algebra was published by George Boole known today as Boolean Algebra

MC9211 Computer Organization

Combinational Logic Fundamentals

Boolean Algebra and logic gates

Lecture 21: Boolean Logic. To Wrap up AVR

Digital Logic. CS211 Computer Architecture. l Topics. l Transistors (Design & Types) l Logic Gates. l Combinational Circuits.

WEEK 2.1 BOOLEAN ALGEBRA

Digital Techniques. Figure 1: Block diagram of digital computer. Processor or Arithmetic logic unit ALU. Control Unit. Storage or memory unit

Lecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions

ECE 545 Digital System Design with VHDL Lecture 1. Digital Logic Refresher Part A Combinational Logic Building Blocks

Boolean Algebra and Logic Gates

Simulation of Logic Primitives and Dynamic D-latch with Verilog-XL

Digital Logic: Boolean Algebra and Gates. Textbook Chapter 3

ECE 342 Electronic Circuits. Lecture 34 CMOS Logic

Chapter 3. Boolean Algebra. (continued)

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

CSE 311: Foundations of Computing. Lecture 3: Digital Circuits & Equivalence

CMSC 313 Lecture 17. Focus Groups. Announcement: in-class lab Thu 10/30 Homework 3 Questions Circuits for Addition Midterm Exam returned

Chapter 2 Combinational Logic Circuits

CHAPTER 7 MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES

Projects about Quantum adder circuits Final examination June 2018 Quirk Simulator

EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive

Chapter 3 Combinational Logic Design

Boolean Algebra. Boolean Variables, Functions. NOT operation. AND operation. AND operation (cont). OR operation

LOGIC GATES A Y=A+B. Logic symbol of OR gate B The Boolean expression of OR gate is Y = A + B, read as Y equals A 'OR' B.

Lecture 9: Digital Electronics

. T SHREE MAHAPRABHU PUBLIC SCHOOL & COLLEGE NOTES FOR BOARD EXAMINATION SUBJECT COMPUTER SCIENCE (Code: 083) Boolean Algebra

BOOLEAN ALGEBRA INTRODUCTION SUBSETS

2. BOOLEAN SWITCHING ALGEBRA

Transcription:

Laboratory NAND, NOR and XOR functions properties. Laboratory work goals Enumeration of NAND, NOR and XOR functions properties Presentation of NAND, NOR and XOR modules Realisation of circuits with gates in order to practically test some of the properties of NAND, NOR and XOR functions.. Theoretical considerations.. NAND function properties Mathematical symbol: or The truth table is presented in Fig... The graphical symbol of the gate realising the function is depicted in Fig... x x x x 0 0 0 0 0 x x x x Fig.. Fig.. 0

P) x x x n = x x... x n = x + x +... + x n P) Commutativity of NAND: x x =x x P) NAND function is not associative, that is (x x ) x x (x x ) P) NAND function is pseudo-associative, that is x x x = ( x x) x = x ( x x) P) 0 is aggressive with respect to NAND meaning 0 x x x n = P) The pseudo-neutrality of with respect to NAND a) x x x n =x x x n b) x = x P) The pseudo-idempotency of NAND a) x x x y y y m = x y y y m b) x x x= x P) The pseudo-distributivity of NAND with respect to NOR: x (y z)=( x y) ( x z) P) The first absorption law for NAND: x (x y)=x y P0) The second absorption law for NAND: (x y) ( x y)=y P) Any switching function can be represented using only NAND operators (The NAND operator forms a base for switching functions representation).

.. NOR function properties Mathematical symbol: The truth table is presented in Fig... The graphical symbol of the gate realising the function is depicted in Fig... x x x x 0 0 0 0 0 0 0 x x x x Fig.. Fig.. P) x x x n = x + x +... + xn = x x... xn P) NOR is commutative: x x =x x P) NOR function is not associative, meaning (x x ) x x (x x ) P) NOR function is pseudo-associative, meaning x x x = (x x) x = x (x x) P) is aggressive with respect to NOR meaning x x x n =0 P) The pseudo-neutrality of 0 with respect to NOR a) 0 x x x n =x x x n b) 0 x = x P) The pseudo-idempotency of NOR a) x x x y y y m = x y y y m b) x x x= x P) The pseudo-distributivity of NOR with respect to NAND:

x (y z)=( x y) ( x z) P) The first absorption law for NOR: x (x y)=x y P0) The second absorption law for NOR: (x y) ( x y)=y P) Any switching function can be represented using only NOR operators (the NOR operator forms a base for switching functions representation)... XOR function properties Mathematical symbol: The truth table is presented in Fig... The graphical symbol of the gate realising the function is depicted in Fig... x x x x 0 0 0 0 0 0 x x x + x Fig.. Fig.. P) x x = xx + xx (see paragraph..) P) XOR operator is commutative: x x =x x P) XOR operator is associative: x (x x )= (x x ) x P) 0 is neutral with respect to XOR: 0 x=x 0=x

P) is pseudo-neutral with respect to XOR: x=x = x Remark! The P and P properties justify the name of commanded inverter, sometimes used to designate the XOR operator, as it can be seen in Fig... Fig.. P) The symmetrical of x with respect to XOR is x itself, meaning x x=0. P) x x... x = n times 0 x if if n = k n = k + P) x y = x y = x y P) Distributivity of AND with respect to XOR: x (y z)=(x y) (x z) P0) Any switching function can be implemented using only XOR, AND operators and the constant (XOR, AND, form a base for switching functions representation).

. Presentation of modules comprising NAND, NOR and XOR logic gates The modules used during the lab activities comprise XOR (), NOR (0) and NAND (LS00) logic circuits. Details about each module and pin assignment are presented in Appendix and [0], []. The LS00 module (Fig..) is an integrated circuit that contains NAND gates, implementing the NAND function with inputs. Y=A B= A B = A + B The LS0 module (Fig..) is an integrated circuit that contains NAND gates, implementing the NAND function with inputs. Y=A B C = A B C = A + B + C The LS0 module (Fig..0) is an integrated circuit that contains NAND gates, and implements the NAND function with inputs. Y=A B C D = A B C D = A + B + C + D The LS0 module (Fig..) is an integrated circuit containing independent NOR gates, and implements the NOR function with inputs. Y=A B= A + B = A B The module (Fig..) is an integrated circuit containing independent XOR gates, implementing the XOR function with inputs. Y=A B= A B + AB

A A A B A B C B A Y B A Y Y NC B A Y B C A NC Y B 0 A C 0 B B 0 A Y B Y C Y B GND Y GND Y GND Fig.. Fig.. Fig..0 Y Y A A Y B A B A Y B Y B A Y A 0 Y B 0 A B A Y B GND B GND Y Fig.. Fig... Lab activity progress There will be implemented circuits comprising gates in order to verify some of the XOR, NOR and NAND functions properties. Example: Distributivity of conjunction with respect to XOR: x,y,z {0,} x (y z)=(x y) (x z) E= x (y z) E=(x y) (x z)

In order to verify these properties a XOR SN module and an AND SNLS0 module will be used. The test diagram is depicted in Fig... Both expressions must be implemented and then for each possible combination of x, y and z the output voltage must be measured for each expression circuit. x y z UA LSA UA LS0 E UB 0 UC LS0 UB LSA E LS0 Fig... Proposed problems. Implement a circuit containing logic gates that verifies property P of NAND function. The NAND function will be implemented using the 0 module.. Implement a circuit containing logic gates that verifies properties P, P, P and P of NAND function.. Implement a circuit containing logic gates that verifies property P of NAND function.. Implement a circuit containing logic gates that verifies properties P and P0 of NAND function.. Implement a circuit containing logic gates that verifies property P of NOR function. The NOR function will be implemented using and 0 modules.

. Implement a circuit containing logic gates that verifies properties P, P, P and P of NOR function.. Implement a circuit containing logic gates that verifies property P of NOR function.. Implement a circuit containing logic gates that verifies properties P and P0 of NOR function.. Implement a circuit containing logic gates that verifies properties P, P, P and P of XOR function. 0. Implement a circuit containing logic gates that verifies properties P, P and P of XOR function. Note! The test results will be recorded for each problem in a table as the Fig.. or Fig..