ENG2410 Digital Design Combinational Logic Circuits

Size: px
Start display at page:

Download "ENG2410 Digital Design Combinational Logic Circuits"

Transcription

1 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 letters in examples Really use words when designing circuits Basic Functions AND OR NOT 4 Resources Chapter #2, Mano Sections 2. Logic Gates 2.2 Boolean Algebra 2.3 Min Terms & Max Terms 2.4 Logic Optimization Logic Signals Binary 0 is represented by a low voltage (range of voltages) Binary is represented by a high voltage (range of voltages) The voltage ranges guard against noise 2 Example of binary signals 5 Week #2 Topics Logic Gates Name Graphical Symbol Algebraic Function Truth Table Binary Logic and Gates Boolean Functions Boolean Algebra (Truth Tables) Basic Identities Standard Forms (Minterms, Maxterms) Circuit Optimization (K-Maps) Map Manipulations (Prime Implicants) AND OR NOT NAND NOR A B A B A A B A B F F F F F F = A B or F = F = A + B F = A or F = A F = F = A + B A B F A B F A F 0 0 A B F A B F XOR A B F F = A B A B F Figure. Basic Logic Gates 6 / 45 School of Engineering

2 NOT Operator Switching Circuits (AND Gate) AND Unary Operator Symbol is bar = X Truth table -> Inversion AND Gate: Symbol 7 0 Inverter Gate Timing Diagram AND Gate: Timing Timing Diagrams 8 AND Gate OR Gate Symbol is dot = X.Y Or no symbol = XY Truth table -> is only if Both X and Y are Switches in series => AND Symbol is + Not addition = X + Y Truth table -> is if either Switches in parallel => OR 9 2 School of Engineering 2

3 Switching Circuits (OR Gate) Logic Diagram Boolean Expression OR Logic Diagram OR Gate: Symbol What is the Boolean expression? F = X + Y. 3 6 OR Gate: Timing Boolean Expression Logic Diagram Timing Diagrams Consider function F = XY + XY + X How many gates do we need to implement this function? 4 7 Binary Logic Truth Tables, Boolean Expressions, and Logic Gates AND OR NOT x y z x y z x z z = x y = x y z = x + y z = x = x 5 Boolean Expression Truth Table F = X + Y. X Y Y Y F What is the Truth Table? School of Engineering 3

4 Boolean Expression Truth Table More Inputs F = X + Y. What is the Truth Table? X Y Y Y F Work same way What s output? Boolean Expression Truth Table NAND Gates F = X + Y. What is the Truth Table? X Y Y Y F Very common for discrete logic Boolean Expression Truth Table NOR Gates F = X + Y. What is the Truth Table? X Y Y Y F NOT OR Also common F = X + Y X Y School of Engineering 4

5 Boolean Operator Precedence Design Steps (Simple Example) The order of evaluation in a Boolean expression is:. Parentheses 2. Not 3. And 4. Or Consequence: Parentheses appear around OR expressions Example: F = A(B + C)(C + D) Step #, since we have three inputs then the Truth Table has to have 8 entries (2 3 ) X Y F Mechanically Go From Truth Table to Function Design Steps (Simple Example) Steps of design:. Start with Problem Statement 2. Obtain Truth Table 3. Obtain a algebraic boolean function 4. Draw the circuit diagram Step #2, Pick the entries in the truth table where F is equal. Give Expression: F = X Y X Y F Design Steps (Simple Example) Design Steps (Simple Example) Specification: Design a circuit that has 3 inputs x, y, z and a single output F. F is true when the three inputs are the same and false otherwise. Step #3, Draw a logic diagram that represents the boolean functions. F = X Y X Y F School of Engineering 5

6 Representation: Truth Table Table of Identities Give Boolean Expression? F = X Y + X Y + X Y + X Y + X Y Not Simplified! X Y 2 n rows where n # of variables X Y X Y X Y X Y 3 34 Boolean Functions: Complexity Dual of an Expression There can be different representations for a boolean function Usually we want the simplest (Why?) Fewer gates (Less Area, Less Power Consumption, Faster!) We can use identities to reduce complexity of Boolean expressions. The dual of an expression is obtained by:. Changing AND to OR and OR to AND throughout 2. Changing s to 0 s and 0 s to s For example The dual of X+0 is: X., The dual of X.0 is: 32 X+ 35 Boolean Algebra & Identities Duals There is only one way that a Boolean function can be represented in a truth table. However, when the function is in algebraic form, it can be expressed in a variety of ways. Boolean algebra is a useful tool for simplifying digital circuits. Use identities to manipulate functions Left and right columns are duals School of Engineering 6

