Chapter 2: Boolean Algebra and Logic Gates. Boolean Algebra

Save this PDF as:

Size: px
Start display at page:

Transcription

1 The Universit Of Alabama in Huntsville Computer Science Chapter 2: Boolean Algebra and Logic Gates The Universit Of Alabama in Huntsville Computer Science Boolean Algebra The algebraic sstem usuall used to work with binar logic epressions Postulates: 1. Closure: An defined operation on (0, 1) gives (0,1) 2. Identit: 0 + = ; 1. = 3. Commutative: + = + ; = 4. Distributive: ( + ) = + ; + () = ( + )( + ) 5. Def of Complement: + = 1; = 0 6. At least 2 elements (0 and 1) Precedence rule: (1) parentheses (2) NOT (3) AND (4) OR 1

2 The Universit Of Alabama in Huntsville Computer Science The Dualit Principle A Boolean epression that is alwas true is still true if we echange OR with AND and 0 with 1 Eamples: + = 1 so: = 0 + = + so: = Note that we cannot use Dualit to sa that + =1, so = 0 Wh not? The Universit Of Alabama in Huntsville Computer Science Useful Postulates and Theorems (a) Postulate =. 1 = Postulate 5 + = 1 = 0 Theorem 1 + = = Theorem = 1. 0 = 0 Theorem 3 (involution) ( ) = Postulate 3 (commutative) + = + = Theorem 4 (associative) + ( + ) = ( + ) = () = () Postulate 4 (distributive) ( + ) = + + = ( + )( + ) Theorem 5 (demorgan s Law) ( + ) = () = + Theorem 6 (absorption) + = ( + ) = (b) 2

3 The Universit Of Alabama in Huntsville Computer Science Eample: Theorem 1: + = ; = Proving the Theorems Proof: + = ( + ) 1 postulate 2(b) = ( + )( + ) 5(a) = + 4(b) = + 0 5(b) = 2(a) = b dualit The Universit Of Alabama in Huntsville Computer Science Proving b Truth Table Two Boolean epressions are equal in all cases if and onl if the have the same Truth Table. (You ma use this to prove the epressions are equal unless I sa otherwise). Eample: Prove demorgan s Law: ( + ) = ( + ) ( + ) The Truth Table of ( + ) is equal to the Truth Table of, so we know that ( + ) = for all values of and. 3

4 The Universit Of Alabama in Huntsville Computer Science Boolean functions and circuit equivalents The Universit Of Alabama in Huntsville Computer Science Implementing a Boolean epression as a circuit F1 = + F1 F1 F1 4

5 The Universit Of Alabama in Huntsville Computer Science Simplifing epressions There are man different was to write the same epression Eample: + + = + Different forms of the epression will require different numbers of gates to implement Proof? See page 45 in tet Generall, longer epressions with more terms require more gates and/or more comple gates More gates higher power, higher cost, larger sie, So finding a wa to simplif epressions will pa off in terms of the circuits we design The Universit Of Alabama in Huntsville Computer Science A metric for use in simplifing epressions Define a literal as each occurrence of a variable in the epression Eample: F2 = literals If we can write the epression with fewer literal, we will consider it to be simpler (and to take fewer gates). Note that this is a rule of thumb and does not alwas give an optimum answer 5

6 The Universit Of Alabama in Huntsville Computer Science Simplifing epressions using the postulates and theorems of Boolean Algebra From page of tet 1. ( + ) (3 literals) = + p4a = 0 + p5b = p2a (2 literals) 2. + = + The dual of (1) 3. ( + )( + ) (4 literals) = + p4b = + 0 p5b = p2a (1 literal) (6 literals) = + + (1) p2b = + + ( + ) p5a = p4a = p3b twice = p3a twice = p2b twice = (1 + ) + (1 + ) p4a twice = T2a twice = + p2a twice (4 literals) 5. (+)( +)(+) = (+)( +) The dual of (4) The Consensus Theorem The Universit Of Alabama in Huntsville Computer Science Complementing a function demorgan s Law sas: ( + ) = To take (A + B + C) Let = B+C Then (A + B + C) = (A + ) = A = A (B + C) = A B C In general: (A+B+C+D+ ) = A B C D ; (ABCD ) = A +B +C +D A more comple function: F = + F = ( + ) = ( ) ( ) = ( + + )( + + ) 6

7 The Universit Of Alabama in Huntsville Computer Science A shortcut for complementing a function To complement a function, ou can take the dual of the function, and complement each literal. For the previous eample: F = + dual of F = ( + + )( + + ) so F = ( + + )( + + ) The Universit Of Alabama in Huntsville Computer Science Standard forms of Boolean Epressions 7

