Learning Objectives. Boolean Algebra. In this chapter you will learn about:
|
|
- Steven Farmer
- 5 years ago
- Views:
Transcription
1 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 and oolean expressions ombinational circuits and design Ref. Page 6 Slide 2/78 oolean lgebra n algebra that deals with binary number system George oole (85-864), an English mathematician, developed it for: Simplifying representation Manipulation of propositional logic In 938, laude E. Shannon proposed using oolean algebra in design of relay switching circuits Provides economical and straightforward approach Used extensively in designing electronic circuits used in computers Ref. Page 6 Slide 3/78
2 Fundamental oncepts of oolean lgebra Use of inary igit oolean equations can have either of two possible values, and Logical ddition Symbol +, also known as OR operator, used for logical addition. Follows law of binary addition Logical Multiplication Symbol., also known as N operator, used for logical multiplication. Follows law of binary multiplication omplementation Symbol -, also known as NOT operator, used for complementation. Follows law of binary compliment Ref. Page 6 Slide 4/78 Operator Precedence Each operator has a precedence level Higher the operator s precedence level, earlier it is evaluated Expression is scanned from left to right First, expressions enclosed within parentheses are evaluated Then, all complement (NOT) operations are performed Then, all (N) operations are performed Finally, all + (OR) operations are performed Ref. Page 62 Slide 5/78 Operator Precedence X + Y Z st 2 nd 3 rd Ref. Page 62 Slide 6/78 2
3 Postulates of oolean lgebra Postulate : (a) =, if and only if, is not equal to (b) =, if and only if, is not equal to Postulate 2: (a) x + = x (b) x = x Postulate 3: ommutative Law (a) x + y = y + x (b) x y = y x Ref. Page 62 Slide 7/78 Postulates of oolean lgebra Postulate 4: ssociative Law (a) x + (y + z) = (x + y) + z (b) x (y z) = (x y) z Postulate 5: istributive Law (a) x (y + z) = (x y) + (x z) (b) x + (y z) = (x + y) (x + z) Postulate 6: (a) x + x = (b) x x = Ref. Page 62 Slide 8/78 The Principle of uality There is a precise duality between the operators. (N) and + (OR), and the digits and. For example, in the table below, the second row is obtained from the first row and vice versa simply by interchanging + with. and with olumn olumn 2 olumn 3 Row + = + = + = + = Row 2 = = = = Therefore, if a particular theorem is proved, its dual theorem automatically holds and need not be proved separately Ref. Page 63 Slide 9/78 3
4 Some Important Theorems of oolean lgebra Sr. No. Theorems/ Identities ual Theorems/ Identities Name (if any) x + x = x x x = x Idempotent Law 2 x + = x = 3 x + x y = x x x + y = x bsorption Law 4 x = x Involution Law 5 x x + y = x y x + x y = x + y 6 x+ y = x y x y = x y+ e Morgan s Law Ref. Page 63 Slide /78 Methods of Proving Theorems The theorems of oolean algebra may be proved by using one of the following methods:. y using postulates to show that L.H.S. = R.H.S 2. y Perfect Induction or Exhaustive Enumeration method where all possible combinations of variables involved in L.H.S. and R.H.S. are checked to yield identical results 3. y the Principle of uality where the dual of an already proved theorem is derived from the proof of its corresponding pair Ref. Page 63 Slide /78 Proving a Theorem by Using Postulates (Example) Theorem: x + x y = x Proof: L.H.S. = x + x y = x + x y by postulate 2(b) = x ( + y) by postulate 5(a) = x (y + ) by postulate 3(a) = x by theorem 2(a) = x by postulate 2(b) = R.H.S. Ref. Page 64 Slide 2/78 4
5 Proving a Theorem by Perfect Induction (Example) Theorem: x + x y = x = x y x y x + x y Ref. Page 64 Slide 3/78 Proving a Theorem by the Principle of uality (Example) Theorem: Proof: x + x = x L.H.S. = x + x = (x + x) by postulate 2(b) = (x + x) (x + X) by postulate 6(a) = x + x X by postulate 5(b) = x + by postulate 6(b) = x by postulate 2(a) = R.H.S. Ref. Page 63 Slide 4/78 Proving a Theorem by the Principle of uality (Example) ual Theorem: Proof: x x = x L.H.S. = x x = x x + by postulate 2(a) = x x + x X by postulate 6(b) = x (x + X) by postulate 5(a) = x by postulate 6(a) = x by postulate 2(b) = R.H.S. Notice that each step of the proof of the dual theorem is derived from the proof of its corresponding pair in the original theorem Ref. Page 63 Slide 5/78 5
6 oolean Functions oolean function is an expression formed with: inary variables Operators (OR, N, and NOT) Parentheses, and equal sign The value of a oolean function can be either or oolean function may be represented as: n algebraic expression, or truth table Ref. Page 67 Slide 6/78 Representation as an lgebraic Expression W = X + Y Z Variable W is a function of X, Y, and Z, can also be written as W = f (X, Y, Z) The RHS of the equation is called an expression The symbols X, Y, Z are the literals of the function For a given oolean function, there may be more than one algebraic expressions Ref. Page 67 Slide 7/78 Representation as a Truth Table X Y Z W Ref. Page 67 Slide 8/78 6
7 Representation as a Truth Table The number of rows in the table is equal to 2 n, where n is the number of literals in the function The combinations of s and s for rows of this table are obtained from the binary numbers by counting from to 2 n - Ref. Page 67 Slide 9/78 Minimization of oolean Functions Minimization of oolean functions deals with Reduction in number of literals Reduction in number of terms Minimization is achieved through manipulating expression to obtain equal and simpler expression(s) (having fewer literals and/or terms) Ref. Page 68 Slide 2/78 Minimization of oolean Functions F = x y z + x y z + x y F has 3 literals (x, y, z) and 3 terms F = x y + x z 2 F 2 has 3 literals (x, y, z) and 2 terms F 2 can be realized with fewer electronic components, resulting in a cheaper circuit Ref. Page 68 Slide 2/78 7
8 Minimization of oolean Functions x y z F F 2 oth F and F 2 produce the same result Ref. Page 68 Slide 22/78 Try out some oolean Function Minimization (a) x + x y ( ) (b) x x + y (c) x y z + x y z + x y (d) x y + x z + y z ( + ) ( + ) ( + ) (e) x y x z y z Ref. Page 69 Slide 23/78 omplement of a oolean Function The complement of a oolean function is obtained by interchanging: Operators OR and N omplementing each literal This is based on e Morgan s theorems, whose general form is: = 2 3 n n =+ n n Ref. Page 7 Slide 24/78 8
9 omplementing a oolean Function (Example) F=xyz+xyz To obtain, we first interchange the OR and the N F operators giving ( x+y+z ) ( x+y+z) Now we complement each literal giving ( ) ( ) F=x+y+z x+y+z Ref. Page 7 Slide 25/78 anonical Forms of oolean Functions Minterms Maxterms : n variables forming an N term, with each variable being primed or unprimed, provide 2 n possible combinations called minterms or standard products : n variables forming an OR term, with each variable being primed or unprimed, provide 2 n possible combinations called maxterms or standard sums Ref. Page 7 Slide 26/78 x Variables y z Term Minterms and Maxterms for three Variables Minterms x y z x y z x y z x y z x y z x y z x y z x y z esignation m m m m m m m m Term Maxterms x + y + z x + y + z x + y + z x + y + z x + y + z x + y + z x + y + z x + y + z esignation Note that each minterm is the complement of its corresponding maxterm and vice-versa M M M M M M M M Ref. Page 7 Slide 27/78 9
10 Sum-of-Products (SOP) Expression sum-of-products (SOP) expression is a product term (minterm) or several product terms (minterms) logically added (ORed) together. Examples are: x x+yz xy+xy x+y xy+z xy+xyz Ref. Page 72 Slide 28/78 Steps to Express a oolean Function in its Sum-of-Products Form. onstruct a truth table for the given oolean function 2. Form a minterm for each combination of the variables, which produces a in the function 3. The desired expression is the sum (OR) of all the minterms obtained in Step 2 Ref. Page 72 Slide 29/78 Expressing a Function in its Sum-of-Products Form (Example) x y z F The following 3 combinations of the variables produce a :,, and Ref. Page 73 Slide 3/78
11 Expressing a Function in its Sum-of-Products Form (Example) Their corresponding minterms are: x y z, x y z, and x y z Taking the OR of these minterms, we get F=xy z+x y z+x y z=m +m + m F xy z =,4,7 4 7 ( ) ( ) Ref. Page 72 Slide 3/78 Product-of Sums (POS) Expression product-of-sums (POS) expression is a sum term (maxterm) or several sum terms (maxterms) logically multiplied (Ned) together. Examples are: x x+y ( x+y) z ( x+y) ( x+y) ( x+y) ( x+y)( x+y+z) ( x+y)( x+y) Ref. Page 74 Slide 32/78 Steps to Express a oolean Function in its Product-of-Sums Form. onstruct a truth table for the given oolean function 2. Form a maxterm for each combination of the variables, which produces a in the function 3. The desired expression is the product (N) of all the maxterms obtained in Step 2 Ref. Page 74 Slide 33/78
12 Expressing a Function in its Product-of-Sums Form x y z F The following 5 combinations of variables produce a :,,,, and Ref. Page 73 Slide 34/78 Expressing a Function in its Product-of-Sums Form Their corresponding maxterms are: ( ) ( ) ( ) ( x+y+z) and( x+y+z) x+y+z, x+y+z, x+y+z, Taking the N of these maxterms, we get: ( ) ( ) ( ) ( ) ( x+y+z) =M M2 M3 M5 M6 ( x,y,z) =Π(,2,3,5,6) F =x+y+z x+y+z x+y+z x+y+z F Ref. Page 74 Slide 35/78 onversion etween anonical Forms (Sum-of- Products and Product-of-Sums) To convert from one canonical form to another, interchange the symbol and list those numbers missing from the original form. Example: ( ) ( ) ( ) ( ) ( ) ( ) F x,y,z =Π,2,4,5 =Σ,3,6,7 F x,y,z =Σ,4,7 =Σ,2,3,5,6 Ref. Page 76 Slide 36/78 2
13 Logic Gates Logic gates are electronic circuits that operate on one or more input signals to produce standard output signal re the building blocks of all the circuits in a computer Some of the most basic and useful logic gates are N, OR, NOT, NN and NOR gates Ref. Page 77 Slide 37/78 N Gate Physical realization of logical multiplication (N) operation Generates an output signal of only if all input signals are also Ref. Page 77 Slide 38/78 N Gate (lock iagram Symbol and Truth Table) = Inputs Output = Ref. Page 77 Slide 39/78 3
14 OR Gate Physical realization of logical addition (OR) operation Generates an output signal of if at least one of the input signals is also Ref. Page 77 Slide 4/78 OR Gate (lock iagram Symbol and Truth Table) = + Inputs Output = + Ref. Page 78 Slide 4/78 NOT Gate Physical realization of complementation operation Generates an output signal, which is the reverse of the input signal Ref. Page 78 Slide 42/78 4
15 NOT Gate (lock iagram Symbol and Truth Table) Input Output Ref. Page 79 Slide 43/78 NN Gate omplemented N gate Generates an output signal of: if any one of the inputs is a when all the inputs are Ref. Page 79 Slide 44/78 NN Gate (lock iagram Symbol and Truth Table) = ==+ Inputs Output =+ Ref. Page 79 Slide 45/78 5
16 NOR Gate omplemented OR gate Generates an output signal of: only when all inputs are if any one of inputs is a Ref. Page 79 Slide 46/78 NOR Gate (lock iagram Symbol and Truth Table) = =+ = Inputs Output = Ref. Page 8 Slide 47/78 Logic ircuits When logic gates are interconnected to form a gating / logic network, it is known as a combinational logic circuit The oolean algebra expression for a given logic circuit can be derived by systematically progressing from input to output on the gates The three logic gates (N, OR, and NOT) are logically complete because any oolean expression can be realized as a logic circuit using only these three gates Ref. Page 8 Slide 48/78 6
17 Finding oolean Expression of a Logic ircuit (Example ) NOT = ( + ) OR + N Ref. Page 8 Slide 49/78 Finding oolean Expression of a Logic ircuit (Example 2) OR + ( ) ( ) = + N N NOT Ref. Page 8 Slide 5/78 onstructing a Logic ircuit from a oolean Expression (Example ) oolean Expression = + N OR + Ref. Page 83 Slide 5/78 7
18 onstructing a Logic ircuit from a oolean Expression (Example 2) oolean Expression = ++EF N NOT N N ++EF E F N EF NOT EF Ref. Page 83 Slide 52/78 Universal NN Gate NN gate is an universal gate, it is alone sufficient to implement any oolean expression To understand this, consider: asic logic gates (N, OR, and NOT) are logically complete Sufficient to show that N, OR, and NOT gates can be implemented with NN gates Ref. Page 84 Slide 53/78 Implementation of NOT, N and OR Gates by NN Gates =+= (a) NOT gate implementation. = (b) N gate implementation. Ref. Page 85 Slide 54/78 8
19 Implementation of NOT, N and OR Gates by NN Gates = = (c) OR gate implementation. = += + Ref. Page 85 Slide 55/78 Method of Implementing a oolean Expression with Only NN Gates Step : From the given algebraic expression, draw the logic diagram with N, OR, and NOT gates. ssume that both the normal () and complement ( ) inputs are available Step 2: raw a second logic diagram with the equivalent NN logic substituted for each N, OR, and NOT gate Step 3: Remove all pairs of cascaded inverters from the diagram as double inversion does not perform any logical function. lso remove inverters connected to single external inputs and complement the corresponding input variable Ref. Page 85 Slide 56/78 oolean Expression = Implementing a oolean Expression with Only NN Gates (Example) + ( + ) + ( + ) + ( + ) (a) Step : N/OR implementation Ref. Page 87 Slide 57/78 9
20 Implementing a oolean Expression with Only NN Gates (Example) N 5 OR 2 N 3 OR + ( + ) + N 4 ( + ) (b) Step 2: Substituting equivalent NN functions Ref. Page 87 Slide 58/78 Implementing a oolean Expression with Only NN Gates (Example) 2 5 ( +) (c) Step 3: NN implementation. Ref. Page 87 Slide 59/78 Universal NOR Gate NOR gate is an universal gate, it is alone sufficient to implement any oolean expression To understand this, consider: asic logic gates (N, OR, and NOT) are logically complete Sufficient to show that N, OR, and NOT gates can be implemented with NOR gates Ref. Page 89 Slide 6/78 2
21 Implementation of NOT, OR and N Gates by NOR Gates + = = (a) NOT gate implementation. + + = + (b) OR gate implementation. Ref. Page 89 Slide 6/78 Implementation of NOT, OR and N Gates by NOR Gates + = += = + = (c) N gate implementation. Ref. Page 89 Slide 62/78 Method of Implementing a oolean Expression with Only NOR Gates Step : For the given algebraic expression, draw the logic diagram with N, OR, and NOT gates. ssume that both the normal ( ) and complement ( ) inputs are available Step 2: raw a second logic diagram with equivalent NOR logic substituted for each N, OR, and NOT gate Step 3: Remove all parts of cascaded inverters from the diagram as double inversion does not perform any logical function. lso remove inverters connected to single external inputs and complement the corresponding input variable Ref. Page 89 Slide 63/78 2
22 Implementing a oolean Expression with Only NOR Gates (Examples) oolean Expression + + = + ( ) ( + ) (a) Step : N/OR implementation. ( + ) + Ref. Page 9 Slide 64/78 Implementing a oolean Expression with Only NOR Gates (Examples) 2 N N 3 OR OR + ( ) (b) Step 2: Substituting equivalent NOR functions. 4 N ( + ) Ref. Page 9 Slide 65/78 Implementing a oolean Expression with Only NOR Gates (Examples) (c) Step 3: NOR implementation. ( +) + Ref. Page 9 Slide 66/78 22
23 Exclusive-OR Function = + = =+ = =+ lso, ( ) = ( ) = Ref. Page 9 Slide 67/78 Exclusive-OR Function (Truth Table) Inputs Output = Ref. Page 92 Slide 68/78 Equivalence Function with lock iagram Symbol = + = = + lso, ( ) = ( ) = Ref. Page 9 Slide 69/78 23
24 Equivalence Function (Truth Table) Inputs Output = Ref. Page 92 Slide 7/78 Steps in esigning ombinational ircuits. State the given problem completely and exactly 2. Interpret the problem and determine the available input variables and required output variables 3. ssign a letter symbol to each input and output variables 4. esign the truth table that defines the required relations between inputs and outputs 5. Obtain the simplified oolean function for each output 6. raw the logic circuit diagram to implement the oolean function Ref. Page 93 Slide 7/78 esigning a ombinational ircuit Example Half-dder esign Inputs Outputs S S=+ = oolean functions for the two outputs. Ref. Page 93 Slide 72/78 24
25 esigning a ombinational ircuit Example Half-dder esign S=+ = Logic circuit diagram to implement the oolean functions Ref. Page 94 Slide 73/78 esigning a ombinational ircuit Example 2 Full-dder esign Inputs Truth table for a full adder Outputs S Ref. Page 94 Slide 74/78 esigning a ombinational ircuit Example 2 Full-dder esign oolean functions for the two outputs: S=+++ =+++ =++ (when simplified) Ref. Page 95 Slide 75/78 25
26 esigning a ombinational ircuit Example 2 Full-dder esign S (a) Logic circuit diagram for sums Ref. Page 95 Slide 76/78 esigning a ombinational ircuit Example 2 Full-dder esign (b) Logic circuit diagram for carry Ref. Page 95 Slide 77/78 Key Words/Phrases bsorption law N gate ssociative law oolean algebra oolean expression oolean functions oolean identities anonical forms for oolean functions ombination logic circuits umulative law omplement of a function omplementation e Morgan s law istributive law ual identities Equivalence function Exclusive-OR function Exhaustive enumeration method Half-adder Idempotent law Involution law Literal Logic circuits Logic gates Logical addition Logical multiplication Maxterms Minimization of oolean functions Minterms NN gate NOT gate Operator precedence OR gate Parallel inary dder Perfect induction method Postulates of oolean algebra Principle of duality Product-of-Sums expression Standard forms Sum-of Products expression Truth table Universal NN gate Universal NOR gate Ref. Page 97 Slide 78/78 26
Goals 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 858-822-4884 office 3802 P&M lass Website: http://vlsicad.ucsd.edu/courses/ece20b/wi04/
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 informationCombinational Logic (mostly review!)
ombinational Logic (mostly review!)! Logic functions, truth tables, and switches " NOT, N, OR, NN, NOR, OR,... " Minimal set! xioms and theorems of oolean algebra " Proofs by re-writing " Proofs by perfect
More informationTheorem/Law/Axioms Over (.) Over (+)
material prepared by: MUKESH OHR Follow me on F : http://www.facebook.com/mukesh.sirji4u OOLEN LGER oolean lgebra is a set of rules, laws and theorems by which logical operations can be mathematically
More informationChapter 2: Princess Sumaya Univ. Computer Engineering Dept.
hapter 2: Princess Sumaya Univ. omputer Engineering Dept. 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
More informationLecture 3. Title goes here 1. level Networks. Boolean Algebra and Multi-level. level. level. level. level
Lecture 3 Dr Richard Reilly Dept. of Electronic & Electrical Engineering Room 53, Engineering uilding oolean lgebra and Multi- oolean algebra George oole, little formal education yet was a brilliant scholar.
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 informationMC9211 Computer Organization
MC92 Computer Organization Unit : Digital Fundamentals Lesson2 : Boolean Algebra and Simplification (KSB) (MCA) (29-2/ODD) (29 - / A&B) Coverage Lesson2 Introduces the basic postulates of Boolean Algebra
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 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. Combinational-circuit analysis 4. Combinational-circuit synthesis Panupong
More informationCS 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 informationPart 5: Digital Circuits
Characteristics of any number system are: Part 5: Digital Circuits 5.: Number Systems & Code Conversions. ase or radix is equal to the number of possible symbols in the system 2. The largest value of digit
More informationECE/Comp Sci 352 Digital System Fundamentals Quiz # 1 Solutions
Last (Family) Name: KIME First (Given) Name: Student I: epartment of Electrical and omputer Engineering University of Wisconsin - Madison EE/omp Sci 352 igital System Fundamentals Quiz # Solutions October
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 informationCombinational logic. Possible logic functions of two variables. Minimal set of functions. Cost of different logic functions.
Combinational logic Possible logic functions of two variables Logic functions, truth tables, and switches NOT, ND, OR, NND, NOR, OR,... Minimal set xioms and theorems of oolean algebra Proofs by re-writing
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 informationPossible logic functions of two variables
ombinational logic asic logic oolean algebra, proofs by re-writing, proofs by perfect induction logic functions, truth tables, and switches NOT, ND, OR, NND, NOR, OR,..., minimal set Logic realization
More informationCOMP2611: Computer Organization. Introduction to Digital Logic
1 OMP2611: omputer Organization ombinational Logic OMP2611 Fall 2015 asics of Logic ircuits 2 its are the basis for binary number representation in digital computers ombining bits into patterns following
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. 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 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 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 informationCMSC 313 Lecture 16 Postulates & Theorems of Boolean Algebra Semiconductors CMOS Logic Gates
CMSC 33 Lecture 6 Postulates & Theorems of oolean lgebra Semiconductors CMOS Logic Gates UMC, CMSC33, Richard Chang Last Time Overview of second half of this course Logic gates & symbols
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
Chapter-2 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 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 informationEx: Boolean expression for majority function F = A'BC + AB'C + ABC ' + ABC.
Boolean Expression Forms: Sum-of-products (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 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 informationfor Digital Systems Simplification of logic functions Tajana Simunic Rosing Sources: TSR, Katz, Boriello & Vahid
SE140: omponents and Design Techniques for Digital Systems Simplification of logic functions Tajana Simunic Rosing 1 What we covered thus far: Number representations Where we are now inary, Octal, Hex,
More informationLecture 1. Notes. Notes. Notes. Introduction. Introduction digital logic February Bern University of Applied Sciences
Output voltage Input voltage 3.3V Digital operation (Switch) Lecture digital logic February 26 ern University of pplied Sciences Digital vs nalog Logic =? lgebra Logic = lgebra oolean lgebra Exercise Rev.
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 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 informationWhy digital? Overview. Number Systems. Binary to Decimal conversion
Why digital? Overview It has the following advantages over analog. It can be processed and transmitted efficiently and reliably. It can be stored and retrieved with greater accuracy. Noise level does not
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 informationL2: Combinational Logic Design (Construction and Boolean Algebra)
L2: Combinational Logic Design (Construction and oolean lgebra) cknowledgements: Materials in this lecture are courtesy of the following people and used with permission. - Randy H. Katz (University of
More informationCh 2. Combinational Logic. II - Combinational Logic Contemporary Logic Design 1
Ch 2. Combinational Logic II - Combinational Logic Contemporary Logic Design 1 Combinational logic Define The kind of digital system whose output behavior depends only on the current inputs memoryless:
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 informationWorking with Combinational Logic. Design example: 2x2-bit multiplier
Working with ombinational Logic Simplification two-level simplification exploiting don t cares algorithm for simplification Logic realization two-level logic and canonical forms realized with NNs and NORs
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 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 informationEECS Variable Logic Functions
EECS150 Section 1 Introduction to Combinational Logic Fall 2001 2-Variable Logic Functions There are 16 possible functions of 2 input variables: in general, there are 2**(2**n) functions of n inputs X
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 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 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 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 information3. PRINCIPLES OF COMBINATIONAL LOGIC
Principle of ombinational Logic -. PRINIPLES OF OMINTIONL LOGI Objectives. Understand the design & analysis procedure of combinational logic.. Understand the optimization of combinational logic.. efinitions
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 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 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 informationLogic Gates and Boolean Algebra
Logic Gates and oolean lgebra The ridge etween Symbolic Logic nd Electronic Digital Computing Compiled y: Muzammil hmad Khan mukhan@ssuet.edu.pk asic Logic Functions and or nand nor xor xnor not 2 Logic
More informationLogic. Basic Logic Functions. Switches in series (AND) Truth Tables. Switches in Parallel (OR) Alternative view for OR
TOPIS: Logic Logic Expressions Logic Gates Simplifying Logic Expressions Sequential Logic (Logic with a Memory) George oole (85-864), English mathematician, oolean logic used in digital computers since
More informationCHAPTER III BOOLEAN ALGEBRA
CHAPTER III- CHAPTER III CHAPTER III R.M. Dansereau; v.. CHAPTER III-2 BOOLEAN VALUES INTRODUCTION BOOLEAN VALUES Boolean algebra is a form of algebra that deals with single digit binary values and variables.
More informationProve that if not fat and not triangle necessarily means not green then green must be fat or triangle (or both).
hapter : oolean lgebra.) Definition of oolean lgebra The oolean algebra is named after George ool who developed this algebra (854) in order to analyze logical problems. n example to such problem is: Prove
More informationBoolean Algebra and Logic Gates Chapter 2. Topics. Boolean Algebra 9/21/10. EECE 256 Dr. Sidney Fels Steven Oldridge
Boolean Algebra and Logic Gates Chapter 2 EECE 256 Dr. Sidney Fels Steven Oldridge Topics DefiniGons of Boolean Algebra Axioms and Theorems of Boolean Algebra two valued Boolean Algebra Boolean FuncGons
More informationL2: Combinational Logic Design (Construction and Boolean Algebra)
L2: Combinational Logic Design (Construction and oolean lgebra) cknowledgements: Lecture material adapted from Chapter 2 of R. Katz, G. orriello, Contemporary Logic Design (second edition), Pearson Education,
More informationAppendix A: Digital Logic. Principles of Computer Architecture. Principles of Computer Architecture by M. Murdocca and V. Heuring
- Principles of Computer rchitecture Miles Murdocca and Vincent Heuring 999 M. Murdocca and V. Heuring -2 Chapter Contents. Introduction.2 Combinational Logic.3 Truth Tables.4 Logic Gates.5 Properties
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 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 informationIntroduction. 1854: Logical algebra was published by George Boole known today as Boolean Algebra
oolean lgebra Introduction 1854: Logical algebra was published by George oole known today as oolean lgebra It s a convenient way and systematic way of expressing and analyzing the operation of logic circuits.
More informationSlides for Lecture 10
Slides for Lecture 10 ENEL 353: Digital Circuits Fall 2013 Term Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary 30 September, 2013 ENEL 353
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. Overview Part 1 Gate
More informationCHAPTER III BOOLEAN ALGEBRA
CHAPTER III- CHAPTER III CHAPTER III R.M. Dansereau; v.. CHAPTER III-2 BOOLEAN VALUES INTRODUCTION BOOLEAN VALUES Boolean algebra is a form of algebra that deals with single digit binary values and variables.
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 1431-1432 2.1. Basic Definitions 2.2. Basic Theorems and Properties of Boolean
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 information12/31/2010. Overview. 05-Boolean Algebra Part 3 Text: Unit 3, 7. DeMorgan s Law. Example. Example. DeMorgan s Law
Overview 05-oolean lgebra Part 3 Text: Unit 3, 7 EEGR/ISS 201 Digital Operations and omputations Winter 2011 DeMorgan s Laws lgebraic Simplifications Exclusive-OR and Equivalence Functionally omplete NND-NOR
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: 858-822-4884 office, 858-353-0550 cell Office: 3802
More informationEC-121 Digital Logic Design
EC-121 Digital Logic Design Lecture 2 [Updated on 02-04-18] Boolean Algebra and Logic Gates Dr Hashim Ali Spring 2018 Department of Computer Science and Engineering HITEC University Taxila!1 Overview What
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 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 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 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 (k-map). 1. Deriving of logical expression from
More informationBoolean Algebra. The Building Blocks of Digital Logic Design. Section. Section Overview. Binary Operations and Their Representation.
Section 3 Boolean Algebra The Building Blocks of Digital Logic Design Section Overview Binary Operations (AND, OR, NOT), Basic laws, Proof by Perfect Induction, De Morgan s Theorem, Canonical and Standard
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 informationWeek-I. Combinational Logic & Circuits
Week-I 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 information. T SHREE MAHAPRABHU PUBLIC SCHOOL & COLLEGE NOTES FOR BOARD EXAMINATION SUBJECT COMPUTER SCIENCE (Code: 083) Boolean Algebra
. T SHREE MAHAPRABHU PUBLIC SCHOOL & COLLEGE NOTES FOR BOARD EXAMINATION 2016-17 SUBJECT COMPUTER SCIENCE (Code: 083) Boolean Algebra Introduction to Boolean Algebra Boolean algebra which deals with two-valued
More informationUnit 2 Boolean Algebra
Unit 2 Boolean Algebra 2.1 Introduction We will use variables like x or y to represent inputs and outputs (I/O) of a switching circuit. Since most switching circuits are 2 state devices (having only 2
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 informationChapter 2 Boolean Algebra and Logic Gates
Ch1: Digital Systems and Binary Numbers Ch2: Ch3: Gate-Level Minimization Ch4: Combinational Logic Ch5: Synchronous Sequential Logic Ch6: Registers and Counters Switching Theory & Logic Design Prof. Adnan
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 - Lec19-cl1 Page 1 Boolean Algebra I (Representations of Combinational
More informationLecture 2. Notes. Notes. Notes. Boolean algebra and optimizing logic functions. BTF Electronics Fundamentals August 2014
Lecture 2 Electronics ndreas Electronics oolean algebra and optimizing logic functions TF322 - Electronics Fundamentals ugust 24 Exercise ndreas ern University of pplied Sciences Rev. 946f32 2. of oolean
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 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 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 informationAlgebraic Methods for the Analysis and Synthesis
lgebraic ethods for the nalysis and Synthesis Fundaentals of oolean lgebra asic Postulates. oolean algebra is closed algebraic syste containing a set K of two or ore eleents and two operators and, ND and
More informationSimplification of Boolean Functions. Dept. of CSE, IEM, Kolkata
Simplification of Boolean Functions Dept. of CSE, IEM, Kolkata 1 Simplification of Boolean Functions: An implementation of a Boolean Function requires the use of logic gates. A smaller number of gates,
More informationCombinatorial Logic Design Principles
Combinatorial Logic Design Principles ECGR2181 Chapter 4 Notes Logic System Design I 4-1 Boolean algebra a.k.a. switching algebra deals with boolean values -- 0, 1 Positive-logic convention analog voltages
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 2-1 Basic Definitions 2-2 Axiomatic Definition of Boolean Algebra 2-3
More informationCombinational logic. Possible logic functions of two variables. Minimal set of functions. Cost of different logic functions
ombinational logic Possible logic functions of two variables asic logic oolean algebra, proofs by re-writing, proofs by perfect induction Logic functions, truth tables, and switches NOT, N, OR, NN,, OR,...,
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 informationCOSC3330 Computer Architecture Lecture 2. Combinational Logic
COSC333 Computer rchitecture Lecture 2. Combinational Logic Instructor: Weidong Shi (Larry), PhD Computer Science Department University of Houston Today Combinational Logic oolean lgebra Mux, DeMux, Decoder
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 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 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 Lec4-bool1 Page 1, 9/5 9am Outline Review of
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 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 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 4-1 Boolean Operations and Expressions 4-2 Laws and Rules of Boolean
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 Logic Design. Combinational Logic
Digital Logic Design Combinational Logic Minterms A product term is a term where literals are ANDed. Example: x y, xz, xyz, A minterm is a product term in which all variables appear exactly once, in normal
More information12/31/2010. Overview. 10-Combinational Circuit Design Text: Unit 8. Limited Fan-in. Limited Fan-in. Limited Fan-in. Limited Fan-in
Overview 10-ombinational ircuit esign Text: Unit 8 Gates with elays and Timing Other Hazards GR/ISS 201 igital Operations and omputations Winter 2011 r. Louie 2 Practical logic gates are limited by the
More informationDigital Design 2. Logic Gates and Boolean Algebra
Digital Design 2. Logic Gates and oolean lgebra József Sütő ssistant Lecturer References: [1] D.M. Harris, S.L. Harris, Digital Design and Computer rchitecture, 2nd ed., Elsevier, 213. [2] T.L. Floyd,
More information