7 Single Variable Identities Distributive Identity 4 is well known from ordinary algebra! Identity 5 is the dual of identity Commutative DeMorgan s Theorem Order independent Used a lot NOR equals invert AND NAND equals invert OR Proof? 38 4 Associative Truth Tables for DeMorgan s Independent of order in which we group So can also be written as and X + Y School of Engineering 7

8 Useful Theorems Algebraic Manipulation x y + x y = y x + x y = x x x + y = x Minimization ( ) Absorption ( + y) = x y Simplification x + x y = x + y x x x y + x z + y z = x y + x z Consensus ( x + y) ( x + z) ( y + z) = ( x + y) ( x + z) 43 o o o F = XY + XY + X When a Boolean equation is implemented with logic gates, i. Each term requires a gate, ii. Each variable designates an input to the gate. We define a literalas a single variable within a term that may or may not be complemented. The expression above has THREE termsand EIGHT literals. 46 Example : Boolean Algebraic Proof Algebraic Manipulation A + A B = A Proof Steps A + A B (Absorption Theorem) Justification (identity or theorem) = A + A B X = X = A ( + B) X Y + X = X (Y + ) = A + X = = A X = X How many gates do we need to implement this function? Consider function F = XY + XY + X Cont.. Boolean Algebraic Proof Simplify Function Our primary reason for doing proofs is to learn: F = XY + XY + X Apply F = XY ( + ) + X Careful and efficient use of the identities and theorems of Boolean algebra, and How to choose the appropriate identity or theorem to apply to make forward progress, irrespective of the application. F = XY + X F = XY + Apply Apply X End Result? School of Engineering 8

9 Fewer Gates F = XY + X 2. Cont..Complement of a Function The complement of a function can be derived algebraically by applying DeMorgan s theorem.. Fewer Gates! 2. Fewer Inputs per gate! F = XY + XY F = XY + XY F = ( XY ).( XY) F = ( X+ Y + )( X+ Y+ ) The Duality Principle 3. Cont..Complement of a Function Recall how to obtain the dual of an expression! Theduality principlestates that a Boolean equation remains valid if we take the dual of the expression on both sides of the equal sign. X + XY = X + Y X ( X + Y) = XY Yet another way of deriving the complement of a function is to: Take the dual of the function equation Complement each literal. F = XY + XY F = ( XY ) + ( XY ) Dual ( X + Y + ).( X + Y + ) F = ( X + Y + ).( X + Y + ) Complement of a Function The complement representation for a function F, (F ), is obtained from an interchange of s to 0 s and 0 s to s for the values of F in the truth table. F = XY + XY X Y F F ENG24 Digital Design Cont..Week #2 Combinational Logic Circuits F = X Y 5 School of Engineering 9

10 Resources Standard Forms Chapter #2, Mano Sections 2.3 Standard Forms 2.4 Circuit Optimization (K-Maps) Assume we have a circuit with 3 variables X, Y, Definitions: Product Term a subset of the variables appear XY, X, X, XY Min Term is a product term in which all variables appear once (XY, X Y, X Y ) Week #2, #3 Topics Number of Minterms Standard Forms (Minterms, Maxterms) Circuit Optimization (K-Maps) Map Manipulations (Prime Implicants) For n variables, there will be 2 n minterms Like binary numbers from 0 to 2 n From Truth Table to Function Definition: Minterm Consider a truth table Can implement F by taking OR of all terms that are F = XY MinTerm Is a Product Term in which ALL variables appear once (complemented or not) F = X Y + X Y F ( optimized ) = Y + X Product Term School of Engineering 0