8 The Universit Of Alabama in Huntsville Computer Science Definitions Product term a term consisting of literals ANDed together» Eample: AB F Minterm a Product term in which all variables appear» Eample: ABC D where A,B,C, and D are the variables of the function Sum term a term consisting of literals ORed together» Eample: A + B + F Materm a Sum term in which all variables appear» Eample: A + B + C + D where A, B, C, and D are the variables of the function The Universit Of Alabama in Huntsville Computer Science SOP and Canonical SOP Form A function is in Sum of Products (SOP) form if it is written as product terms ORed together Eample: f( ) = + + A function is in Canonical SOP form if it is in SOP form and all terms are minterms Eample: g( ) = + + 8

9 The Universit Of Alabama in Huntsville Computer Science POS and Canonical POS form A function is in Product of Sums (POS) form if it is written as sum terms ANDed together Eample: f( ) = ( + + ) ( + ) () A function is in Canonical POS form if it is written in POS form and all terms are Materms Eample: g( ) = ( + + ) ( + + ) The Universit Of Alabama in Huntsville Computer Science Minterms and the Truth Table Each row of a Truth Table corresponds to a minterm f( ) minterm m m m m m m m m 7 f( ) = Minterm List Form: f( ) = Σm(1, 4, 5, 7) The 1 s of the Truth Table show the minterms that are in the Canonical SOP epression 9

10 The Universit Of Alabama in Huntsville Computer Science f() f( ) = + + = Σm(1,4,7) Eamples A B C D g(abcd) g(a B C D) = A B C D + AB CD + ABC D = Σm(1, 10, 13) The Universit Of Alabama in Huntsville Computer Science Materms and the Truth Table Each row of a Truth Table corresponds to a materm f( ) Materm M M M M M M M M f( ) = (++)(+ +)( + + ) Materm List Form: f( ) = ΠM(0,3,6) Note the differences from the wa minterms are complemented The 0 s of the Truth Table show the materms that are in the Canonical POS epression 10

11 The Universit Of Alabama in Huntsville Computer Science f() Eample f( ) = (++)(+ +)(+ + )( ++ )( + +) = ΠM(0, 2, 3, 5, 6) Note that the Minterm List and Materm List taken together include the number of ever row of the Truth Table. That means that if ou determine either one of the lists, ou can determine the other one b simpl writing the row numbers that are not in the first one. Eamples: If F(ABC) = Σm(0-3), then F(ABC) = ΠM(4-7) if G(w) = ΠM(0,12,15), then G(w) = Σm(1-11, 13, 14) The Universit Of Alabama in Huntsville Computer Science Basic Combinational Circuit Designs 11

12 The Universit Of Alabama in Huntsville Computer Science SOP to AND-OR An SOP epression can be directl implemented in a two-level combinational circuit with an AND gate for each product term and an OR gate to combine the terms Eample: f() = + + f() The Universit Of Alabama in Huntsville Computer Science POS to OR-AND A POS epression can be directl implemented in a two-level combinational circuit with an OR gate for each sum term and an AND gate to combine the terms Eample: f(w) = (+)(w+) w f(w) 12

13 The Universit Of Alabama in Huntsville Computer Science Circuits for mied-form epressions Combinational circuits for mied-form epressions ma have more than two levels Eample: f(abcde) = AB + C(D + E) A B C D E f(abcde) The Universit Of Alabama in Huntsville Computer Science NAND NAND Other common gate tpes () = + Eclusive-OR (XOR) XOR = + NOR NOR (+) = 13

14 The Universit Of Alabama in Huntsville Computer Science You can use NAND and NOR to do anthing ou can do with AND, OR, and NOT () = (() ) = ( ) = + NOT AND OR (+) = ( + ) = = ((+) ) = + The Universit Of Alabama in Huntsville Computer Science SOP to NAND (1) We alread determined that we can go directl from SOP form to an AND-OR implementation f() = + + f() We can substitute the NAND equivalents for the AND and OR gates f() 14

15 The Universit Of Alabama in Huntsville Computer Science SOP to NAND (2) The circled gates are just 2 inverters in series the do nothing So leave them out f() f() The Universit Of Alabama in Huntsville Computer Science Check: Is this still the original f()? SOP to NAND (3) The circuit produces: ( ( ) ( )) = + ( ) + ( ) = + + f() 15

16 The Universit Of Alabama in Huntsville Computer Science SOP to NAND (4) We can use NAND gates to directl implement an SOP epression: One NAND for each Product term One NAND to sum the terms Invert an single inputs Wh do we do this? The NAND integrated circuit design is ver simple. We can use this one simple gate tpe for an epression. The Universit Of Alabama in Huntsville Computer Science SOP to NAND (5) Eample: f(a,b,c,d) = A B + AC + ABD A B A C A B D f(a,b,c,d) 16

