Goals for Lecture. Binary Logic and Gates (MK 2.1) Binary Variables. Notation Examples. Logical Operations
|
|
- Godfrey O’Brien’
- 5 years ago
- Views:
Transcription
1 Introduction to Electrical Engineering, II LETURE NOTES #2 Instructor: Telephone: Office: ndrew. Kahng (lecture) office 3802 P&M lass Website: Goals for Lecture inary logic and gates oolean lgebra anonical forms for function representation unction simplification Examples orresponds to MK, (some 2.5) 2 inary Logic and Gates (MK 2.) inary Variables inary variables take on one of two values. Logical operators operate on binary values and binary variables. asic logical operators are the logic functions ND, OR and NOT. Logic gates implement logic functions. oolean lgebra: a useful mathematical system for specifying and transforming logical functions. We study oolean lgebra as foundation for designing digital systems. The two binary values have different names: True/alse On/Off Yes/No /0 We will use and 0 to denote the two values. Variable identifiers:,, y, or z for now RESET, STRT_IT, or DD later 3 4 Logical Operations Notation Examples The three basic logical operations are: ND OR NOT ND is denoted by a dot ( ). OR is denoted by a plus (+). NOT is denoted by a bar ( ) over, a single quote mark (') after, or ~ before the variable. Examples: Y = is read Y is equal to and. z = x + y is read z is equal to x OR y. = is read is equal to NOT. Note: The statement: + = 2 (read one plus one is equal to two ) is not the same as + = (read or is equal to ). 5 6
2 Operator Definitions Truth Tables Operations are defined on the values "0" and "" for each Operator: ND 0 0 = 0 0 = 0 0 = 0 = OR = = + 0 = + = NOT 0 = = 0 Truth tables list the output value of a function for all possible input values Truth tables for basic logic operations: ND Y Z = Y Y OR Z = +Y 0 NOT Z = Logic unction Implementation Logic Gates Using Switches or inputs: logic is switch closed logic 0 is switch open or outputs: logic is light on logic 0 is light off. or NOT, a switch such that for inputs: logic is switch open logic 0 is switch closed Switches in parallel => OR Switches in series => ND In the earliest computers, switches were opened and closed by energizing coils to produce magnetic fields. The switches in turn opened and closed current paths. Later, vacuum tubes that open and close current paths replaced the relays. Today, transistors are used as electronic switches that open and close current paths. 9 0 Logic Gates (continued) Logic Gate Symbols and ehavior Implementation of logic functions with transistors (See text website Supplement 2-8) logic +V Logic gates have special symbols: 2 n using p-type transistors using n-type transistors Y rom G +V G = + Y Y +V. Y +V nd waveform behavior in time as follows: logic 0 rom G2 (a) General structure (b) NOR (c) NND Transistor or tube based implementations of logic functions are called logic gates or just gates (d) NOT 2 2
3 Logic Diagrams and Expressions oolean lgebra (MK 2.2) Truth Table Logic Diagram Y Z = + Y Z Y Z Expression 0 0 = + Y Z oolean expressions, truth tables and logic diagrams describe the same function! Truth tables are unique; expressions and logic diagrams are not. This gives flexibility in implementing functions. 3 n algebraic structure defined on a set of at least two elements,, together with two binary operators (denoted + and ) that satisfies the following identities: losure of with respect to +, (see slide 6) Identity elements 0 and such that:. + 0 = 2. = 3. + = 4. 0 = = 6. = or each element, an element (inverse) s.t.: 7. + = 8. = 0 9. = 4 oolean lgebra (cont.) 0. + Y = Y +. Y = Y 2. + (Y + Z) = ( + Y) + Z 3. (Y Z) = ( Y) Z 4. (Y + Z) = Y + Z 5. + Y Z = ( + Y) ( + Z) 6. Y = + Y 7. + Y = Y The identities are organized into dual pairs. These pairs have names as follows: -4 Existence of 0 and 5-6 Idempotence 7-8 Existence of complement 9 Involution 0- ommutative Laws 2-3 ssociative Laws 4-5 Distributive Laws 6-7 DeMorgan s Laws If the meaning is unambiguous, we leave out the symbol Duality The dual of an algebraic expression is obtained by interchanging + and and interchanging 0 s and s. The identities appear in dual pairs. When there is only one identity on a line the identity is selfdual, i. e., the dual expression = the original expression. Unless it happens to be self-dual, the dual of an expression does not equal the expression itself. 5 6 oolean lgebraic Proofs - Example oolean lgebraic Proofs - Example 2 + Y = (bsorption Theorem) Y + Z + YZ = Y + Z (onsensus Theorem) Proof Steps Justification (identity or theorem) + Y = + Y (identity 2) = (Y + Y) + Y (identity 7) = Y + Y + Y (identity 4) = Y + Y (identity 5, applied to Y) = (Y + Y) (identity 4) = = (identity 5, identity 2) Proof Steps Justification (identity or theorem) YZ = YZ( + ) (identity 2, identity 7) = YZ + YZ (identity 4) Y + Z + YZ + YZ = Y( + Z) + Z( + Y) (identity 2, identity 7) = Y + Z (identity 3, identity 2) 7 8 3
4 oolean Operator Precedence The order of evaluation in oolean Expressions is: Parentheses NOT ND OR ecause ND takes precedence over OR, parentheses must be placed around the OR operator more frequently. Useful Theorems ( )( ) n x y + x y = y x + y x + y = y Minimizatio x + x y = x x ( x + y) = x bsorption x + x y = x + y x ( x + y) = x y Simplification x y + x z + y z = x y + x z onsensus ( x + y) ( x + z) ( y + z) = ( x + y) ( x + z) x + y = x y x y = x + y DeMorgan's Laws Exercise: Prove DeMorgan s Laws 9 20 oolean unction Evaluation Expression Simplification = xyz 2 = x + yz 3 = xyz + x y z + xy 4 = xy + x z x y z Simplify to contain the smallest number of literals (complemented and uncomplemented variables): + D + D + D + D = = + + D = + ( + D) or = + + D = + ( + D) 2 22 omplementing unctions anonical orms (MK 2.3) Use DeMorgan's Theorem to complement a function:. Interchange ND and OR operators 2. omplement each literal Example: omplement x yz + xyz It is useful to specify oolean functions in a form that: llows comparison for equality. Has a correspondence the truth tables anonical forms: Sum of Minterms (SOM) or Sum of Products (SOP) Product of Maxterms (POM) or Product of Sums (POS)
5 Minterms Minterms are ND terms with every variable in true or complemented form. Each binary variable may appear in uncomplemented (e.g., x) or complemented (e.g., x ) form there are 2 n minterms for n variables. EMPLE: Two variables, combined with an ND operator, Y have 2*2 or 4 combinations: (both normal) Y Y ( normal, Y complemented) Y ( complemented, Y normal) Y (both complemented) There are four minterms of two variables. 25 Maxterms Maxterms are OR terms with every variable in true or complemented form. Each binary variable may appear in uncomplemented (e.g., x) or complemented (e.g., x ) form there are 2 n maxterms for n variables. Two variables, combined with an OR operator, + Y, have 2*2 or 4 combinations: + Y (both normal) + Y (x normal, y complemented) + Y (x complemented, y normal) + Y (both complemented) 26 Maxterms and Minterms Standard Order Examples: Two variable minterms and maxterms. Index Maxterm Minterm 0 x + y x y x + y x y 2 x + y x y 3 x + y x y The index above is important for describing which variables in the terms are true and which are complemented. 27 Minterms and maxterms are designated with a subscript The subscript is a number, corresponding to a binary pattern The bits in the pattern represent the complemented or normal state of EVERY variable, listed in a STNDRD order. ll variables will be present in a minterm or maxterm and will be listed in the same order (usually alphabetically) Example: or variables a, b, c: Maxterms: (a + b + c), ( a + b + c) Minterms: a b c, a b c, a b c Terms: (b + a + c), a c b, and (c + b + a) are NOT in standard order. Terms: (a + c), b c, and (a + b) do not contain all variables 28 Purpose of the Index The index for the minterm or maxterm, expressed as a binary number, is used to determine whether each variable occurs in true form or complemented form. or Minterms: means the variable is Not omplemented and 0 means the variable is omplemented. or Maxterms: 0 means the variable is Not omplemented and means the variable is omplemented. Index Example in Three Variables Example: (for three variables) ssume the variables are called, Y, and Z. the standard order is, then Y, then Z. The Index 0 (base 0) = 000 (base 2 to three digits) so all three variables are complemented for minterm 0 (, Y, Z) and no variables are complemented for Maxterm 0 (,Y,Z) Minterm 0, called m 0 is YZ. Maxterm 0, called M 0 is ( + Y + Z)
6 our Variables Index Examples Index inary Minterm Maxterm i Pattern m i M i abcd 000 abcd 3 00 abcd 5 00 abcd 7 0 abcd 0 00 abcd 3 0 abcd 5 abcd Minterm and Maxterm Relationship DeMorgan's Theorem: x y = x + y and x + y = x y Two-variable example: M 2 = x + y and m 2 = x y Thus M 2 is the complement of m 2 and vice-versa. Since DeMorgan's Theorem holds for n variables, the above holds for terms of n variables giving: M and i = mi m i = M i Thus M i is the complement of m i unction Tables for oth Observations Minterms of Maxterms of 2 variables 2 variables x y m 0 m m 2 m x y M 0 M M 2 M Each column in the maxterm function table is the complement of the column in the minterm function table since M i is the complement of m i. In the function tables: Each minterm has one and only one present in the 2 n terms (a minimum of ones). ll other entries are 0. Each maxterm has one and only one 0 present in the 2 n terms ll other entries are (a maximum of ones). We can implement any function by "ORing" the minterms corresponding to a "" in the function table. We can implement any function by "NDing" the maxterms corresponding to a "0" in the function table. This gives us two canonical forms: Sum of Minterms (SOM), and Product of Maxterms (POM) for stating any oolean function Minterm unction Example Minterm unction Example Example: ind = m + m 4 + m 7 = x y z + x y z + x y z (,,, D, E) = m 2 + m 9 + m 7 + m 23 x y z index m + m 4 + m 7 = = = = = = = = =
7 Maxterm unction Example Maxterm unction Example Example: Implement in maxterms: = M 0 M 2 M 3 M 5 M 6 = (x + y + z) (x + y + z) (x + y + z) ( x + y + z) (x + y + z) x y z i M 0 M 2 M 3 M 5 M 6 = = = = = = = = 0 7 = 37 (,,, D) = M3 M8 M M4 38 anonical Sum of Minterms nother SOM Example ny oolean unction can be expressed as a Sum of Minterms. or the function table, the minterms used are the terms corresponding to the 's or expressions, expand all terms first to explicitly list all minterms. Do this by NDing any term missing a variable v with a term ( v + v). Example: Implement f = x + x y as a sum of minterms. irst expand terms: f = x(y + y) + x y Then distribute terms: f = xy + xy + x y Express as sum of minterms: f = m 3 +m 2 +m 0 Example: = + There are three variables,,, and which we take to be the standard order. Expanding the terms with missing variables: ollect terms (removing all but one of duplicate terms): Express as SOM: Shorthand SOM orm anonical Product of Maxterms rom the previous example, we started with: = + We ended up with: = m +m 4 +m 5 +m 6 +m 7 This can be denoted in the formal shorthand: (,,) = Σm(,4,5,6,7) (We explicitly show the standard variables in order and drop the m designators.) ny oolean unction can be expressed as a Product of Maxterms (POM). or the function table, the maxterms used are the terms corresponding to the 0's. or an expression, expand all terms first to explicitly list all maxterms. Do this by first applying the second distributive law, ORing terms missing variable v with a term equal to and then applying the distributive law again. Example: onvert to product of maxterms: irst apply the distributive law: dd missing variable z: Express as POM: f = M 2 M 3 v v f (x, y, z) = x + x y x + x y = (x + x)(x + y) = (x + y) = x + y ( x + y z) x + y + z z = (z + y + z)
8 omplements and onversion To complement a function expressed as SOm (or, POM), just select the missing minterms (Maxterms) Or, the complement of the SOm (POM) function is given by the POM (SOm) with the same indices. To convert SOM SOP, find the missing indices, and then use the other form Example: (x,y,z) = Σ m (,3,5,7) (x,y,z) = Σ m (0,2,4,6) (x,y,z) = Π M (,3,5,7) (x,y,z) = Π M (0,2,4,6) Standard Sum-of-Products (SOP) Sum of Minterms form for n variables can be written down directly from a truth table. Implementation of this form is a two-level network of gates such that: The first level consists of n-input ND gates, and The second level is a single OR gate (with fewer than 2n inputs). This form: is usually not a minimum literal expression, and leads to a more expensive implementation (in terms of two levels of ND and OR gates) than needed Standard Sum-of-Products (SOP) SOP ND/OR Two-level Implementation Try to combine terms to get a lower literal cost expression less expensive implementation. Example: (,,) = Σm(,4,5,6,7) 45 Which implementation is simpler? 46 Standard Product-of-Sums (POS) Product of Maxterms form for n variables can be written down directly from a truth table. Implementation of this form is a two-level network of gates such that: The first level consists of n-input OR gates, and The second level is a single ND gate (with fewer than 2n inputs). This form: is usually not a minimum literal expression, and leads to a more expensive implementation (in terms of two levels of ND and OR gates) than needed. Standard Product-of-Sums (POS) Try to combine terms to get a lower literal cost expression less expensive implementation. Example: (,,) = ΠM(0,2,3)
9 OR/ND Two-level Implementation ost of Implementation Which implementation is simpler? anonical SOP, POS representations can differ in literal cost oolean algebra: manipulate equations into simpler forms reduces the (two-level) implementation cost Is there only one minimum-cost circuit? Is there a systematic procedure to obtain a minimum-cost circuit?
ECE 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 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 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 informationLogic and Computer Design Fundamentals. Chapter 2 Combinational Logic Circuits. Part 1 Gate Circuits and Boolean Equations
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part Gate Circuits and Boolean Equations Charles Kime & Thomas Kaminski 28 Pearson Education, Inc. (Hperlinks are active in
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 Combinational
Computer Engineering 1 (ECE290) Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations HOANG Trang Reference: 2008 Pearson Education, Inc. Overview Part 1 Gate Circuits and Boolean
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationLogic and Computer Design Fundamentals. Chapter 2 Combinational Logic Circuits. Part 2 Circuit Optimization
Logic and omputer Design Fundamentals hapter 2 ombinational Logic ircuits Part 2 ircuit Optimization harles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode)
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 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 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 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 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 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 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 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 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 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 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 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 informationINTRODUCTION TO INFORMATION & COMMUNICATION TECHNOLOGY LECTURE 8 : WEEK 8 CSC-110-T
INTRODUCTION TO INFORMATION & COMMUNICATION TECHNOLOGY LECTURE 8 : WEEK 8 CSC-110-T Credit : (2 + 1) / Week TEXT AND REF. BOOKS Text Book: Peter Norton (2011), Introduction to Computers, 7 /e, McGraw-Hill
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationCHAPTER 3 LOGIC GATES & BOOLEAN ALGEBRA
CHPTER 3 LOGIC GTES & OOLEN LGER C H P T E R O U T C O M E S Upon completion of this chapter, student should be able to: 1. Describe the basic logic gates operation 2. Construct the truth table for basic
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 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 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 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 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 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 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 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 informationﻮﻧﺭﺎﮐ ﺔﺸﻘﻧ ﺎﺑ ﻱﺯﺎﺳ ﻪﻨﻴﻬﺑ
بهينه سازي با نقشة کارنو Karnaugh Map Karnaugh Map Method of graphically representing the truth table that helps visualize adjacencies 2-variable K-map 3-variable K-map 2 3 2 3 6 7 4 5 D 3 2 4 5 7 6 2
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 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 informationEvery time has a value associated with it, not just some times. A variable can take on any value within a range
Digital Logic Circuits Binary Logic and Gates Logic Simulation Boolean Algebra NAND/NOR and XOR gates Decoder fundamentals Half Adder, Full Adder, Ripple Carry Adder Analog vs Digital Analog Continuous»
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 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 Two-Level Optimization
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 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 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 informationElectronics. Overview. Introducction to Synthetic Biology
Electronics Introducction to Synthetic iology E Navarro Montagud P Fernandez de Cordoba JF Urchueguía Overview Introduction oolean algebras Logical gates Representation of boolean functions Karnaugh maps
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 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 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 informationDIGITAL ELECTRONICS & it0203 Semester 3
DIGITAL ELECTRONICS & it0203 Semester 3 P.Rajasekar & C.M.T.Karthigeyan Asst.Professor SRM University, Kattankulathur School of Computing, Department of IT 8/22/2011 1 Disclaimer The contents of the slides
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 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 informationCOE 202: Digital Logic Design Combinational Logic Part 2. Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:
COE 202: Digital Logic Design Combinational Logic Part 2 Dr. Ahmad Almulhem Email: ahmadsm AT kfupm Phone: 860-7554 Office: 22-324 Objectives Minterms and Maxterms From truth table to Boolean expression
More information