Using De’Morgan’s On of the most useful principles in boolean algebra is De’Morgan’s Theorem, which allows one to switch between ANDs and NORs and ORs.

Slides:

Advertisements

Similar presentations

Digital Systems: Logic Gates and Boolean Algebra Wen-Hung Liao, Ph.D.

Advertisements

ENGIN112 L7: More Logic Functions September 17, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 7 More Logic Functions: NAND, NOR,

Chapter 3 Logic Gates and Boolean Algebra – Part 1

Lecture 6 More Logic Functions: NAND, NOR, XOR and XNOR

Instructor Dr Sameh Abdulatif

CSIS 3510 Computer Organization and Architecture Topics covered in this lecture: –Review of De’Morgan’s Theorem –Using De’Morgan’s Theorem –Building a.

Boolean rules for simplification Dr. Ahmed Telba.

ECE 2373 Modern Digital System Design Exam 2. ECE 2372 Exam 2 Thursday March 5 You may use two 8 ½” x 11” pages of information, front and back, write.

CS 151 Digital Systems Design Lecture 7 More Logic Functions: NAND, NOR, XOR.

Digital Systems Logic Gates and Boolean Algebra

Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.

ENGG 1203 Tutorial Combinational Logic (I) 1 Feb Learning Objectives

In this module you will learn: What the various logic gates do. How to represent logic gates on a circuit diagram. The truth tables for the logic gates.

Logic gates & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.

The NAND gate as a universal gate Logic function NAND gate only AA A B A.BA.B A B A+B A B A B A B A A A B A.BA.B B A A B A B A B.

Lecture 17: Digital Design Today’s topic –Intro to Boolean functions Reminders –HW 4 due Wednesday 10/8/2014 (extended) –HW 5 due Wednesday 10/15/2014.

TODAY YOU ARE LEARNING to explain why data is represented in computer systems in binary form 2. to understand and produce simple logic diagrams.

DeMorgan Theorem, Computer Simulation Exercises

Digital Electronics Lecture 6 Combinational Logic Circuit Design.

Logic Gates Shashidhara H S Dept. of ISE MSRIT. Basic Logic Design and Boolean Algebra GATES = basic digital building blocks which correspond to and perform.

Lecture 22: 11/19/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.

LOGIC GATES AND CIRCUITS Digital systems are said to be constructed by using logic gates. These gates are the AND, OR, NOT, NAND, NOR, EXOR and EXNOR gates.

Logic Gates and Boolean Algebra Wen-Hung Liao, Ph.D. 11/2/2001.

Basic Gates 3.1 Basic Digital Logic: NAND and NOR Gates ©Paul Godin Created September 2007 Last Update Sept 2009.

1 EG 32 Digital Electronics Thought for the day You learn from your mistakes..... So make as many as you can and you will eventually know everything.

Brief Introduction to Boolean Algebra We can use transistors to build AND, OR, NAND, NOR, and Invertors Manufacturing is simplified with NAND/NOR NAND/NOR.

Basic Digital Logic: NAND and NOR Gates Technician Series ©Paul Godin Last Update Dec 2014.

1 EENG 2710 Chapter 2 Algebraic Methods For The Analysis and Synthesis of Logic circuits.

Logic Gates. A logic gate is an elementary building block of a digital circuit. Most logic gates have two inputs and one output. At any given moment,

C.S. Choy21 BOOLEAN ALGEGRA The Mathematics of logic Boolean variables have only two possible values (binary) Operators:. Product+ SumComplement A.B A+B.

CEC 220 Digital Circuit Design SOP and POS forms Friday, January 23 CEC 220 Digital Circuit Design Slide 1 of 17.

DeMorgan’s Theorem DeMorgan’s 2 nd Theorem The complement of a sum of variables is equal to the product of the complemented variables. A + B = A. B Applying.

CEC 220 Digital Circuit Design SOP and POS forms Friday, Sept 11 CEC 220 Digital Circuit Design Slide 1 of 17.

Chapter 5 Boolean Algebra and Reduction Techniques 1.

Logic Gates and Boolean Algebra Introduction to Logic II.

Boolean Algebra How gates get picked. Boolean Arithmetic Boolean ≠ Binary – Boolean – 1/0 only, no places Boolean addition:

Hoda Roodaki Boolean Algebra Hoda Roodaki

Speaker: Fuw-Yi Yang 楊伏夷伏夷非征番, 道德經察政章(Chapter 58) 伏者潛藏也

Eng. Mai Z. Alyazji October, 2016

Logic Gates and Boolean Algebra

Chapter 3 Notes – Part II Review Questions

De Morgan’s Theorem,.

ECE 2110: Introduction to Digital Systems

Boolean Algebra & De Morgan's Theorems

Logic Gates and Boolean Algebra

EI205 Lecture 5 Dianguang Ma Fall 2008.

NAND & NOR as Universal gates

Princess Sumaya University

CHAPTER 3 SETS AND BOOLEAN ALGEBRA

Digital Systems: Logic Gates and Boolean Algebra

Boolean Algebra & Logic Circuits

Circuits, Truth Tables & Boolean Algebra

Universal gates.

Boolean Algebra.

Boolean Algebra.

Today You are Learning simple logic diagrams using the operations AND, OR and NOT truth tables combining Boolean operators using AND, OR and NOT.

Chapter 4 Gates and Circuits.

Boolean Algebra How gates get picked.

Digital Logic Experiment

Circuits, Truth Tables & Boolean Algebra

Design of Digital Circuits Lab 1 Supplement: Drawing Basic Circuits

Department of Electronics

Combinational Logic Circuit

Boolean Algebra and Gate Networks

ECE 352 Digital System Fundamentals

Chapter 3 – Describing Logic Circuits

Agenda Lecture Content: Combinatorial Circuits Boolean Algebras

Presentation transcript:

Using De’Morgan’s On of the most useful principles in boolean algebra is De’Morgan’s Theorem, which allows one to switch between ANDs and NORs and ORs and NANDs. NOT terms or Inverted terms are represented with a line over the terms AB = A + B A + B = AB

To convert A+B into a form that can be implemented using a NAND gate follow these steps: 1. Double Complement the term A+B = A+B 2. Use DeMorgan’s to distribute one of the complements A+B = A B The equation is now a NAND of the complemented inputs. To convert AB into a form that can be implemented using a NOR gate follow these steps: 1. Double Complement the term AB = AB 2. Use DeMorgan’s to distribute one of the complements AB = A + B The equation is now a NOR of the complemented inputs.

ABOutput Out = A B 110DoubleC A B DeM A + B Simplify A + B

Exercise 1 ABCOutput Out = A B C + A B C 0110DoubleC A B C + A B C 1000DeM (A B C) ( A B C) Draw a gate diagram that implements this function in three NAND gates plus invertors. Your diagram will have two levels of NAND gates.

Exercise 2 1.Build a truth table for the following problem: PC power/security. A computer needs to be secured from un-authorized access in the following way: The power should only come on when A. The security key is present in the lock B. The case cover is closed C. The user presses the power-on button. 2.Use DeMorgan’s and boolean algebra to convert a function extracted from your truth table above, into one that can be constructed with either NANDs or NORs. 3.Draw a circuit diagram with gates that implements your function from step 2.