17 The Universit Of Alabama in Huntsville Computer Science Cascading 2-input NANDs to implement larger NAND functions Think of a multiple-input NAND as an AND followed b an INVERTER () () We can easil build a multiple-input AND out of 2-input ANDs And we know how to build a 2-input AND from 2-input NANDs Substituting ( () ) = () () = What happened to the Inverters at the output? 17

Logic Design 2013/9/5. Introduction. Logic circuits operate on digital signals

Introduction Logic Design Chapter 2: Introduction to Logic Circuits Logic circuits operate on digital signals Unlike continuous analog signals that have an infinite number of possible values, digital signals

Boolean Algebra Part 1

Boolean Algebra Part 1 Page 1 Boolean Algebra Objectives Understand Basic Boolean Algebra Relate Boolean Algebra to Logic Networks Prove Laws using Truth Tables Understand and Use First Basic Theorems

Digital Logic Design

Digital Logic Design ENGG1015 1 st Semester, 2010 Dr. Kenneth Wong Dr. Hayden So Department of Electrical and Electronic Engineering Determining output level from a diagram Implementing Circuits From Boolean

Computer Organization I. Lecture 8: Boolean Algebra and Circuit Optimization

Computer Organization I Lecture 8: Boolean Algebra and Circuit Optimization Overview The simplification from SOM to SOP and their circuit implementation Basics of Logic Circuit Optimization: Cost Criteria

WEEK 2.2 CANONICAL FORMS

WEEK 2.2 CANONICAL FORMS 1 Canonical Sum-of-Products (SOP) Given a truth table, we can ALWAYS write a logic expression for the function by taking the OR of the minterms for which the function is a 1. This

Points Addressed in this Lecture. Standard form of Boolean Expressions. Lecture 5: Logic Simplication & Karnaugh Map

Points Addressed in this Lecture Lecture 5: Logic Simplication & Karnaugh Map Professor Peter Cheung Department of EEE, Imperial College London (Floyd 4.5-4.) (Tocci 4.-4.5) Standard form of Boolean Expressions

BOOLEAN ALGEBRA & LOGIC GATES

BOOLEAN ALGEBRA & LOGIC GATES Logic gates are electronic circuits that can be used to implement the most elementary logic expressions, also known as Boolean expressions. The logic gate is the most basic

4.203 Write the truth table for each of the following logic functions:

3e4.5 4.201 According to DeMorgan s theorem, the complement of X + Y Z is X Y +Z. Yet both functions are 1 for XYZ = 110. How can both a function and its complement be 1 for the same input combination?

ENEE 244 (01**). Spring 2006. Homework 4. Due back in class on Friday, April 7.

ENEE 244 (**). Spring 26 Homework 4 Due back in class on Friday, April 7.. Implement the following Boolean expression with exclusive-or and AND gates only: F = AB'CD' + A'BCD' + AB'C'D + A'BC'D. F = AB

CSE140: Midterm 1 Solution and Rubric

CSE140: Midterm 1 Solution and Rubric April 23, 2014 1 Short Answers 1.1 True or (6pts) 1. A maxterm must include all input variables (1pt) True 2. A canonical product of sums is a product of minterms

EXPERIMENT NO.1:INTRODUCTION TO BASIC GATES AND LOGIC SIMPLIFICATION TECHNIQUES

DEPARTMENT OF ELECTRICAL AND ELECTROINC ENGINEERING BANGLADESH UNIVERSITY OF ENGINEERING & TECHNOLOGY EEE 304 : Digital Electronics Laboratory EXPERIMENT NO.1:INTRODUCTION TO BASIC GATES AND LOGIC SIMPLIFICATION

United States Naval Academy Electrical and Computer Engineering Department. EC262 Exam 1

United States Naval Academy Electrical and Computer Engineering Department EC262 Exam 29 September 2. Do a page check now. You should have pages (cover & questions). 2. Read all problems in their entirety.

Combinational Logic Circuits

Chapter 2 Combinational Logic Circuits J.J. Shann Chapter Overview 2-1 Binary Logic and Gates 2-2 Boolean Algebra 2-3 Standard Forms 2-4 Two-Level Circuit Optimization 2-5 Map Manipulation 補 充 資 料 :Quine-McCluskey

Chapter 4 BOOLEAN ALGEBRA AND THEOREMS, MIN TERMS AND MAX TERMS

