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

Slides:

Advertisements

Similar presentations

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

Advertisements

Chapter 3 Logic Gates and Boolean Algebra – Part 1

Digital Electronics Lecture 2 Logic Gates. Lecture 2 outline Announcement:

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

CS 151 Digital Systems Design Lecture 5 Boolean Algebra.

Types of Logic Circuits

Morgan Kaufmann Publishers

Boolean Algebra and Reduction Techniques

Boolean rules for simplification Dr. Ahmed Telba.

1 Boolean Algebra & Logic Design. 2 Developed by George Boole in the 1850s Mathematical theory of logic. Shannon was the first to use Boolean Algebra.

10/25/2004EE 42 fall 2004 lecture 231 Lecture #23 Synthesis Next week: Converting gates into circuits.

ENGIN112 L5: Boolean Algebra September 12, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 5 Boolean Algebra.

Boolean Algebra and Logic Simplification

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

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.

DeMorgan Theorem, Computer Simulation Exercises

 Seattle Pacific University EE Logic System DesignSOP-POS-1 The Connection: Truth Tables to Functions abcF abcF

Lecture 7 Topics –Boolean Algebra 1. Logic and Bits Operation Computers represent information by bit A bit has two possible values, namely zero and one.

Digital Electronics Lecture 4 Simplification using Boolean Algebra, Combinational Logic Circuit Design.

Apr. 3, 2000Systems Architecture I1 Systems Architecture I (CS ) Lecture 3: Review of Digital Circuits and Logic Design Jeremy R. Johnson Mon. Apr.

Ch 4. Combinational Logic Design Principles Combinational Logic Circuit –Outputs depend only on its current inputs –No feedback loop Sequential Logic Circuit.

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

Week 6: Gates and Circuits: PART I READING: Chapter 4.

Circuit Simplification Truth Table  Minimized Logic Gates.

Logic Design CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.

Chapter 5 Boolean Algebra and Reduction Techniques 1.

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.

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.

Boolean Algebra and Reduction Techniques

Logic Circuits Lecture 3 By Amr Al-Awamry. Basic Definitions Binary Operators  AND z = x y = x yz=1 if x=1 AND y=1  OR z = x + y z=1 if x=1 OR y=1 

5 - Digital Logic with Boolean Algebra

Digital Logic Design Dr. Oliver Faust Chapter 4

Chapter 3 Digital Logic Structures

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

The inverter performs the Boolean NOT operation. When the input is LOW, the output is HIGH; when the input is HIGH, the output is LOW. The Inverter AX.

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.

Chapter 5 Boolean Algebra and Reduction Techniques 1.

NAND, NOR, and EXOR (more primitive logical gates) CS Computer Architecture David Mayer.

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:

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

Universal Gate – NOR Universal Gate - NOR Digital Electronics

De Morgan’s Theorem,.

14:332:231 DIGITAL LOGIC DESIGN Boolean Algebra

ECE 2110: Introduction to Digital Systems

Boolean Algebra & De Morgan's Theorems

Logic Gates and Boolean Algebra

ECE 3110: Introduction to Digital Systems

CHAPTER 2 Boolean Algebra

EI205 Lecture 5 Dianguang Ma Fall 2008.

NAND & NOR as Universal gates

Computer Organization and Design Transistors & Logic - II

Princess Sumaya University

Jeremy R. Johnson Wed. Sept. 29, 1999

ECE 331 – Digital System Design

Universal Gate – NOR Universal Gate - NOR Digital Electronics

Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan

Modified from John Wakerly Lecture #2 and #3

Boolean Algebra & Logic Circuits

Circuits, Truth Tables & Boolean Algebra

Universal gates.

CSE 370 – Winter Combinational Logic - 1

Universal Gate – NOR Universal Gate - NOR Digital Electronics

Circuits, Truth Tables & Boolean Algebra

Department of Electronics

Presentation transcript:

CSIS 3510 Computer Organization and Architecture Topics covered in this lecture: –Review of De’Morgan’s Theorem –Using De’Morgan’s Theorem –Building a 2-bit decoder –Algebraic Reduction of Boolean Expressions –7-segment decoder

De’Morgan’s Theorem 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. Remember, we want to design circuits using AND and OR, but then implement them using NAND and NOR (AND transistor bleed- through problem, and manufacturing layering minimization) NOT terms or Inverted terms are represented with a line over the terms AB = A + B A + B = AB We demonstrated the validity of DeMorgan’s by Perfect Induction, using a truth table.

Using De’Morgan’s Theorem 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.

Extracting a function from a truth table and converting ABOutput Out = A B 110DoubleC A B DeM A + B Simplify A + B

Two-Bit Decoder ABF0F1F2F ABF0F1F2F F 0 = A B = A B = A+B = A+B F 1 = A B = A B = A+B = A+B F 2 = A B = A B = A+B = A+B F 3 = A B = A B = A+B

Two-Bit Decoder Diagram A A B B F0 F1 F2 F3

Algebraic Reduction of Boolean Functions Algebraic reduction is used to minimize a function extracted from a truth table or other source. Principle is to look for terms where a single variable is present in both complemented and positive form. Those variables can be deleted from those terms. Note: terms can be used over in multiple minimizations. Examples A B + A B = B,A B + A B = A A B C + A B C = A B A B C + A B C + A B C + A B C A B A B A

7-Segment Display Decoder 7 Segment Display: Displaying 0, 1, 2,

7-Segment Display Truth Table (Displaying values from 0-3 only) AB F0 F1 F2 F3 F4 F5 F

Extracting and Minimizing Segment Functions F0 = F1 = F2 = F3 = F4 = F5 = F6 =

Extracting and Minimizing Segment Functions F0 = F1 = F2 = F3 = F4 = F5 = F6 =

Extracting and Minimizing Segment Functions F0 = F1 = F2 = F3 = F4 = F5 = F6 =

7-Segment Display Decoder Diagram

Conclusion Topics covered in this lecture: –Review of De’Morgan’s Theorem –Using De’Morgan’s Theorem –Building a 2-bit decoder –Algebraic Reduction –7-segment decoder Questions?