11 Sum of Minterms (SOM) Sum of Products (SOP) OR all of the minterms of truth table row with a F = X Y In this case m 0 +m 2 +m 5 +m 7 F = XY + XY + XY + XY In this case m + m 3 + m 4 + m 6 m 0 m m 2 m 3 m 4 m 5 m 6 m 7 The sum-of-minterms form is a standard algebraic expression that is obtained directly from a truth table. The expression obtained contains the maximum number of literals in each term. Simplification of the sum-ofminterms expression is called sumof-products Alternative Representation SOM vs. SOP Sum of minterms F = X. Y. + X. Y. + X. Y. + X. Y. In this case m 0 +m 2 +m 5 +m 7 F ( X, Y, ) = m(0,2,5,7) F = X. Y. + X. Y. + X. Y. + X. Y. In this case m + m 3 + m 4 + m 6 F ( X, Y, ) = m(,3,4,6 ) F = X Y After Simplification we get the Sum of products F = X. + X Summary of Properties of Minterms Sum of Products Implementation There are 2 n minterms for a Boolean function with n variables Any Boolean function can be expressed as a logical sum of minterms The complement of a function contains those minterms not included in the original function. A function that includes all the 2 n minterms is equal to logic. Sum of products F = Y + XY + XY We refer to this implementation as a twolevel circuit School of Engineering

12 2-level Implementation Minterm related to Maxterm Sum of products has 2 levels of gates Minterm and maxterm with same subscripts are complements m j = Mj Example (Use Demorgans theory) Is there a 3-level rep of this circuit? m 3 = XY m = XY = X + Y + = 3 M level vs. 3-level Implementation Product of Maxterms We can also express F as AND of all rows that should evaluate to CE can be Also expressed as + C(D+E) What s best? Hard to answer!! More gate delays? But maybe we only have 2-input gates F = M M 3 M 4 M 6 F( X, Y, ) = ΠM (,3,4,6) F = ( X + Y + )( X + Y + ) ( X + Y + )( X + Y + ) M 0 M M 2 M 3 M 4 M 5 M 6 M Definition: Maxterm Two-Level Circuit Optimization Is a Sum Term in which all variables appear once (complemented or not) The complexity of the digital logic gates that implement a Boolean function is directly related to the algebraic expression from which the function is implemented!! Boolean expressions may be simplified by algebraic manipulation (i.e. identities) but it is awkward and not straight forward! School of Engineering 2

13 Karnaugh Maps Three-Variable Map Graphical depiction of truth table A box for each minterm So 2 variables, 4 boxes 3 variable, 8 boxes And so on Useful for simplification By inspection Algebraic manipulation harder Eight minterms Look at encoding of columns and rows Only one variable changes from box to box Examples Simplification There are implied 0s in other boxes Figure (b) F = m + m 2 + m 3 Adjacent squares (horizontally or vertically) are minterms that vary by single variable Draw rectangles on map to simplify function Illustration next F = XY + XY + XY = X + Y Simplification How to obtain a simplified expression? F = XY + XY + XY = X Y + X ( Y + Y ) = X Y + X () = ( X + X ) ( X + Y ) = X +Y Combine as many s as possible from the map to form rectangle Only adjacent s can be combined vertically or horizontally but not diagonally. The number of s that can be combined is a power of 2, (2 0 =, 2 =2, 2 2 =4, 2 3 =8), School of Engineering 3

14 Example Another Minimization Example X Y F F = XY + XY + XY + XY F = XY + XY Each of the two adjacent pairs of entries can be simplified by eliminating the changing bit. x is eliminated in column 2 y is eliminated in the other pair. F = y z + x z Extract minterms from Expression XY Covering 4 Squares F = XY + XY + XY F = XY + XY + XY + XY F = XY + XY X XY 0 Y 0 0 is F = X Y F = X + X F = Adjacency is Cylindrical Another Example Note that wraps from left edge to right edge. In general, as more squares are combined, we obtain a product term with fewer literals. Overlap is allowed School of Engineering 4

