第 6 章 Standard Boolean Expression Formats

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

Boolean Algebra and Reduction Techniques
Computer Organization and Design Fundamental 書籍作者： David Tarnoff 投影片製作者：陳鍾誠 第 11 章 State Machines ( 狀態機 )
CHAPTER 4 Boolean Algebra and Logic Simplification
CS 151 Digital Systems Design Lecture 7 More Logic Functions: NAND, NOR, XOR.
CS 151 Digital Systems Design Lecture 6 More Boolean Algebra A B.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
Logic Functions and their Representation. Slide 2 Combinational Networks x1x1 x2x2 xnxn f.
AOI Logic Implementation © 2014 Project Lead The Way, Inc.Digital Electronics.
Combinational Digital Circuits. Measurement Our world is an analog world. Measurements that we make of the physical objects around us are never in discrete.
Computer Programming Skills Revision Prepared by: Ghader Kurdi.
AOI Logic Implementation
Boolean Algebra and Logic Simplification. Boolean Addition & Multiplication Boolean Addition performed by OR gate Sum Term describes Boolean Addition.
Digital Logic Design Adil Waheed. BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION AND gate F = A.B OR gate F = A + B NOT gate F = A NAND gate F = A.B NOR gate.
Boolean Algebra and Logic Simplification
Constructing A Truth Table XYZF1F InputsOutput Input Combinations 3 – Inputs 8 – Combinations (8 = 2 3 ) Note the binary counting order.
Unit 7 Multi-Level Gate Circuits / NAND and NOR Gates Ku-Yaw Chang Assistant Professor, Department of Computer Science and Information.
Computer Organization and Design Fundamental 書籍作者： David Tarnoff 投影片製作者：陳鍾誠 第 2 章 Numbering Systems.
Lecture 4 Logic gates and truth tables Implementing logic functions
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.
 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.
Company LOGO DKT 122/3 DIGITAL SYSTEM 1 WEEK #7 COMBINATIONAL LOGIC ANALYSIS.
ECE 2110: Introduction to Digital Systems PoS minimization Don’t care conditions.
1 ENGR 254 Lecture DeMorgan Symbol Equivalence.
Circuit Simplification Truth Table  Minimized Logic Gates.
NAND-NAND and NOR-NOR Circuits and Even and Odd Logic Functions
Computer Organization and Design Transistors & Logic - II Montek Singh Wed, Oct 16, 2013 Lecture 10.
Figure 4–1 Application of commutative law of addition. Thomas L. Floyd Digital Fundamentals, 9e Copyright ©2006 by Pearson Education, Inc. Upper Saddle.
Implementation of SOP/POS Expressions
Digital Logic Design Week 4 Boolean algebra. Laws and rules De Morgan’s theorem Analysis of logic circuits Standard forms Project 1 preparation.
+ CS 325: CS Hardware and Software Organization and Architecture Gates and Boolean Algebra Part 3.
ENGIN112 L6: More Boolean Algebra September 15, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 6 More Boolean Algebra A B.
ece Parity Used to check for errors Can be either ODD or EVEN Left most bit used as the indicator For EVEN, insert a 0 or a 1 so as to make the.
NAND-NAND and NOR-NOR Circuits and Even and Odd Logic Functions ECE 301 – Digital Electronics.
Boolean Algebra and Reduction Techniques
1 EENG 2710 Chapter 2 Algebraic Methods For The Analysis and Synthesis of Logic circuits.
Boolean Algebra – II. Outline  Basic Theorems of Boolean Algebra  Boolean Functions  Complement of Functions  Standard Forms.
CHAPTER 1 SETS, FUNCTIONs, ELEMENTARY LOGIC & BOOLEAN ALGEBRAs
ECE 3110: Introduction to Digital Systems Chapter #4 Review.
Floyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd Chapter 4 © 2008 Pearson Education.
Chapter 2 Boolean Algebra and Minimization Techniques.
Sum-of-Products (SOP)
1/16/ CSEE, UQ Lecture 3 Hardware Description Methods, Review of Switching Algebra.
DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor
Karnaugh Maps (K-Maps)
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
C.S. Choy21 BOOLEAN ALGEGRA The Mathematics of logic Boolean variables have only two possible values (binary) Operators:. Product+ SumComplement A.B A+B.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Binary Numbers For digital systems, the.
1 3- De-Morgan’s Theorems 1.The complement of a product of variables is equal to the sum of the complements of the variables. 2. The complement of a sum.
CEC 220 Digital Circuit Design SOP and POS forms Friday, January 23 CEC 220 Digital Circuit Design Slide 1 of 17.
Figure 2.1. A binary switch. x1=x0= (a) Two states of a switch S x (b) Symbol for a switch.
School of Computer and Communication Engineering, UniMAP DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan.
Boolean Algebra ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.
Lecture 5 More Boolean Algebra A B. Overview °Expressing Boolean functions °Relationships between algebraic equations, symbols, and truth tables °Simplification.
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC. De Morgan’s Theorem De Morgan’s Theorem.
DE MORGAN’S THEOREM. De Morgan’s Theorem De Morgan’s Theorem.
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.
Dr. ClincyLecture Slide 1 CS Chapter 3 (3A and ) Part 2 of 8 Dr. Clincy Professor of CS.
Circuits, Truth Tables & Boolean Algebra. Expressions Can describe circuits in terms of Boolean expression.
Digital Logic & Design Dr. Waseem Ikram Lecture 09.
De Morgan’s Theorem,.
Circuits, Truth Tables & Boolean Algebra
Week 7: Gates and Circuits: PART II
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION Part (a)
Circuits, Truth Tables & Boolean Algebra
Presentation transcript:

第 6 章 Standard Boolean Expression Formats Computer Organization and Design Fundamental 書籍作者：David Tarnoff 投影片製作者：陳鍾誠

6.1 Sum-of-Products Below is an example of an SOP expression The following is not an SOP expression To fix this problem, we need to break up the NAND using DeMorgan's Theorem

Sample Sum-of-Products Binary Circuit

6.2 Converting an SOP Expression to a Truth Table

Single Product (AND) Truth Tables

Sample of a Sum-of-Products Truth Table

Conversion of an SOP Expression to a Truth Table

6.3 Converting a Truth Table to an SOP Expression

6.4 Product-of-Sums

Product of Sum 對應的電路

6.5 Converting POS to Truth Table

Sample of a Product-of-Sums Truth Table

Sample Sums With Multiple Zero Outputs

6.6 Converting a Truth Table to a POS Expression

6.7 NAND-NAND Logic

Feedback: Privacy Policy Feedback
Do Not Sell My Personal Information
About project: SlidePlayer Terms of Service

© 2024 SlidePlayer.com Inc. All rights reserved.