Chapter 4 BOOLEAN ALGEBRA AND THEOREMS, MIN TERMS AND MAX TERMS Lesson 5 BOOLEAN EXPRESSION, TRUTH TABLE and product of the sums (POSs) [MAXTERMS] 2 Outline POS two variables cases POS for three variable

4 BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION

4 BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION BOOLEAN OPERATIONS AND EXPRESSIONS Variable, complement, and literal are terms used in Boolean algebra. A variable is a symbol used to represent a logical quantity.

CDA 3200 Digital Systems. Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012

CDA 3200 Digital Systems Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012 Outline Multi-Level Gate Circuits NAND and NOR Gates Design of Two-Level Circuits Using NAND and NOR Gates

Karnaugh Maps & Combinational Logic Design. ECE 152A Winter 2012

Karnaugh Maps & Combinational Logic Design ECE 52A Winter 22 Reading Assignment Brown and Vranesic 4 Optimized Implementation of Logic Functions 4. Karnaugh Map 4.2 Strategy for Minimization 4.2. Terminology

1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1.

File: chap04, Chapter 04 1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1. 2. True or False? A gate is a device that accepts a single input signal and produces one

CSE 220: Systems Fundamentals I Unit 7: Logic Gates; Digital Logic Design: Boolean Equations and Algebra

CSE 220: Systems Fundamentals I Unit 7: Logic Gates; Digital Logic Design: Boolean Equations and Algebra Logic Gates Logic gatesare simple digital circuits that take one or more binary inputs and produce

Gate-Level Minimization

Chapter 3 Gate-Level Minimization 3- Outline! Karnaugh Map Method! NAND and NOR Implementations! Other Two-Level Implementations! Exclusive-OR Function! Hardware Description Language 3-2 Why Logic Minimization?!

Reading and construction of logic gates

Reading and construction of logic gates A Boolean function is an expression formed with binary variables, a binary variable can take a value of 1 or 0. Boolean function may be represented as an algebraic

Chapter 4 Boolean Algebra and Logic Simplification

ETEC 23 Programmable Logic Devices Chapter 4 Boolean Algebra and Logic Simplification Shawnee State University Department of Industrial and Engineering Technologies Copyright 27 by Janna B. Gallaher Boolean

Analog & Digital Electronics Course No: PH-218

Analog & Digital Electronics Course No: PH-218 Lec-29: Combinational Logic Modules Course Instructor: Dr. A. P. VAJPEYI Department of Physics, Indian Institute of Technology Guwahati, India 1 Combinational

CS61c: Representations of Combinational Logic Circuits

CS61c: Representations of Combinational Logic Circuits J. Wawrzynek October 12, 2007 1 Introduction In the previous lecture we looked at the internal details of registers. We found that every register,

Karnaugh Maps (K Maps) K Maps with 3 and 4 Variables

Karnaugh Maps (K Maps) Karnugh map is a graphical representation of a truth table The map contains one cell for each possible minterm adjacent cells differ in onl one literal, i.e., or Two variables, F

Unit 3 Boolean Algebra (Continued)

Unit 3 Boolean Algebra (Continued) 1. Exclusive-OR Operation 2. Consensus Theorem Department of Communication Engineering, NCTU 1 3.1 Multiplying Out and Factoring Expressions Department of Communication

Gates, Circuits, and Boolean Algebra

Gates, Circuits, and Boolean Algebra Computers and Electricity A gate is a device that performs a basic operation on electrical signals Gates are combined into circuits to perform more complicated tasks

Boolean Algebra and Digital Logic

Null3 /7/3 4:35 PM Page 93 I ve alwas loved that word, Boolean. Claude Shannon CHAPTER 3 3. Boolean Algebra and Digital Logic INTRODUCTION eorge Boole lived in England during the time Abraham Lincoln was

Introduction to Logic Circuits

April 5, 999 4:05 g02-ch2 Sheet number Page number 7 black chapter 2 Introduction to Logic Circuits 2. d2 d4, d7 d5 7 April 5, 999 4:05 g02-ch2 Sheet number 2 Page number 8 black 8 CHAPTER 2 Introduction

Karnaugh Maps. Circuit-wise, this leads to a minimal two-level implementation

Karnaugh Maps Applications of Boolean logic to circuit design The basic Boolean operations are AND, OR and NOT These operations can be combined to form complex expressions, which can also be directly translated

Systems of Linear Equations: Solving by Substitution

8.3 Sstems of Linear Equations: Solving b Substitution 8.3 OBJECTIVES 1. Solve sstems using the substitution method 2. Solve applications of sstems of equations In Sections 8.1 and 8.2, we looked at graphing

