Chapter 2: Princess Sumaya Univ. Computer Engineering Dept.


 Anabel Holmes
 1 years ago
 Views:
Transcription
1 hapter 2: Princess Sumaya Univ. omputer Engineering Dept.
2 Basic Definitions Binary Operators AND z = x y = x y z=1 if x=1 AND y=1 OR z = x + y z=1 if x=1 OR y=1 NOT z = x = x z=1 if x=0 Boolean Algebra Binary Variables: only 0 and 1 values Algebraic Manipulation 1 / 28
3 Boolean Algebra Postulates ommutative Law x y = y x x + y = y + x Identity Element x 1 = x x + 0 = x omplement x x = 0 x + x = 1 2 / 28
4 Boolean Algebra Theorems Duality The dual of a Boolean algebraic expression is obtained by interchanging the AND and the OR operators and replacing the 1 s by 0 s and the 0 s by 1 s. x ( y + z ) = ( x y ) + ( x z ) x + ( y z ) = ( x + y ) ( x + z ) Theorem 1 x x = x x + x = x Applied to a valid equation produces a valid equation Theorem 2 x 0 = 0 x + 1 = 1 3 / 28
5 Boolean Algebra Theorems Theorem 3: Involution ( x ) = x ( x ) = x Theorem 4: Associative & Distributive ( x y ) z = x ( y z ) ( x + y ) + z = x + ( y + z ) x ( y + z ) = ( x y ) + ( x z ) x + ( y z ) = ( x + y ) ( x + z ) Theorem 5: DeMorgan ( x y ) = x + y ( x + y ) = x y ( x y ) = x + y ( x + y ) = x y Theorem 6: Absorption x ( x + y ) = x x + ( x y ) = x 4 / 28
6 Operator Precedence Parentheses NOT (... ) (...) x + y AND OR x + x y x [ y + z ( w + x)] ( w + x) ( w z ( w y + z ( w x [ y + z ( w + x) + x) + x) + x)] 5 / 28
7 DeMorgan s Theorem a [ b + c ( d + e )] a + [ b + c ( d + e )] a + b ( c ( d + e )) a + b ( c + ( d + e )) a + b ( c + ( d e)) a + b ( c + d e) 6 / 28
8 Boolean Functions Boolean Expression Example: Truth Table F = x + y z All possible combinations of input variables Logic ircuit x y z F x y z F / 28
9 Algebraic Manipulation Literal: A single variable within a term that may be complemented or not. Use Boolean Algebra to simplify Boolean functions to produce simpler circuits Example: Simplify to a minimum number of literals F = x + x y = x + ( x y ) = ( x + x ) ( x + y ) ( 3 Literals) Distributive law (+ over ) = ( 1 ) ( x + y ) = x + y ( 2 Literals) 8 / 28
10 9 / 28 omplement of a Function DeMorgan s Theorm Duality & Literal omplement B A F + + = B A F + + = B A F = B A F + + = B A F B A F =
11 anonical Forms Minterm Product (AND function) ontains all variables Evaluates to 1 for a specific combination Example A = 0 A B B = 0 (0) (0) (0) = = 1 A B m m m m m m m m 7 Minterm A B A B A B A B A B A B A B A B 10 / 28
12 anonical Forms Maxterm Sum (OR function) ontains all variables Evaluates to 0 for a specific combination Example A = 1 A B B = 1 (1) + (1) + (1) = = 0 A B M M M M M M M M 7 Maxterm A + B + A + B + A + B + A + B + A + B + A + B + A + B + A + B + 11 / 28
13 anonical Forms Truth Table to Boolean Function A B F F = AB + AB + AB + AB / 28
14 anonical Forms Sum of Minterms F = AB + AB + AB + AB F = m + m + m + F m7 = (1,4,5,7) Product of Maxterms F = AB + AB + AB + F = AB + AB + AB + AB AB A B F F = AB AB AB AB F = ( A + B + )( A + B + )( A + B + )( A + B + ) F = M 0 M 2 M 3 M 6 F = (0,2,3,6) F / 28
15 Standard Forms Sum of Products (SOP) AB( + ) = AB(1) F = AB + AB + AB + AB = AB A( B + B) = A B ( A + A) = B F = B ( A + A) + AB( + ) + A( B + B) F = B + AB + A 14 / 28
16 Standard Forms Product of Sums (POS) A B( + ) F = AB + AB + AB + AB B ( A + A) A ( B + B) F = A( B + B) + AB( + ) + B( A + A) F = A + AB + B F = ( A + )( A + B)( B + ) 15 / 28
17 TwoLevel Implementations Sum of Products (SOP) F = B + AB + A Product of Sums (POS) F = ( A + )( A + B)( B + ) B A B A A A B B F F 16 / 28
18 Logic Operators AND x y x y x y AND NAND (Not AND) x y NAND x y x y / 28
19 Logic Operators OR x y x + y x y OR NOR (Not OR) x y x + y x y NOR / 28
20 Logic Operators XOR (ExclusiveOR) x y x y x y + x y x y XOR XNOR (ExclusiveNOR) (Equivalence) x y x y x y x y + x y x y XNOR / 28
21 Logic Operators NOT (Inverter) x NOT x x Buffer x Buffer x x / 28
22 Multiple Input Gates 21 / 28
23 DeMorgan s Theorem on Gates AND Gate F = x y F = (x y) F = x + y OR Gate F = x + y F = (x + y) F = x y hange the Shape and bubble all lines 22 / 28
24 Homework Mano hapter / 28
25 Homework Mano 24 Reduce the following Boolean expressions to the indicated number of literals: (a) A + AB + A (b) (x y + z) + z + xy + wz (c) A B (D + D) + B (A + A D) (d) (A + ) (A + ) (A + B + D) to three literals to three literals to one literal to four literals 25 Find the complement of F = x + yz; then show that FF = 0 and F + F = 1 24 / 28
26 Homework 26 Find the complement of the following expressions: (a) xy + x y (c) (x + y + z) (x + z ) (x + y) (b) (AB + )D + E 28 List the truth table of the function: F = xy + xy + y z 29 Logical operations can be performed on strings of bits by considering each pair of corresponding bits separately (this is called bitwise operation). Given two 8bit strings A = and B = , evaluate the 8bit result after the following logical operations: (a) AND, (b) OR, (c) XOR, (d) NOT A, (e) NOT B. 25 / 28
27 Homework 210 Draw the logic diagrams for the following Boolean expressions: (a) Y = A B + B (A + ) (b) Y = B + A (c) Y = A + D (d) Y = (A + B) ( + D) 212 Simplify the Boolean function T 1 and T 2 to a minimum number of literals. A B T 1 T / 28
28 Homework 215 Given the Boolean function F = xy z + x y z + w xy + wx y + wxy (a) Obtain the truth table of the function. (b) Draw the logic diagram using the original Boolean expression. (c) Simplify the function to a minimum number of literals using Boolean algebra. (d) Obtain the truth table of the function from the simplified expression and show that it is the same as the one in part (a) (e) Draw the logic diagram from the simplified expression and compare the total number of gates with the diagram of part (b). 27 / 28
29 Homework 218 onvert the following to the other canonical form: (a) F (x, y, z) = (1, 3, 7) (b) F (A, B,, D) = (0, 1, 2, 3, 4, 6, 12) 219 onvert the following expressions into sum of products and product of sums: (a) (AB + ) (B + D) (b) x + x (x + y ) (y + z ) 28 / 28
CS 121 Digital Logic Design. Chapter 2. Teacher Assistant. Hanin Abdulrahman
CS 121 Digital Logic Design Chapter 2 Teacher Assistant Hanin Abdulrahman 1 2 Outline 2.2 Basic Definitions 2.3 Axiomatic Definition of Boolean Algebra. 2.4 Basic Theorems and Properties 2.5 Boolean Functions
More informationMC9211 Computer Organization
MC92 Computer Organization Unit : Digital Fundamentals Lesson2 : Boolean Algebra and Simplification (KSB) (MCA) (292/ODD) (29  / A&B) Coverage Lesson2 Introduces the basic postulates of Boolean Algebra
More informationBoolean Algebra and Logic Simplification
S302 Digital Logic Design Boolean Algebra and Logic Simplification Boolean Analysis of Logic ircuits, evaluating of Boolean expressions, representing the operation of Logic circuits and Boolean expressions
More informationLogic Design. Chapter 2: Introduction to Logic Circuits
Logic Design Chapter 2: Introduction to Logic Circuits Introduction Logic circuits perform operation on digital signal Digital signal: signal values are restricted to a few discrete values Binary logic
More informationChapter 2 Boolean Algebra and Logic Gates
Chapter 2 Boolean Algebra and Logic Gates Huntington Postulates 1. (a) Closure w.r.t. +. (b) Closure w.r.t.. 2. (a) Identity element 0 w.r.t. +. x + 0 = 0 + x = x. (b) Identity element 1 w.r.t.. x 1 =
More informationWEEK 2.1 BOOLEAN ALGEBRA
WEEK 2.1 BOOLEAN ALGEBRA 1 Boolean Algebra Boolean algebra was introduced in 1854 by George Boole and in 1938 was shown by C. E. Shannon to be useful for manipulating Boolean logic functions. The postulates
More informationLecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions
EE210: Switching Systems Lecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions Prof. YingLi Tian Feb. 15, 2018 Department of Electrical Engineering The City College of New York The
More informationChapter 2. Boolean Algebra and Logic Gates
Chapter 2 Boolean Algebra and Logic Gates Basic Definitions A binary operator defined on a set S of elements is a rule that assigns, to each pair of elements from S, a unique element from S. The most common
More informationThis form sometimes used in logic circuit, example:
Objectives: 1. Deriving of logical expression form truth tables. 2. Logical expression simplification methods: a. Algebraic manipulation. b. Karnaugh map (kmap). 1. Deriving of logical expression from
More informationChapter 2: Boolean Algebra and Logic Gates
Chapter 2: Boolean Algebra and Logic Gates Mathematical methods that simplify binary logics or circuits rely primarily on Boolean algebra. Boolean algebra: a set of elements, a set of operators, and a
More informationLearning Objectives. Boolean Algebra. In this chapter you will learn about:
Ref. Page Slide /78 Learning Objectives In this chapter you will learn about: oolean algebra Fundamental concepts and basic laws of oolean algebra oolean function and minimization Logic gates Logic circuits
More informationChapter 2 Boolean Algebra and Logic Gates
CSA051  Digital Systems 數位系統導論 Chapter 2 Boolean Algebra and Logic Gates 吳俊興國立高雄大學資訊工程學系 Chapter 2. Boolean Algebra and Logic Gates 21 Basic Definitions 22 Axiomatic Definition of Boolean Algebra 23
More informationEEA051  Digital Logic 數位邏輯 吳俊興高雄大學資訊工程學系. September 2004
EEA051  Digital Logic 數位邏輯 吳俊興高雄大學資訊工程學系 September 2004 Boolean Algebra (formulated by E.V. Huntington, 1904) A set of elements B={0,1} and two binary operators + and Huntington postulates 1. Closure
More informationENG2410 Digital Design Combinational Logic Circuits
ENG240 Digital Design Combinational Logic Circuits Fall 207 S. Areibi School of Engineering University of Guelph Binary variables Binary Logic Can be 0 or (T or F, low or high) Variables named with single
More informationLecture 2 Review on Digital Logic (Part 1)
Lecture 2 Review on Digital Logic (Part 1) Xuan Silvia Zhang Washington University in St. Louis http://classes.engineering.wustl.edu/ese461/ Grading Engagement 5% Review Quiz 10% Homework 10% Labs 40%
More informationCombinational Logic. Review of Combinational Logic 1
Combinational Logic! Switches > Boolean algebra! Representation of Boolean functions! Logic circuit elements  logic gates! Regular logic structures! Timing behavior of combinational logic! HDLs and combinational
More informationChapter 2 (Lect 2) Canonical and Standard Forms. Standard Form. Other Logic Operators Logic Gates. Sum of Minterms Product of Maxterms
Chapter 2 (Lect 2) Canonical and Standard Forms Sum of Minterms Product of Maxterms Standard Form Sum of products Product of sums Other Logic Operators Logic Gates Basic and Multiple Inputs Positive and
More informationBOOLEAN ALGEBRA TRUTH TABLE
BOOLEAN ALGEBRA TRUTH TABLE Truth table is a table which represents all the possible values of logical variables / statements along with all the possible results of the given combinations of values. Eg:
More informationChapter 2: Switching Algebra and Logic Circuits
Chapter 2: Switching Algebra and Logic Circuits Formal Foundation of Digital Design In 1854 George Boole published An investigation into the Laws of Thoughts Algebraic system with two values 0 and 1 Used
More informationECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 2 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Week 2 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering Boolean Algebra Boolean Algebra A Boolean algebra is defined with: A set of
More informationBoolean Algebra and Logic Gates
Boolean Algebra and Logic Gates ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall, 2017 ldvan@cs.nctu.edu.tw http://www.cs.nctu.edu.tw/~ldvan/ Outlines Basic
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Chapter 2  Part 1 2 Chapter 2  Part 1 3 Chapter 2  Part 1 4 Chapter 2  Part
More informationII. COMBINATIONAL LOGIC DESIGN.  algebra defined on a set of 2 elements, {0, 1}, with binary operators multiply (AND), add (OR), and invert (NOT):
ENGI 386 Digital Logic II. COMBINATIONAL LOGIC DESIGN Combinational Logic output of digital system is only dependent on current inputs (i.e., no memory) (a) Boolean Algebra  developed by George Boole
More informationDigital Logic Design. Malik Najmus Siraj
Digital Logic Design Malik Najmus Siraj siraj@case.edu.pkedu LECTURE 4 Today s Agenda Recap 2 s complement Binary Logic Boolean algebra Recap Computer Arithmetic Signed numbers Radix and diminished radix
More informationGoals for Lecture. Binary Logic and Gates (MK 2.1) Binary Variables. Notation Examples. Logical Operations
Introduction to Electrical Engineering, II LETURE NOTES #2 Instructor: Email: Telephone: Office: ndrew. Kahng (lecture) abk@ucsd.edu 8588224884 office 3802 P&M lass Website: http://vlsicad.ucsd.edu/courses/ece20b/wi04/
More informationCHAPTER1: Digital Logic Circuits Combination Circuits
CS224: Computer Organization S.KHABET CHAPTER1: Digital Logic Circuits Combination Circuits 1 PRIMITIVE LOGIC GATES Each of our basic operations can be implemented in hardware using a primitive logic gate.
More informationBoolean Algebra & Logic Gates. By : Ali Mustafa
Boolean Algebra & Logic Gates By : Ali Mustafa Digital Logic Gates There are three fundamental logical operations, from which all other functions, no matter how complex, can be derived. These Basic functions
More informationE&CE 223 Digital Circuits & Systems. Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev
E&CE 223 Digital Circuits & Systems Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev 4 of 92 Section 2: Boolean Algebra & Logic Gates Major topics Boolean algebra NAND & NOR gates Boolean
More informationEx: Boolean expression for majority function F = A'BC + AB'C + ABC ' + ABC.
Boolean Expression Forms: Sumofproducts (SOP) Write an AND term for each input combination that produces a 1 output. Write the input variable if its value is 1; write its complement otherwise. OR the
More information2009 Spring CS211 Digital Systems & Lab CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS
CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS What will we learn? 2 Logic functions and circuits Boolean Algebra Logic gates and Synthesis CAD tools and VHDL Read Section 2.9 and 2.0 Terminology 3 Digital
More informationCHAPTER III BOOLEAN ALGEBRA
CHAPTER III CHAPTER III CHAPTER III R.M. Dansereau; v.. CHAPTER III2 BOOLEAN VALUES INTRODUCTION BOOLEAN VALUES Boolean algebra is a form of algebra that deals with single digit binary values and variables.
More informationSignals and Systems Digital Logic System
Signals and Systems Digital Logic System Prof. Wonhee Kim Chapter 2 Design Process for Combinational Systems Step 1: Represent each of the inputs and outputs in binary Step 1.5: If necessary, break the
More informationIn Module 3, we have learned about Exclusive OR (XOR) gate. Boolean Expression AB + A B = Y also A B = Y. Logic Gate. Truth table
Module 8 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 A B Y 0 0 0 0 1 1 1 0 1 1 1 0 In Module 3, we have learned about
More informationChapter 2 Part 7 Combinational Logic Circuits
University of Wisconsin  Madison EE/omp Sci 352 Digital Systems Fundamentals Kewal K. Saluja and u Hen Hu Spring 2002 hapter 2 Part 7 ombinational Logic ircuits Originals by: harles R. Kime and Tom Kamisnski
More informationCombinational Logic Circuits Part II Theoretical Foundations
Combinational Logic Circuits Part II Theoretical Foundations Overview Boolean Algebra Basic Logic Operations Basic Identities Basic Principles, Properties, and Theorems Boolean Function and Representations
More informationNumber System conversions
Number System conversions Number Systems The system used to count discrete units is called number system. There are four systems of arithmetic which are often used in digital electronics. Decimal Number
More informationDigital Fundamentals
Digital Fundamentals Tenth Edition Floyd hapter 5 Modified by Yuttapong Jiraraksopakun Floyd, Digital Fundamentals, 10 th 2008 Pearson Education ENE, KMUTT ed 2009 2009 Pearson Education, Upper Saddle
More informationGray Code. ASCII Character Code. To convert the number from binary to Gray code the relations must be known. 1 1 = = = = 0
Gray Code To convert the number from binary to Gray code the relations must be known. = = = = Ex Convert the binary number ( ) into Gray Code? bit األول من جهة اليسار ومن ثم تطبق Gray لتحويل الرقم من صيغة
More informationDigital Circuit And Logic Design I. Lecture 3
Digital Circuit And Logic Design I Lecture 3 Outline Combinational Logic Design Principles (). Introduction 2. Switching algebra 3. Combinationalcircuit analysis 4. Combinationalcircuit synthesis Panupong
More informationCHAPTER III BOOLEAN ALGEBRA
CHAPTER III CHAPTER III CHAPTER III R.M. Dansereau; v.. CHAPTER III2 BOOLEAN VALUES INTRODUCTION BOOLEAN VALUES Boolean algebra is a form of algebra that deals with single digit binary values and variables.
More informationCombinational Logic Design Principles
Combinational Logic Design Principles Switching algebra Doru Todinca Department of Computers Politehnica University of Timisoara Outline Introduction Switching algebra Axioms of switching algebra Theorems
More informationUNIVERSITI TENAGA NASIONAL. College of Information Technology
UNIVERSITI TENAGA NASIONAL College of Information Technology BACHELOR OF COMPUTER SCIENCE (HONS.) FINAL EXAMINATION SEMESTER 2 2012/2013 DIGITAL SYSTEMS DESIGN (CSNB163) January 2013 Time allowed: 3 hours
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active
More informationUniversity of Technology
University of Technology Lecturer: Dr. Sinan Majid Course Title: microprocessors 4 th year معالجات دقيقة المرحلة الرابعة ھندسة الليزر والبصريات االلكترونية Lecture 3 & 4 Boolean Algebra and Logic Gates
More informationChapter 2 Boolean Algebra and Logic Gates
Chapter 2 Boolean Algebra and Logic Gates The most common postulates used to formulate various algebraic structures are: 1. Closure. N={1,2,3,4 }, for any a,b N we obtain a unique c N by the operation
More informationE&CE 223 Digital Circuits & Systems. Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev. Section 2: Boolean Algebra & Logic Gates
Digital Circuits & Systems Lecture Transparencies (Boolean lgebra & Logic Gates) M. Sachdev 4 of 92 Section 2: Boolean lgebra & Logic Gates Major topics Boolean algebra NND & NOR gates Boolean algebra
More informationCS 226: Digital Logic Design
CS 226: Digital Logic Design 0 1 1 I S 0 1 0 S Department of Computer Science and Engineering, Indian Institute of Technology Bombay. 1 of 29 Objectives In this lecture we will introduce: 1. Logic functions
More informationChapter 2 : Boolean Algebra and Logic Gates
Chapter 2 : Boolean Algebra and Logic Gates By Electrical Engineering Department College of Engineering King Saud University 14311432 2.1. Basic Definitions 2.2. Basic Theorems and Properties of Boolean
More informationComputer Organization I
Computer Organization I Lecture 6: Boolean Algebra /2/29 Wei Lu CS283 Overview Two Principles in Boolean Algebra () Duality Principle (2) Complement Principle Standard Form of Logic Expression () Sum of
More informationCMSC 313 Lecture 18 Midterm Exam returned Assign Homework 3 Circuits for Addition Digital Logic Components Programmable Logic Arrays
MS 33 Lecture 8 Midterm Exam returned Assign Homework 3 ircuits for Addition Digital Logic omponents Programmable Logic Arrays UMB, MS33, Richard hang MS 33, omputer Organization & Assembly
More informationUnit 2 Session  6 Combinational Logic Circuits
Objectives Unit 2 Session  6 Combinational Logic Circuits Draw 3 variable and 4 variable Karnaugh maps and use them to simplify Boolean expressions Understand don t Care Conditions Use the ProductofSums
More informationEECS150  Digital Design Lecture 19  Combinational Logic Circuits : A Deep Dive
EECS150  Digital Design Lecture 19  Combinational Logic Circuits : A Deep Dive March 30, 2010 John Wawrzynek Spring 2010 EECS150  Lec19cl1 Page 1 Boolean Algebra I (Representations of Combinational
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 3 Additional Gates and Circuits Overview Part 1 Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra
More informationSlide Set 3. for ENEL 353 Fall Steve Norman, PhD, PEng. Electrical & Computer Engineering Schulich School of Engineering University of Calgary
Slide Set 3 for ENEL 353 Fall 2016 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary Fall Term, 2016 SN s ENEL 353 Fall 2016 Slide Set 3 slide
More informationLogic Gate Level. Part 2
Logic Gate Level Part 2 Constructing Boolean expression from First method: write nonparenthesized OR of ANDs Each AND is a 1 in the result column of the truth table Works best for table with relatively
More informationCPE100: Digital Logic Design I
Chapter 2 Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu http://www.ee.unlv.edu/~b1morris/cpe100/ CPE100: Digital Logic Design I Section 1004: Dr. Morris Combinational Logic Design Chapter
More informationXOR  XNOR Gates. The graphic symbol and truth table of XOR gate is shown in the figure.
XOR  XNOR Gates Lesson Objectives: In addition to AND, OR, NOT, NAND and NOR gates, exclusiveor (XOR) and exclusivenor (XNOR) gates are also used in the design of digital circuits. These have special
More information211: Computer Architecture Summer 2016
211: Computer Architecture Summer 2016 Liu Liu Topic: Storage Project3 Digital Logic  Storage: Recap  Review: cache hit rate  Project3  Digital Logic:  truth table => SOP  simplification: Boolean
More informationEECS150  Digital Design Lecture 4  Boolean Algebra I (Representations of Combinational Logic Circuits)
EECS150  Digital Design Lecture 4  Boolean Algebra I (Representations of Combinational Logic Circuits) September 5, 2002 John Wawrzynek Fall 2002 EECS150 Lec4bool1 Page 1, 9/5 9am Outline Review of
More informationAdministrative Notes. Chapter 2 <9>
Administrative Notes Note: New homework instructions starting with HW03 Homework is due at the beginning of class Homework must be organized, legible (messy is not), and stapled to be graded Chapter 2
More informationOutline. EECS150  Digital Design Lecture 4  Boolean Algebra I (Representations of Combinational Logic Circuits) Combinational Logic (CL) Defined
EECS150  Digital Design Lecture 4  Boolean Algebra I (Representations of Combinational Logic Circuits) January 30, 2003 John Wawrzynek Outline Review of three representations for combinational logic:
More informationDIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA
DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA 1 Learning Objectives Understand the basic operations and laws of Boolean algebra. Relate these operations and laws to circuits composed of AND gates, OR gates, INVERTERS
More informationLecture 6: Gate Level Minimization Syed M. Mahmud, Ph.D ECE Department Wayne State University
Lecture 6: Gate Level Minimization Syed M. Mahmud, Ph.D ECE Department Wayne State University Original Source: Aby K George, ECE Department, Wayne State University Contents The Map method Two variable
More informationChapter2 BOOLEAN ALGEBRA
Chapter2 BOOLEAN ALGEBRA Introduction: An algebra that deals with binary number system is called Boolean Algebra. It is very power in designing logic circuits used by the processor of computer system.
More informationReview. EECS Components and Design Techniques for Digital Systems. Lec 06 Minimizing Boolean Logic 9/ Review: Canonical Forms
Review EECS 150  Components and Design Techniques for Digital Systems Lec 06 Minimizing Boolean Logic 9/1604 David Culler Electrical Engineering and Computer Sciences University of California, Berkeley
More informationXI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.
201718 XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL HALF ADDER 1. The circuit that performs addition within the Arithmetic and Logic Unit of the CPU are called adders. 2. A unit that adds two
More informationDigital Logic. Lecture 5  Chapter 2. Outline. Other Logic Gates and their uses. Other Logic Operations. CS 2420 Husain Gholoom  lecturer Page 1
Lecture 5  Chapter 2 Outline Other Logic Gates and their uses Other Logic Operations CS 2420 Husain Gholoom  lecturer Page 1 Digital logic gates CS 2420 Husain Gholoom  lecturer Page 2 Buffer A buffer
More informationEEE130 Digital Electronics I Lecture #4
EEE130 Digital Electronics I Lecture #4  Boolean Algebra and Logic Simplification  By Dr. Shahrel A. Suandi Topics to be discussed 41 Boolean Operations and Expressions 42 Laws and Rules of Boolean
More informationWeekI. Combinational Logic & Circuits
WeekI Combinational Logic & Circuits Overview Binary logic operations and gates Switching algebra Algebraic Minimization Standard forms Karnaugh Map Minimization Other logic operators IC families and
More informationStandard Expression Forms
ThisLecture will cover the following points: Canonical and Standard Forms MinTerms and MaxTerms Digital Logic Families 24 March 2010 Standard Expression Forms Two standard (canonical) expression forms
More informationECE 20B, Winter 2003 Introduction to Electrical Engineering, II LECTURE NOTES #2
ECE 20B, Winter 2003 Introduction to Electrical Engineering, II LECTURE NOTES #2 Instructor: Andrew B. Kahng (lecture) Email: abk@ucsd.edu Telephone: 8588224884 office, 8583530550 cell Office: 3802
More informationcontrol in out in out Figure 1. Binary switch: (a) opened or off; (b) closed or on.
Chapter 2 Digital Circuits Page 1 of 18 2. Digital Circuits Our world is an analog world. Measurements that we make of the physical objects around us are never in discrete units but rather in a continuous
More informationChapter 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. (Hyperlinks are active in
More informationBinary Logic and Gates. Our objective is to learn how to design digital circuits.
Binary Logic and Gates Introduction Our objective is to learn how to design digital circuits. These circuits use binary systems. Signals in such binary systems may represent only one of 2 possible values
More informationBinary Logic and Gates
1 COE 202 Digital Logic Binary Logic and Gates Dr. Abdulaziz Y. Barnawi COE Department KFUPM 2 Outline Introduction Boolean Algebra Elements of Boolean Algebra (Binary Logic) Logic Operations & Logic
More informationFunctions. Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways:
Boolean Algebra (1) Functions Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways: An expression is finite but not unique f(x,y)
More informationLecture 6: Manipulation of Algebraic Functions, Boolean Algebra, Karnaugh Maps
EE210: Switching Systems Lecture 6: Manipulation of Algebraic Functions, Boolean Algebra, Karnaugh Maps Prof. YingLi Tian Feb. 21/26, 2019 Department of Electrical Engineering The City College of New York
More informationBoolean Algebra and Digital Logic
All modern digital computers are dependent on circuits that implement Boolean functions. We shall discuss two classes of such circuits: Combinational and Sequential. The difference between the two types
More information1. Name the person who developed Boolean algebra
MATHEMATIC CENTER D96 MUNIRKA VILLAGE NEW DELHI 67 & VIKAS PURI NEW DELHI CONTACT FOR COACHING MATHEMATICS FOR TH 2TH NDA DIPLOMA SSC CAT SAT CPT CONTACT FOR ADMISSION GUIDANCE B.TECH BBA BCA, MCA MBA
More informationReview: Additional Boolean operations
Review: Additional Boolean operations Operation: NAND (NOTAND) NOR (NOTOR) XOR (exclusive OR) Expressions: (xy) = x + y (x + y) = x y x y = x y + xy Truth table: x y (xy) x y (x+y) x y x y 0 0 1 0 1
More information4 Switching Algebra 4.1 Axioms; Signals and Switching Algebra
4 Switching Algebra 4.1 Axioms; Signals and Switching Algebra To design a digital circuit that will perform a required function, it is necessary to manipulate and combine the various input signals in certain
More informationEE 110 Practice Problems for Exam 1: Solutions, Fall 2008
EE Practice Problems for Exam : Solutions, Fall 28. ircle T (true) or F (false) for each of these oolean equations. (a). T FO + = (b). T FO + = ( + )( + ) (c). TO F = (d). TO F () = () (e). TO F + + =
More informationEECS Variable Logic Functions
EECS150 Section 1 Introduction to Combinational Logic Fall 2001 2Variable Logic Functions There are 16 possible functions of 2 input variables: in general, there are 2**(2**n) functions of n inputs X
More informationChapter 7 Logic Circuits
Chapter 7 Logic Circuits Goal. Advantages of digital technology compared to analog technology. 2. Terminology of Digital Circuits. 3. Convert Numbers between Decimal, Binary and Other forms. 5. Binary
More informationEC121 Digital Logic Design
EC121 Digital Logic Design Lecture 2 [Updated on 020418] Boolean Algebra and Logic Gates Dr Hashim Ali Spring 2018 Department of Computer Science and Engineering HITEC University Taxila!1 Overview What
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT2: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 2 Following the slides of Dr. Ahmed H. Madian ذو الحجة 438 ه Winter
More informationLecture 4: More Boolean Algebra
Lecture 4: More Boolean Algebra Syed M. Mahmud, Ph.D ECE Department Wayne State University Original Source: Prof. Russell Tessier of University of Massachusetts Aby George of Wayne State University ENGIN2
More informationBoolean Algebra. Boolean Variables, Functions. NOT operation. AND operation. AND operation (cont). OR operation
oolean lgebra asic mathematics for the study of logic design is oolean lgebra asic laws of oolean lgebra will be implemented as switching devices called logic gates. Networks of Logic gates allow us to
More informationChap 2. Combinational Logic Circuits
Overview 2 Chap 2. Combinational Logic Circuits Spring 24 Part Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra Standard Forms Part 2 Circuit Optimization TwoLevel Optimization
More informationEXPERIMENT #4: SIMPLIFICATION OF BOOLEAN FUNCTIONS
EXPERIMENT #4: SIMPLIFICATION OF BOOLEAN FUNCTIONS OBJECTIVES: Simplify Boolean functions using Kmap method Obtain Boolean expressions from timing diagrams Design and implement logic circuits Equipment
More informationChapter 2 Boolean Algebra and Logic Gates
Ch1: Digital Systems and Binary Numbers Ch2: Ch3: GateLevel Minimization Ch4: Combinational Logic Ch5: Synchronous Sequential Logic Ch6: Registers and Counters Switching Theory & Logic Design Prof. Adnan
More informationCHAPTER 12 Boolean Algebra
318 Chapter 12 Boolean Algebra CHAPTER 12 Boolean Algebra SECTION 12.1 Boolean Functions 2. a) Since x 1 = x, the only solution is x = 0. b) Since 0 + 0 = 0 and 1 + 1 = 1, the only solution is x = 0. c)
More informationCombinational Logic Fundamentals
Topic 3: Combinational Logic Fundamentals In this note we will study combinational logic, which is the part of digital logic that uses Boolean algebra. All the concepts presented in combinational logic
More informationCHAPTER 2 BOOLEAN ALGEBRA
CHAPTER 2 BOOLEAN ALGEBRA This chapter in the book includes: Objectives Study Guide 2.1 Introduction 2.2 Basic Operations 2.3 Boolean Expressions and Truth Tables 2.4 Basic Theorems 2.5 Commutative, Associative,
More informationCMSC 313 Lecture 17. Focus Groups. Announcement: inclass lab Thu 10/30 Homework 3 Questions Circuits for Addition Midterm Exam returned
Focus Groups CMSC 33 Lecture 7 Need good sample of all types of CS students Mon /7 & Thu /2, 2:3p2:p & 6:p7:3p Announcement: inclass lab Thu /3 Homework 3 Questions Circuits for Addition Midterm Exam
More informationCombinatorial Logic Design Principles
Combinatorial Logic Design Principles ECGR2181 Chapter 4 Notes Logic System Design I 41 Boolean algebra a.k.a. switching algebra deals with boolean values  0, 1 Positivelogic convention analog voltages
More informationENGR 303 Introduction to Logic Design Lecture 3. Dr. Chuck Brown Engineering and Computer Information Science Folsom Lake College
Introduction to Logic Design Lecture 3 Dr. Chuck rown Engineering and Computer Information Science Folsom Lake College Outline for Todays Lecture Logic Circuits SOP / POS oolean Theorems DeMorgan s Theorem
More informationDiscrete Mathematics. CS204: Spring, Jong C. Park Computer Science Department KAIST
Discrete Mathematics CS204: Spring, 2008 Jong C. Park Computer Science Department KAIST Today s Topics Combinatorial Circuits Properties of Combinatorial Circuits Boolean Algebras Boolean Functions and
More informationDIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA (CONT.)
DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA (CONT.) 1 Learning Objectives 1. Apply the laws and theorems of Boolean algebra to to the manipulation of algebraic expressions to simplifying an expression, finding
More informationPossible logic functions of two variables
ombinational logic asic logic oolean algebra, proofs by rewriting, proofs by perfect induction logic functions, truth tables, and switches NOT, ND, OR, NND, NOR, OR,..., minimal set Logic realization
More information