15 4-variable map Simplifying a 4-Variable Function At limit of K-map Y WX F( W, X, Y, ) = m(0,,2,4,5,6,8,9,2,3,4 ) W 0 X Y Don t Care (a) D (d) (b) B 0 0 (e) BC 0 0 (c) D (f) BD So far we have dealt with functions that were always either 0 or Sometimes we have some conditions where we don t care what result is Example: dealing with B Only care about first 0 (g) A (h) D (i) C Figure.8 Example Use of Karnaugh Maps Also Wraps (toroidal topology) Mark With an `X In a K-map, mark don t care with an X Simpler implementations Can select an X either as or 0 Example: F( A, B, C, D) = m(,3,7,,5), d(0,2,5) School of Engineering 5

16 Example F( A, B, C, D) = m(,3,7,,5), d(0,2,5) Finding Simplified Expressions or The procedure for finding simplified expressions:. Determine all essential prime implicants. 2. The final expression is formed from the logical sum of: I. The essential prime implicants, with II. Other prime implicants needed to cover the remaining minterms There may be more than one simplified expression. What would we have if Xs were 0? 9 94 Prime Implicants Prime Implicants: Example Each element in the K-Map is an implicant. A prime implicantis a product term obtained by combining the maximum possible number of adjacent squares in the map. A single on a maprepresents a prime implicantif it is not adjacent to any other. Two adjacent sform a prime implicant, provided they are not within a group of four adjacent squares. Four adjacent sform a prime implicantif they are not within a group of eight adjacent squares, and so on. If a mintermin a square is covered by only one prime implicant, that prime implicant is said to be essential. They are found by looking at each square marked with a and checking the number of prime implicantsthat cover it. Those with only one prime implicant are essential. 92 Two essential prime implicants (caused by m 0 and m 5 ) This gives us two terms: x z and xz Finding prime implicants for the remainders results in four expressions: F = xz + x z + yz + wz F = xz + x z + yz + wx F = xz + x z + x y + wz F = xz + x z + x y + wx 95 Implicant/Prime Implicant/Essential on Consider: f = { b d, abc, bd, acd, abc, bcd} Each Element of f on is an Implicant Prime Implicants are: { b d, abc, bd, acd, abc} abc is a Prime Implicant but NOT an Essential Prime Implicant bcd is an Implicant but NOT a Prime Implicant bd is an Essential Prime Implicant Essential Prime Implicants F(A, B,C, D, E) = m(0, 2, 4, 6, 7, 8,0,,2,3,4,6,8,9, 29, 30) Prime Implicants (6,7) X X (0,) X X (2,3) X X (8,9) X X (3,29) X X (4,30) X X (0,2,6,8) X X X X (0,2,4,6,8,0,2,4) X X X X X X X X 93 School of Engineering 6

17 Three Variable Maps Three variable maps exhibit the following characteristics:. One box represents minterm with 3 literals 2. Rectangle of 2 boxes -> 2 literals 3. Rectangle of 4 boxes -> literal 4. Rectangle of 8 boxes -> Logic (on 3-variable map) 97 Consensus Theorem Slight Variation XY + X + Y = XY + X The third term is redundant Can just drop What does it mean? For third term to be true, Y & both Then one of the first two terms must be! Overlap is OK. No need to use full m 5 -- waste of input 98 0 Proof of Consensus Theorem Another Example XY + X + Y = XY + X + Y( X + X ) XY + X + XY + XY XY + XY+ X+ XY XY ( + ) + X( + Y ) XY +X 99 Four adjacent corners can be combined to form the two literal term x z. Four adjacent squares can be combined to form the two literal term x y. The remaining is combined with a single adjacent to obtain the three literal term w y z. F = x z + x y+ w y z 02 School of Engineering 7

Chapter 2 Combinational Logic Circuits

Chapter 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 information

Number System conversions

Number 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 information

CHAPTER III BOOLEAN ALGEBRA

CHAPTER 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 information

Karnaugh Maps Objectives

Karnaugh Maps Objectives Karnaugh Maps Objectives For Karnaugh Maps of up to 5 variables Plot a function from algebraic, minterm or maxterm form Obtain minimum Sum of Products and Product of Sums Understand the relationship between

More information

CHAPTER III BOOLEAN ALGEBRA

CHAPTER 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 information

Lecture 6: Manipulation of Algebraic Functions, Boolean Algebra, Karnaugh Maps

Lecture 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 information

CS 121 Digital Logic Design. Chapter 2. Teacher Assistant. Hanin Abdulrahman

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 information

Lecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions

Lecture 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 information

Chapter 2 Boolean Algebra and Logic Gates

Chapter 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 information

Chapter 2 Combinational Logic Circuits

Chapter 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 information

Chap 2. Combinational Logic Circuits

Chap 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 information

UNIT 5 KARNAUGH MAPS Spring 2011

UNIT 5 KARNAUGH MAPS Spring 2011 UNIT 5 KRNUGH MPS Spring 2 Karnaugh Maps 2 Contents Minimum forms of switching functions Two- and three-variable Four-variable Determination of minimum expressions using essential prime implicants Five-variable

More information

Chapter 2: Princess Sumaya Univ. Computer Engineering Dept.

Chapter 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 information

E&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 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 information

Logic Design. Chapter 2: Introduction to Logic Circuits

Logic 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 information

MC9211 Computer Organization

MC9211 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 information

This form sometimes used in logic circuit, example:

This 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 information

Binary Logic and Gates. Our objective is to learn how to design digital circuits.

Binary 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 information

EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive

EECS150 - 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 information

Unit 2 Session - 6 Combinational Logic Circuits

Unit 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 Product-of-Sums

More information

211: Computer Architecture Summer 2016

211: 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 information

Week-I. Combinational Logic & Circuits

Week-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

Slide 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 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 information

Chapter 2 Combinational Logic Circuits

Chapter 2 Combinational Logic Circuits Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization Goal: To obtain the simplest implementation for a given function Optimization is a more formal

More information

Boolean Algebra & Logic Gates. By : Ali Mustafa

Boolean 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 information

Binary Logic and Gates

Binary 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 information

Chapter 2: Boolean Algebra and Logic Gates

Chapter 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 information

The Karnaugh Map COE 202. Digital Logic Design. Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals

The Karnaugh Map COE 202. Digital Logic Design. Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals The Karnaugh Map COE 202 Digital Logic Design Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals Presentation Outline Boolean Function Minimization The Karnaugh Map (K-Map) Two, Three,

More information

E&CE 223 Digital Circuits & Systems. Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev. Section 2: Boolean Algebra & Logic Gates

E&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 information

Lecture 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 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 information

Gate-Level Minimization

Gate-Level Minimization Gate-Level Minimization Dr. Bassem A. Abdullah Computer and Systems Department Lectures Prepared by Dr.Mona Safar, Edited and Lectured by Dr.Bassem A. Abdullah Outline 1. The Map Method 2. Four-variable

More information

Digital Logic Design. Combinational Logic

Digital 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 information

Chapter 2: Switching Algebra and Logic Circuits

Chapter 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 information

ECEN 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 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 information

CHAPTER 5 KARNAUGH MAPS

CHAPTER 5 KARNAUGH MAPS CHAPTER 5 1/36 KARNAUGH MAPS This chapter in the book includes: Objectives Study Guide 5.1 Minimum Forms of Switching Functions 5.2 Two- and Three-Variable Karnaugh Maps 5.3 Four-Variable Karnaugh Maps

More information

Review. EECS Components and Design Techniques for Digital Systems. Lec 06 Minimizing Boolean Logic 9/ Review: Canonical Forms

Review. 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/16-04 David Culler Electrical Engineering and Computer Sciences University of California, Berkeley

More information

Combinational Logic. Review of Combinational Logic 1

Combinational 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 information

Logic Design I (17.341) Fall Lecture Outline

Logic Design I (17.341) Fall Lecture Outline Logic Design I (17.341) Fall 2011 Lecture Outline Class # 06 October 24, 2011 Dohn Bowden 1 Today s Lecture Administrative Main Logic Topic Homework 2 Course Admin 3 Administrative Admin for tonight Syllabus

More information

ELCT201: DIGITAL LOGIC DESIGN

ELCT201: 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 information

Ch 2. Combinational Logic. II - Combinational Logic Contemporary Logic Design 1

Ch 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 information

ECE 20B, Winter 2003 Introduction to Electrical Engineering, II LECTURE NOTES #2

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 information

Chapter 2. Boolean Algebra and Logic Gates

Chapter 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 information

DIGITAL ELECTRONICS & it0203 Semester 3

DIGITAL 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 information

Chapter 2 Boolean Algebra and Logic Gates

Chapter 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 information

ELC224C. Karnaugh Maps

ELC224C. Karnaugh Maps KARNAUGH MAPS Function Simplification Algebraic Simplification Half Adder Introduction to K-maps How to use K-maps Converting to Minterms Form Prime Implicants and Essential Prime Implicants Example on

More information

2009 Spring CS211 Digital Systems & Lab CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS

2009 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 information

Logic Gate Level. Part 2

Logic 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 information

Simplifying Logic Circuits with Karnaugh Maps

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

More information

Chapter 2 Boolean Algebra and Logic Gates

Chapter 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 information

Logic 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 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 information

II. COMBINATIONAL LOGIC DESIGN. - algebra defined on a set of 2 elements, {0, 1}, with binary operators multiply (AND), add (OR), and invert (NOT):

II. 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 information

Chapter 2 Combinational logic

Chapter 2 Combinational logic Chapter 2 Combinational logic Chapter 2 is very easy. I presume you already took discrete mathemtics. The major part of chapter 2 is boolean algebra. II - Combinational Logic Copyright 24, Gaetano Borriello

More information

Boolean Algebra and Logic Gates

Boolean 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 information

Chapter 2 Combinational Logic Circuits

Chapter 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 information

Digital Logic (2) Boolean Algebra

Digital Logic (2) Boolean Algebra Digital Logic (2) Boolean Algebra Boolean algebra is the mathematics of digital systems. It was developed in 1850 s by George Boole. We will use Boolean algebra to minimize logic expressions. Karnaugh

More information

Administrative Notes. Chapter 2 <9>

Administrative 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 information

EEE130 Digital Electronics I Lecture #4

EEE130 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 information

CHAPTER 3 BOOLEAN ALGEBRA

CHAPTER 3 BOOLEAN ALGEBRA CHAPTER 3 BOOLEAN ALGEBRA (continued) This chapter in the book includes: Objectives Study Guide 3.1 Multiplying Out and Factoring Expressions 3.2 Exclusive-OR and Equivalence Operations 3.3 The Consensus

More information

CPE100: Digital Logic Design I

CPE100: 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 information

Chapter-2 BOOLEAN ALGEBRA

Chapter-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 information

Combinational Logic Fundamentals

Combinational 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 information

DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA (CONT.)

DIGITAL 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 information

Signals and Systems Digital Logic System

Signals 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 information

EC-121 Digital Logic Design

EC-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 information

CHAPTER1: Digital Logic Circuits Combination Circuits

CHAPTER1: 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 information

Chapter 2 Combinational

Chapter 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 information

CHAPTER 2 BOOLEAN ALGEBRA

CHAPTER 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 information

Combinatorial Logic Design Principles

Combinatorial 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 information

Minimization techniques

Minimization techniques Pune Vidyarthi Griha s COLLEGE OF ENGINEERING, NSIK - 4 Minimization techniques By Prof. nand N. Gharu ssistant Professor Computer Department Combinational Logic Circuits Introduction Standard representation

More information

Chapter 3. Boolean Algebra. (continued)

Chapter 3. Boolean Algebra. (continued) Chapter 3. Boolean Algebra (continued) Algebraic structure consisting of: set of elements B binary operations {+, -} unary operation {'} Boolean Algebra such that the following axioms hold:. B contains

More information

Midterm1 Review. Jan 24 Armita

Midterm1 Review. Jan 24 Armita Midterm1 Review Jan 24 Armita Outline Boolean Algebra Axioms closure, Identity elements, complements, commutativity, distributivity theorems Associativity, Duality, De Morgan, Consensus theorem Shannon

More information

EEA051 - Digital Logic 數位邏輯 吳俊興高雄大學資訊工程學系. September 2004

EEA051 - 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 information

DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA

DIGITAL 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 information

Digital Circuit And Logic Design I. Lecture 3

Digital 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 information

Lecture 7: Karnaugh Map, Don t Cares

Lecture 7: Karnaugh Map, Don t Cares EE210: Switching Systems Lecture 7: Karnaugh Map, Don t Cares Prof. YingLi Tian Feb. 28, 2019 Department of Electrical Engineering The City College of New York The City University of New York (CUNY) 1

More information

Review for Test 1 : Ch1 5

Review for Test 1 : Ch1 5 Review for Test 1 : Ch1 5 October 5, 2006 Typeset by FoilTEX Positional Numbers 527.46 10 = (5 10 2 )+(2 10 1 )+(7 10 0 )+(4 10 1 )+(6 10 2 ) 527.46 8 = (5 8 2 ) + (2 8 1 ) + (7 8 0 ) + (4 8 1 ) + (6 8

More information

CS 226: Digital Logic Design

CS 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 information

EECS150 - 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) 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 information

Contents. Chapter 3 Combinational Circuits Page 1 of 36

Contents. Chapter 3 Combinational Circuits Page 1 of 36 Chapter 3 Combinational Circuits Page of 36 Contents Combinational Circuits...2 3. Analysis of Combinational Circuits...3 3.. Using a Truth Table...3 3..2 Using a Boolean Function...6 3.2 Synthesis of

More information

Functions. Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways:

Functions. 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 information

Possible logic functions of two variables

Possible 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 information

Every time has a value associated with it, not just some times. A variable can take on any value within a range

Every 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 information

Outline. EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) Combinational Logic (CL) Defined

Outline. 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 information

Chapter 2 : Boolean Algebra and Logic Gates

Chapter 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 information

UNIT 3 BOOLEAN ALGEBRA (CONT D)

UNIT 3 BOOLEAN ALGEBRA (CONT D) UNIT 3 BOOLEAN ALGEBRA (CONT D) Spring 2011 Boolean Algebra (cont d) 2 Contents Multiplying out and factoring expressions Exclusive-OR and Exclusive-NOR operations The consensus theorem Summary of algebraic

More information

1 Boolean Algebra Simplification

1 Boolean Algebra Simplification cs281: Computer Organization Lab3 Prelab Our objective in this prelab is to lay the groundwork for simplifying boolean expressions in order to minimize the complexity of the resultant digital logic circuit.

More information

Standard Expression Forms

Standard 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 information

Combinational Logic Circuits Part II -Theoretical Foundations

Combinational 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 information

ECE 238L Boolean Algebra - Part I

ECE 238L Boolean Algebra - Part I ECE 238L Boolean Algebra - Part I August 29, 2008 Typeset by FoilTEX Understand basic Boolean Algebra Boolean Algebra Objectives Relate Boolean Algebra to Logic Networks Prove Laws using Truth Tables Understand

More information

1. Name the person who developed Boolean algebra

1. 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 information

Boolean Algebra and Digital Logic

Boolean 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 information

INTRODUCTION TO INFORMATION & COMMUNICATION TECHNOLOGY LECTURE 8 : WEEK 8 CSC-110-T

INTRODUCTION 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 information

Combinational Logic Design Principles

Combinational 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 information

Lecture 2 Review on Digital Logic (Part 1)

Lecture 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 information

Part 1: Digital Logic and Gates. Analog vs. Digital waveforms. The digital advantage. In real life...

Part 1: Digital Logic and Gates. Analog vs. Digital waveforms. The digital advantage. In real life... Part 1: Digital Logic and Gates Analog vs Digital waveforms An analog signal assumes a continuous range of values: v(t) ANALOG A digital signal assumes discrete (isolated, separate) values Usually there

More information

CHAPTER 7. Exercises 17/ / /2 2 0

CHAPTER 7. Exercises 17/ / /2 2 0 CHAPTER 7 Exercises E7. (a) For the whole part, we have: Quotient Remainders 23/2 /2 5 5/2 2 2/2 0 /2 0 Reading the remainders in reverse order, we obtain: 23 0 = 0 2 For the fractional part we have 2

More information

EECS Variable Logic Functions

EECS 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 information

Systems I: Computer Organization and Architecture

Systems I: Computer Organization and Architecture Systems I: Computer Organization and Architecture Lecture 6 - Combinational Logic Introduction A combinational circuit consists of input variables, logic gates, and output variables. The logic gates accept

More information

Ex: Boolean expression for majority function F = A'BC + AB'C + ABC ' + ABC.

Ex: 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 information

Simplification of Boolean Functions. Dept. of CSE, IEM, Kolkata

Simplification 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 information