Study Guide. Part 1,Combinational Logic Questions. 1.1 Implicants. ab cd

8-24 Fun of CE 8-24 Study Guide Part,Combinational Logic Questions This study guide is provided as an aid in helping you to study for the ECE Department s 8-24, Fundamentals of Computer Engineering. The

Elementary Logic Gates

Elementary Logic Gates Name Symbol Inverter (NOT Gate) ND Gate OR Gate Truth Table Logic Equation = = = = = + C. E. Stroud Combinational Logic Design (/6) Other Elementary Logic Gates NND Gate NOR Gate

Boolean Algebra (cont d) UNIT 3 BOOLEAN ALGEBRA (CONT D) Guidelines for Multiplying Out and Factoring. Objectives. Iris Hui-Ru Jiang Spring 2010

Boolean Algebra (cont d) 2 Contents Multiplying out and factoring expressions Exclusive-OR and Exclusive-NOR operations The consensus theorem Summary of algebraic simplification Proving validity of an

CSEE 3827: Fundamentals of Computer Systems. Standard Forms and Simplification with Karnaugh Maps

CSEE 3827: Fundamentals of Computer Systems Standard Forms and Simplification with Karnaugh Maps Agenda (M&K 2.3-2.5) Standard Forms Product-of-Sums (PoS) Sum-of-Products (SoP) converting between Min-terms

Implementation of SOP and POS Form Logic Functions

Implementation of SOP and POS Form Logic Functions By: Dr. A. D. Johnson Lab Assignment #3 EECS: 1100 Digital Logic Design The University of Toledo 1. Objectives - becoming familiar with two standard forms

CH3 Boolean Algebra (cont d)

CH3 Boolean Algebra (cont d) Lecturer: 吳 安 宇 Date:2005/10/7 ACCESS IC LAB v Today, you ll know: Introduction 1. Guidelines for multiplying out/factoring expressions 2. Exclusive-OR and Equivalence operations

A Little Perspective Combinational Logic Circuits

A Little Perspective Combinational Logic Circuits COMP 251 Computer Organization and Architecture Fall 2009 Motivating Example Recall our machine s architecture: A Simple ALU Consider an ALU that can perform

Gates, Circuits and Boolean Functions

Lecture 2 Gates, Circuits and Boolean Functions DOC 112: Hardware Lecture 2 Slide 1 In this lecture we will: Introduce an electronic representation of Boolean operators called digital gates. Define a schematic

LAB 2: BOOLEAN THEOREMS

LAB 2: BOOLEAN THEOREMS OBJECTIVES 1. To implement DeMorgan's theorems in circuit simplification. 2. To design a combinational logic circuit with simplest logic gates representation using Karnaugh Mapping

Digital Logic Design 1. Truth Tables. Truth Tables. OR Operation With OR Gates

2007 oolean Constants and Variables K TP.HCM Tran Ngoc Thinh HCMC University of Technology http://www.cse.hcmut.edu.vn/~tnthinh oolean algebra is an important tool in describing, analyzing, designing,

2.0 Chapter Overview. 2.1 Boolean Algebra

Thi d t t d ith F M k 4 0 2 Boolean Algebra Chapter Two Logic circuits are the basis for modern digital computer systems. To appreciate how computer systems operate you will need to understand digital

MATH 102 College Algebra

FACTORING Factoring polnomials ls is simpl the reverse process of the special product formulas. Thus, the reverse process of special product formulas will be used to factor polnomials. To factor polnomials

Part 1: Logic Design. Tutorial

CPIT2 : Computer Organization and Architecture Course Lectures by Prof. Mohamed Khamis Part : Logic Design Tutorial by Teaching Assistant. Khalid Alharbi Department of Information Technology Faculty of

Chapter 4. Gates and Circuits. Chapter Goals. Chapter Goals. Computers and Electricity. Computers and Electricity. Gates

Chapter Goals Chapter 4 Gates and Circuits Identify the basic gates and describe the behavior of each Describe how gates are implemented using transistors Combine basic gates into circuits Describe the

Basic Logic Gates Richard E. Haskell

BASIC LOGIC GATES 1 E Basic Logic Gates Richard E. Haskell All digital systems are made from a few basic digital circuits that we call logic gates. These circuits perform the basic logic functions that

ENEE244 (sec ) Spring Time alloted: 50 minutes. Student ID: Maximum score: 50 points

ENEE244 (sec -4) Spring 26 Midterm Examination II Pages: 7 printed sides Name: Answer key Time alloted: 5 minutes. Student ID: Maximum score: 5 points University rules dictate strict penalties for any

Boolean Algebra and Digital Circuits Part 3: Logic Gates and Combinatorial Circuits

Boolean Algebra and Digital Circuits Part 3: Logic Gates and Combinatorial Circuits Logic Gates a gate implements a simple boolean function such as AND, OR or NOT constructed using a few transistors basic

ELEC2200 Digital Circuits and Systems Fall 2016 Instructor: Levent Yobas

Lecture 3b 1 ELEC2200 Digital Circuits and Systems Fall 2016 Instructor: Levent Yobas Lecture 3b Gate Level Implementation Lecture 3b 2 Lecture Overview Implementations Using AND-OR, OR- AND Using NAND-NAND,

Boolean Algebra. Boolean Algebra. Boolean Algebra. Boolean Algebra

2 Ver..4 George Boole was an English mathematician of XIX century can operate on logic (or Boolean) variables that can assume just 2 values: /, true/false, on/off, closed/open Usually value is associated

Reteaching Masters. To jump to a location in this book. 1. Click a bookmark on the left. To print a part of the book. 1. Click the Print button.

Reteaching Masters To jump to a location in this book. Click a bookmark on the left. To print a part of the book. Click the Print button.. When the Print window opens, tpe in a range of pages to print.

Section 7.2 Linear Programming: The Graphical Method

Section 7.2 Linear Programming: The Graphical Method Man problems in business, science, and economics involve finding the optimal value of a function (for instance, the maimum value of the profit function

inputs output Complementary CMOS Comlementary CMOS Logic Gates: nmos pull-down network pmos pull-up network Static CMOS

Complementary CMOS Comlementary CMOS Logic Gates: nmos pull-down network pmos pull-up network Static CMOS inputs pmos pull-up network nmos pull-down network output Pull-up O Pull-up ON Pull-down O Z (float)

Interpreting Logic Gates

Logic gates are the mechanism used to convert Boolean logic into the circuitry the computer needs to solve such problems. We have learned about three(3) different gates. The AND Gate takes two or more

Exclusive OR/Exclusive NOR (XOR/XNOR)

Exclusive OR/Exclusive NOR (XOR/XNOR) XOR and XNOR are useful logic functions. Both have two or more inputs. The truth table for two inputs is shown at right. a XOR b = 1 if and only if (iff) a b. a XNOR

Comp 150 Booleans and Digital Logic

Comp 150 Booleans and Digital Logic Recall the bool date type in Python has the two literals True and False and the three operations: not, and, or. The operations are defined by truth tables (see page

FORDHAM UNIVERSITY CISC 3593. Dept. of Computer and Info. Science Spring, 2011. The Binary Adder

FORDHAM UNIVERITY CIC 3593 Fordham College Lincoln Center Computer Organization Dept. of Computer and Info. cience pring, 2011 1 Introduction The Binar Adder The binar adder circuit is an important building

Digital Fundamentals

Digital Fundamentals Tenth Edition Floyd hapter 5 2009 Pearson Education, Upper 2008 Pearson Saddle River, Education NJ 07458. ll Rights Reserved Summary ombinational Logic ircuits In Sum-of-Products (SOP)

Quine-McClusky Minimization Procedure

Quine-McClusky Minimization Procedure This is basically a tabular method of minimization and as much it is suitable for computer applications. The procedure for optimization as follows: Step : Describe

Chapter 2 Combinational Logic Circuits

Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 3 Additional Gates and Circuits Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. Overview Part 1 Gate Circuits

Graphing Nonlinear Systems

10.4 Graphing Nonlinear Sstems 10.4 OBJECTIVES 1. Graph a sstem of nonlinear equations 2. Find ordered pairs associated with the solution set of a nonlinear sstem 3. Graph a sstem of nonlinear inequalities

Switching Circuits & Logic Design

Switching Circuits & Logic Design Jie-Hong Roland Jiang 江介宏 Department of Electrical Engineering National Taiwan University Fall 23 2 oolean lgebra 2 Outline Introduction asic operations oolean expressions

Zero and Negative Exponents and Scientific Notation. a a n a m n. Now, suppose that we allow m to equal n. We then have. a am m a 0 (1) a m

0. E a m p l e 666SECTION 0. OBJECTIVES. Define the zero eponent. Simplif epressions with negative eponents. Write a number in scientific notation. Solve an application of scientific notation We must have

Programmable Logic Devices (PLDs)

Programmable Logic Devices (PLDs) Lesson Objectives: In this lesson you will be introduced to some types of Programmable Logic Devices (PLDs): PROM, PAL, PLA, CPLDs, FPGAs, etc. How to implement digital

The equation for the 3-input XOR gate is derived as follows

The equation for the 3-input XOR gate is derived as follows The last four product terms in the above derivation are the four 1-minterms in the 3-input XOR truth table. For 3 or more inputs, the XOR gate

6.3 Polar Coordinates

6 Polar Coordinates Section 6 Notes Page 1 In this section we will learn a new coordinate sstem In this sstem we plot a point in the form r, As shown in the picture below ou first draw angle in standard

Simplifying Logic Circuits with Karnaugh Maps

Simplifying Logic Circuits with Karnaugh Maps The circuit at the top right is the logic equivalent of the Boolean expression: f = abc + abc + abc Now, as we have seen, this expression can be simplified

Basics of Digital Logic Design

CSE 675.2: Introduction to Computer Architecture Basics of Digital Logic Design Presentation D Study: B., B2, B.3 Slides by Gojko Babi From transistors to chips Chips from the bottom up: Basic building

SECTION 2.2. Distance and Midpoint Formulas; Circles

SECTION. Objectives. Find the distance between two points.. Find the midpoint of a line segment.. Write the standard form of a circle s equation.. Give the center and radius of a circle whose equation

ECE Digital Logic Design. Laboratory Manual

ECE 1315 Digital Logic Design Laboratory Manual Guide to Assembling your Circuits Dr. Fernando Ríos-Gutiérrez Dr. Rocio Alba-Flores Dr. Chris Carroll Department of Electrical and Computer Engineering University

Sum of Products (SOP) Expressions

Sum of Products (SOP) Expressions The Sum of Products (SOP) form of Boolean expressions and equations contains a list of terms (called minterms) in which all variables are ANDed (products). These minterms

C1: Coordinate geometry of straight lines

B_Chap0_08-05.qd 5/6/04 0:4 am Page 8 CHAPTER C: Coordinate geometr of straight lines Learning objectives After studing this chapter, ou should be able to: use the language of coordinate geometr find the

SECTION 5-1 Exponential Functions

354 5 Eponential and Logarithmic Functions Most of the functions we have considered so far have been polnomial and rational functions, with a few others involving roots or powers of polnomial or rational

Section 5: The Jacobian matrix and applications. S1: Motivation S2: Jacobian matrix + differentiability S3: The chain rule S4: Inverse functions

Section 5: The Jacobian matri and applications. S1: Motivation S2: Jacobian matri + differentiabilit S3: The chain rule S4: Inverse functions Images from Thomas calculus b Thomas, Wier, Hass & Giordano,

Logic in Computer Science: Logic Gates

Logic in Computer Science: Logic Gates Lila Kari The University of Western Ontario Logic in Computer Science: Logic Gates CS2209, Applied Logic for Computer Science 1 / 49 Logic and bit operations Computers

ON THE USE OF ASHENHURST DECOMPOSITION CHART AS AN ALTERNATIVE TO ALGORITHMIC TECHNIQUES IN THE SYNTHESIS OF MULTIPLEXER-BASED LOGIC CIRCUITS

Nigerian Journal of Technology, Vol. 18, No. 1, September, 1997 OSUAGWU 28 ON THE USE OF ASHENHURST DECOMPOSITION CHART AS AN ALTERNATIVE TO ALGORITHMIC TECHNIQUES IN THE SYNTHESIS OF MULTIPLEXER-BASED

LESSON EIII.E EXPONENTS AND LOGARITHMS

LESSON EIII.E EXPONENTS AND LOGARITHMS LESSON EIII.E EXPONENTS AND LOGARITHMS OVERVIEW Here s what ou ll learn in this lesson: Eponential Functions a. Graphing eponential functions b. Applications of eponential

VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur

VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203. DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING QUESTION BANK SUBJECT CODE/NAME YEAR/ SEMESTER : EC6302/ DIGITAL ELECTRONICS : II

Lecture 5: Gate Logic Logic Optimization

Lecture 5: Gate Logic Logic Optimization MAH, AEN EE271 Lecture 5 1 Overview Reading McCluskey, Logic Design Principles- or any text in boolean algebra Introduction We could design at the level of irsim

Introduction to Matrices for Engineers

Introduction to Matrices for Engineers C.T.J. Dodson, School of Mathematics, Manchester Universit 1 What is a Matrix? A matrix is a rectangular arra of elements, usuall numbers, e.g. 1 0-8 4 0-1 1 0 11

Points Addressed in this Lecture Lecture 3: Basic Logic Gates & Boolean Expressions Professor Peter Cheung Department of EEE, Imperial College London (Floyd 3.1-3.5, 4.1) (Tocci 3.1-3.9) What are the basic

Simplification of Rational Expressions and Functions

7.1 Simplification of Rational Epressions and Functions 7.1 OBJECTIVES 1. Simplif a rational epression 2. Identif a rational function 3. Simplif a rational function 4. Graph a rational function Our work

Chapter 4. Combinational Logic. Outline. ! Combinational Circuits. ! Analysis and Design Procedures. ! Binary Adders. ! Other Arithmetic Circuits

Chapter 4 Combinational Logic 4- Outline! Combinational Circuits! Analysis and Design Procedures! Binary Adders! Other Arithmetic Circuits! Decoders and Encoders! Multiplexers 4-2 Combinational v.s Sequential

12.3 Inverse Matrices

2.3 Inverse Matrices Two matrices A A are called inverses if AA I A A I where I denotes the identit matrix of the appropriate size. For example, the matrices A 3 7 2 5 A 5 7 2 3 If we think of the identit

5.2 Inverse Functions

78 Further Topics in Functions. Inverse Functions Thinking of a function as a process like we did in Section., in this section we seek another function which might reverse that process. As in real life,

UNIT I NUMBER SYSTEM AND BINARY CODES

1 UNIT I NUMBER SYSTEM AND BINARY CODES 1.0 Aims and Objectives 1.1 Introduction 1.2 Number System 1.2.1 Decimal Number System 1.2.2 Bi-stable Devices 1.2.3 Binary Number System 1.2.4 Octal number System

Alex and Morgan were asked to graph the equation y = 2x + 1

Which is better? Ale and Morgan were asked to graph the equation = 2 + 1 Ale s make a table of values wa Morgan s use the slope and -intercept wa First, I made a table. I chose some -values, then plugged

Understanding Logic Design

Understanding Logic Design ppendix of your Textbook does not have the needed background information. This document supplements it. When you write add DD R0, R1, R2, you imagine something like this: R1

Switching Algebra and Logic Gates

Chapter 2 Switching Algebra and Logic Gates The word algebra in the title of this chapter should alert you that more mathematics is coming. No doubt, some of you are itching to get on with digital design

0 The Quadratic Function TERMINOLOGY Ais of smmetr: A line about which two parts of a graph are smmetrical. One half of the graph is a reflection of the other Coefficient: A constant multiplied b a pronumeral

UNIT - II LOGIC GATES AND GATES CLASSIFICATION

UNIT - II Logic Gates: Gates Classifications: Basic Gates (AND, OR, NOT), Universal Gates (NAND, NOR), Exclusive Gates (XOR, XNOR)(except circuit diagram) Logic Symbols, Logic Operators, Logical expression

28. Minimize the following using Tabular method. f(a, b, c, d, e)= m(0,1,9,15,24,29,30) + d(8,11,31) 29. Minimize the following using K-map method.

Unit-1 1. Show Karnaugh map for equation Y = F(A,B,C) = S m(1, 2, 3, 6, 7) 2. Show Karnaugh map for equation Y = F(A,B,C,D) = S m(1, 2, 3, 6, 8, 9, 10, 12, 13, 14) 3. Give SOP form of Y = F(A,B,C,D) =

Gates & Boolean Algebra. Boolean Operators. Combinational Logic. Introduction

Introduction Gates & Boolean lgebra Boolean algebra: named after mathematician George Boole (85 864). 2-valued algebra. digital circuit can have one of 2 values. Signal between and volt =, between 4 and

DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING

DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING Lab Manual Digital Electronics Laboratory (EC-39) BACHELOR OF TECHNOLOGY Subject Code: EC 39 Subject Name: Digital Electronics Laboratory Teaching

MULTIPLE REPRESENTATIONS through 4.1.7

MULTIPLE REPRESENTATIONS 4.1.1 through 4.1.7 The first part of Chapter 4 ties together several was to represent the same relationship. The basis for an relationship is a consistent pattern that connects

Basics of Digital Systems. Boolean algebra Truth tables Karnaugh maps

Basics of Digital Systems Boolean algebra Truth tables Karnaugh maps Boolean Algebra In digital systems we deal with the binary number system. This means that the value of an element can be either 0 or

1. Digital Logic Circuits

1 Digital Logic ircuits 1. Digital Logic ircuits Many scientific, industrial and commercial advances have been made possible by the advent of computers. Digital Logic ircuits form the basis of any digital

ELEC 1041 Digital Electronics. Tutorial: Combinational Logic Design Examples Saeid Nooshabadi. Problem #1.

Problem #1 ELEC 1041 Digital Electronics Tutorial: Combinational Logic Design Examples Saeid Nooshabadi http://subjects.ee.unsw.edu.au/~elec1041 Develop a minimized Boolean implementation of a ones count