Chapter 2 Combinational

Size: px
Start display at page:

Download "Chapter 2 Combinational"

Transcription

1 Computer Engineering 1 (ECE290) Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations HOANG Trang Reference: 2008 Pearson Education, Inc.

2 Overview Part 1 Gate Circuits and Boolean Equations Binar Logic and Gates Boolean Algebra Standard Forms Part 2 Circuit Optimization Two-Level Optimization Map Manipulation Practical Optimization i (Espresso) Multi-Level Circuit Optimization Part 3 Additional Gates and Circuits Other Gate Tpes Eclusive-OR Operator and Gates High-Impedance Outputs HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 2

3 Binar Logic and Gates Binar variables take on one of two values.(0,1) Logical operators operate on binar values and binar variables. Basic logical operators are the logic functions AND, OR and NOT. (an function: from 3 basic function) Logic gates (electronic circuit ) implement logic functions. Boolean Algebra: a useful mathematical sstem for specifing i and transforming logic functions. We stud Boolean algebra as a foundation for designing and analzing digital sstems! HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 3

4 Binar Variables Recall that the two binar values have different names: True/False On/Off Yes/No 1/0 We use 1 and 0 to denote the two values. Variable identifier eamples: A, B,, z, or X 1 for now RESET, START_IT, or ADD1 later HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 4

5 Logical Operations The three basic logical operations are: AND OR NOT AND is denoted b a dot ( ),(^). OR is denoted b a plus (+), (v). NOT is denoted b an overbar ( )a ), single quote mark (') after, or (~) before the variable. HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 5

6 Notation Eamples Eamples: Y A B Or Y=AB z is read Y is equal to A AND B. is read z is equal to OR. X A is read X is equal to NOT A. Note: The statement: = 2 (read one plus one equals two ) = 10B (2)??? Binar (this is: binar operation is not the same as = 1 (read 1 or 1 equals 1 ). (logic) HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 6

7 Operator Definitions Operations are defined on the values "0" and "1" for each operator: AND OR NOT 0 0 = = = = = = = = HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 7

8 Truth Tables Truth table a tabular listing of the values of a function for all possible combinations of values on its arguments Eample: Truth tables for the basic logic operations: AND OR NOT X Y Z=X Y X Y Z=X+Y X Z X HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 8

9 Logic Function Implementation Using Switches For IC implementation For inputs: logic 1 is switch closed logic 0 is switch open For outputs: logic 1 is light on logic 0 is light off. NOT uses a switch such that: logic 1 is switch open logic 0 is switch closed Switches in parallel => OR Switches in series => AND Normall-closed l switch => NOT C HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 9

10 Logic Function Implementation (Continued) Eample: Logic Using Switches A B C D Light is on (L = 1) for L(A, B, C, D) = and off (L = 0), otherwise. Useful model for rela circuits and for CMOS gate circuits, the foundation of current digital logic technolog HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 10

11 Logic Gates In the earliest computers, switches were opened and closed b magnetic fields produced b energizing coils in relas. The switches in turn opened and closed the current paths. Later, vacuum tubes that open and close current paths electronicall replaced relas. Toda, transistors are used as electronic switches that open and close current paths. Optional: Chapter 6 Part 1: The Design Space HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 11

12 Logic Gate Smbols and Behavior X Y Logic gates have special smbols: AND gate X Z 5 X Y Z 5 X 1 Y X Z 5 X Y OR gate (a) Graphic smbols And waveform behavior in time as follows: X NOT gate or inverter Y (AND) X Y (OR) X1 Y (NOT) X (b) Timing diagram HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 12

13 Gate Dela In actual phsical gates, if one or more input changes causes the output t to change, the output t change does not occur instantaneousl. The dl dela bt between an input change(s) () and dthe resulting output change is the gate dela denoted b t G : Input 0 1 Output t G t G t G = ns Time (ns) HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 13

14 Logic Diagrams and Epressions X Y Z Truth Table F X Y Z X Equation F X Y Z Logic Diagram Y F Z Boolean equations, truth tables and logic diagrams describe the same function!: 3 methods and same function Truth tables are unique; epressions and logic diagrams are not. This gives fleibilit in implementing functions. HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 14

15 Boolean Algebra An algebraic structure defined on a set of at least two elements, B, together with three binar operators (denoted +, and ) that satisfies the following basic identities: 1. X + 0 = X 2. X. 1 = X 3. X + 1 = 1 4. X. 0 = 0 5. X + X = X 6. X. X = X 7. X + X = 1 8. X. X = 0 9. X = X 10. X + Y = Y + X 11. XY = YX Commutative 12. (X + Y) + Z = X + (Y + Z) 13. (XY) Z = X(YZ) Associative 14. X(Y + Z) = XY+ XZ 15. X+ YZ = (X + Y)(X + Z) Distributive 16. X+Y = X. Y 17. X. Y = X + Y DeMorgan s DeMorgans AND -> OR, OR-> AND) HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 15

16 Some Properties of Identities & the Algebra If the meaning is unambiguous, we leave out the smbol The identities i i above are organized into pairs. These pairs have names as follows: 1-4 Eistence of 0 and Idempotence 7-8 Eistence of complement 9 Involution Commutative Laws Associative Laws Distributive Laws DeMorgan s Laws The dual of an algebraic epression is obtained b interchanging + and and interchanging 0 s and 1 s. The identities appear in dual pairs. When there is onl one identit on a line the identit is self-dual dual, ie i. e., the dual epression = the original epression. HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 16

17 Some Properties of Identities & the Algebra (Continued) Unless it happens to be self-dual, the dual of an epression does not equal the epression itself. Eample: F = (A + C) B+0 dual F = (A C + B) 1 = A C + B Eample: G = X Y+(W+Z) + dual G = Eample: H = A B+A C+B C dual H = Are an of these functions self-dual? l? HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 17

18 Some Properties of Identities & the Algebra (Continued) There can be more that 2 elements in B, i. e., elements other than 1 and 0. What are some common useful Boolean algebras with more than 2 elements? 1. Algebra of Sets 2. Algebra of n-bit binar vectors If B contains onl 1 and 0, then B is called the switching algebra which is the algebra we use most often. HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 18

19 Boolean Operator Precedence The order of evaluation in a Boolean epression is: 1. Parentheses 2. NOT 3. AND 4. OR Consequence: Parentheses appear around dor epressions Eample: F = A(B + C)(C + D) HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 19

20 Eample 1: Boolean Algebraic Proof A + A B = A (Absorption Theorem) Proof Steps Justification (identit or theorem) A + A B = A 1 + A B X = X 1 = A ( 1 + B) X Y + X Z = X (Y + Z)(Distributive Law) = A X = 1 = A X 1 = X Our primar reason for doing proofs is to learn: Careful and efficient use of the identities and theorems of Boolean algebra, and How to choose the appropriate p identit or theorem to appl to make forward progress, irrespective of the application. HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 20

21 Eample 2: Boolean Algebraic Proofs AB + AC + BC = AB + AC (Consensus Theorem) Proof Steps Justification (identit or theorem) AB + AC + BC =AB+AC+1 BC AC + BC? = AB +AC + (A + A) BC? = HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 21

22 Eample 3: Boolean Algebraic Proofs ( X Y)Z XY Y(X Z) Proof Steps Justification (identit or theorem) ( X Y )Z X Y = HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 22

23 Useful Theorems n Minimizatio tion Simplifica Absorption tion Simplifica Consensus z z z z z z DeMorgan's Laws g HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 23

24 Proof of Simplification HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 24

25 Proof of DeMorgan s Laws HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 25

26 Boolean Function Evaluation F1 F2 F3 F4 z z z F1 F2 F3 F4 z z z HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 26

27 Epression Simplification An application of Boolean algebra Simplif to contain the smallest number of literals (complemented and uncomplemented variables): A B ACD A BD AC D A BCD = AB + ABCD + A C D + A C D + A B D = AB + AB(CD) + A C (D + D) + A B D = AB + A C + A B D = B(A + AD) +AC = B (A + D) + A C 5 literals HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 27

28 Complementing Functions Use DeMorgan's Theorem to complement a function: 1. Interchange AND and OR operators 2. Complement each constant value and literal Eample: Complement F = F=(++z)(++z) z z Eample: Complement G = (a + bc)d + e G = HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 28

29 Overview Canonical Forms What are Canonical Forms? Minterms and Materms Inde Representation of Minterms and Materms Sum-of-Minterm (SOM) Representations Product-of-Materm (POM) Representations Representation of fcomplements of ffunctions Conversions between Representations HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 29

30 Canonical Forms It is useful to specif Boolean functions in a form that: Allows comparison for equalit. Has a correspondence to the truth tables Canonical Forms in common usage: Sum of Minterms (SOM) Product of Materms (POM) HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 30

31 Minterms Minterms are AND terms with ever variable present in either true or complemented form. Given that each binar variable ma appear normal (e.g., ) or complemented (e.g., ), there are 2 n minterms for n variables. Eample: Two variables (X and Y)produce 2 2 = 4 combinations: (both normal) XY XY Y(X normal, Y complemented) (minterm) XY (X complemented, Y normal) XY (both complemented) Thus there are four minterms of two variables. HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 31

32 Materms Materms are OR terms with ever variable in true or complemented form. Given that each binar variable ma appear normal (e.g., ) or complemented (e.g., ), there are 2 n materms for n variables. Eample: Two variables (X and Y) produce 2 2 = 4 combinations: X Y (both normal) X Y ( normal, complemented) X Y ( complemented, normal) (b th l t d) X Y (both complemented) HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 32

33 Materms and Minterms Eamples: Two variable minterms and materms. Inde Minterm Materm 0 ( The inde above is important for describing which variables in the terms are true and which are complemented. HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 33

34 Standard Order Minterms and materms are designated with a subscript The subscript is a number, corresponding to a binar pattern The bits in the pattern represent the complemented or normal state of each variable listed in a standard order. All variables will be present in a minterm or materm and will be listed in the same order (usuall alphabeticall) Eample: For variables a, b, c: Materms: (a + b + c), (a + b + c) Terms: (b + a + c), a c b, and (c + b + a) are NOT in standard order. Minterms: a b c, a b c, a b c Terms: (a + c), b c, and (a + b) do not contain all variables HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 34

35 Purpose of the Inde The inde for the minterm or materm, epressed as a binar number, is used dto determine whether the variable is shown in the true form or complemented form. For Minterms: 1 means the variable is Not Complemented and 0 means the variable is Complemented. For Materms: 0 means the variable is Not Complemented and 1 means the variable is Complemented. HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 35

36 Inde Eample in Three Variables Eample: (for three variables) Assume the variables are called X, Y, and Z. The standard order is X, then Y, then Z. The Inde 0 (base 10) = 000 (base 2) for three variables). All three variables are complemented for minterm 0( X, Y, Z ) and no variables are complemented for Materm 0 (X,Y,Z). Minterm 0, called m 0 is XYZ. Materm 0, called M 0 is (X + Y + Z). Minterm 6? Materm 6? HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 36

37 Inde Eamples Four Variables Inde Binar Minterm Materm i Pattern m i M i abcd a b c d abcd? ? a b c d a bcd a b c d ? a b c d a bcd a b c d abcd? abcd a b c d HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 37

38 Minterm and Materm Relationship Review: DeMorgan's Theorem and Two-variable eample: M and m 2 2 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 m m M i i i i and i Thus M i is the complement of m i. HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 38

39 Function Tables for Both Minterms of Materms of 2 variables 2 variables m 0 m 1 m 2 m 3 M 0 M 1 M 2 M Each column in the materm function table is the complement of the column in the minterm function table since M i is the complement of m i. HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 39

40 Observations In the function tables: Each minterm has one and onl one 1 present in the 2 n terms (a minimum i of f1 1s). All other entries are 0. Each materm has one and onl one 0 present in the 2 n terms All other entries are 1 (a maimum of 1s). We can implement an function b "ORing" " the minterms corresponding to "1" entries in the function table. These are called the minterms of the function. We can implement an function b "ANDing" the materms corresponding to "0" entries in the function table. These are called the materms of the function. This gives us two canonical forms: Sum of Minterms (SOM) (Sum of Product SOP) Product of Materms (POM) (Product of Sum POS) for stating an Boolean function. HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 40

41 Minterm Function Eample Eample: Find F 1 = m 1 + m 4 + m 7 F1 = z + z + z z inde m 1 + m 4 + m 7 = F = = = = = = = = 1 HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 41

42 Minterm Function Eample F(A, B, C, D, E) = m 2 + m 9 + m 17 + m 23 F(A, B, C, D, E) = HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 42

43 Materm Function Eample Eample: Implement F1 in materms: F 1 = M 0 M 2 M 3 M 5 M 6 F1 ( z) ( z) ( z) ( z) ( z) z i M 0 M 2 M 3 M 5 M 6 = F = = = = = = = = 1 HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 43

44 Materm Function Eample F(A,B,C,D) M M M M 14 F(A, B,C,D) = HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 44

45 Canonical Sum of Minterms An Boolean function can be epressed as a Sum of Minterms. For the function table, the minterms used are the terms corresponding to the 1's For epressions, epand all terms first to eplicitl list all minterms. Do this b ANDing an term missing a variable v with a term ( ). v v Eample: Implement f as a sum of minterms. First epand terms: f ( ) Then distribute terms: f Epress as sum of minterms: f = m 3 + m 2 + m 0 HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 45

46 Another SOM Eample Eample: F A B C There are three variables, A, B, and C which h we take to be the standard order. Epanding the terms with missing variables: Collect terms (removing all but one of duplicate terms): Epress as SOM: HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 46

47 Shorthand SOM Form From the previous eample, we started with: F A B C We ended up with: F = m 1 +m 4 +m 5 +m 6 +m 7 This can be denoted in the formal shorthand: F(A, B,C) m(1,4,5,6,7) Note that we eplicitl show the standard variables in order and drop the m designators. HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 47

48 Canonical Product of Materms An Boolean Function can be epressed as a Product of Materms (POM). For the function table, the materms used are the terms corresponding to the 0's. For an epression, epand all terms first to eplicitl list all materms. Do this b first appling the second distributive law, ORing terms missing variable v with a term equal to and then appling the distributive law again. Eample: Convert to product of materms: f(,, z) Appl the distributive law: Add missing variable z: v ( )( ) 1 ( ) z z ( z) z Epress as POM: f = M 2 M 3 HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 48 v

49 Another POM Eample Convert to Product of Materms: f(a, B,C) A C BC A B Use + z = (+) (+z) with (A C BC), A, and z B to oge get: f (A C BC A)(A C BC B) Then use to get: f (C BC A)(AC C B) and a second time to get: f (C B A)(A C B) Rearrange to standard order, f (A B C)(A B C) to give f = M 5 M 2 HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 49

50 Function Complements The complement of a function epressed as a sum of minterms is constructed t db selecting the minterms missing in the sum-of-minterms canonical forms. Alternativel, the complement of a function epressed b a Sum of Minterms form is simpl the Product of Materms with the same indices. Eample: Given F(,, z) m (1,3,5,7 ) F(,, z) F(,, z) m (0,2,4,6) (1,3,5,7) M HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 50

51 Conversion Between Forms To convert between sum-of-minterms and product- of-materms form (or vice-versa) versa) we follow these steps: Find the function complement b swapping terms in the list with terms not in the list. Change from products to sums, or vice versa. Eample:Given F as before: Form the Complement: F(,, z) F(,, z) m(1,3,5,7) (0,2,4,6),, Then use the other form with the same indices this forms the complement again, giving the other form of the original function: F(,, z) M(0,2,4,6) HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 51 m

52 Standard Forms Standard Sum-of-Products (SOP) form: equations are written as an OR of AND terms Standard Product-of-Sums (POS) form: equations are written as an AND of OR terms Eamples: SOP: A B C A B C B POS: (A B) (AB C) C These mied forms are neither SOP nor POS (A B C) (A C) ABC AC(A B) HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 52

53 Standard Sum-of-Products (SOP) A sum of minterms form for n variables can be written down directl from a truth table. Implementation of this form is a two-level network of gates such that: The first level consists stsof n-input n AND gates, and The second level is a single OR gate (with fewer than 2 n inputs). This form often can be simplified so that the corresponding circuit it is simpler. HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 53

54 Standard Sum-of-Products (SOP) A Simplification Eample: F (A, B,C) m(1,4,5,6,7) Writing the minterm epression: F=ABC+ABC+ABC+ABC+ABC A B C + A B C + + Simplifing: F= Simplified F contains 3 literals compared to 15 in minterm F HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 54

55 AND/OR Two-level Implementation of SOP Epression The two implementations for F are shown bl below it is quite apparent which h is simpler! A B C A B C A B C A B C A B C F HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 55 A B C F

56 SOP and POS Observations The previous eamples show that: Canonical Forms (Sum-of-minterms, minterms Product-of- of Materms), or other standard forms (SOP, POS) differ in compleit Boolean algebra can be used to manipulate equations into simpler forms. Simpler equations lead to simpler two-level implementations Questions: How can we attain a simplest epression? Is there onl one minimum cost circuit? The net part will deal with these issues. HOANG Trang, Ref: Pearson Education, Inc. Chapter 2 - Part 1 56

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

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

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

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

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

Goals for Lecture. Binary Logic and Gates (MK 2.1) Binary Variables. Notation Examples. Logical Operations

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

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

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

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

ENG2410 Digital Design Combinational Logic Circuits

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

Computer Organization I

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

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

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

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

University of Technology

University of Technology University of Technology Lecturer: Dr. Sinan Majid Course Title: microprocessors 4 th year معالجات دقيقة المرحلة الرابعة ھندسة الليزر والبصريات االلكترونية Lecture 3 & 4 Boolean Algebra and Logic Gates

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

Chapter 2 Combinational Logic Circuits

Chapter 2 Combinational Logic Circuits Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization Charles Kime & Thomas Kaminski 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active

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

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

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

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

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

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

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

CpE358/CS381. Switching Theory and Logical Design. Class 2

CpE358/CS381. Switching Theory and Logical Design. Class 2 CpE358/CS38 Switching Theor and Logical Design Class 2 CpE358/CS38 Switching Theor and Logical Design Summer- 24 Copright 24 Stevens Institute of Technolog -45 Toda s Material Fundamental concepts of digital

More information

Lecture 4: More Boolean Algebra

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

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

Boolean Algebra and Logic Design (Class 2.2 1/24/2013) CSE 2441 Introduction to Digital Logic Spring 2013 Instructor Bill Carroll, Professor of CSE

Boolean Algebra and Logic Design (Class 2.2 1/24/2013) CSE 2441 Introduction to Digital Logic Spring 2013 Instructor Bill Carroll, Professor of CSE Boolean Algebra and Logic Design (Class 2.2 1/24/2013) CSE 2441 Introduction to Digital Logic Spring 2013 Instructor Bill Carroll, Professor of CSE Today s Topics Boolean algebra applications in logic

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

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

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

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

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

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

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

Boolean Algebra and Logic Gates

Boolean Algebra and Logic Gates Boolean Algebra and Logic Gates Prof. Wangrok Oh Dept. of Information Communications Eng. Chungnam National Universit Prof. Wangrok Oh(CNU) / 5 Overview Aiomatic Definition of Boolean Algebra 2 Basic Theorems

More information

Unit 2 Boolean Algebra

Unit 2 Boolean Algebra Unit 2 Boolean Algebra 1. Developed by George Boole in 1847 2. Applied to the Design of Switching Circuit by Claude Shannon in 1939 Department of Communication Engineering, NCTU 1 2.1 Basic Operations

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

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

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

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 2 Boolean Algebra

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

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

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

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

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

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

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

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

2 Application of Boolean Algebra Theorems (15 Points - graded for completion only)

2 Application of Boolean Algebra Theorems (15 Points - graded for completion only) CSE140 HW1 Solution (100 Points) 1 Introduction The purpose of this assignment is three-fold. First, it aims to help you practice the application of Boolean Algebra theorems to transform and reduce Boolean

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

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

Mark Redekopp, All rights reserved. Lecture 5 Slides. Canonical Sums and Products (Minterms and Maxterms) 2-3 Variable Theorems DeMorgan s Theorem

Mark Redekopp, All rights reserved. Lecture 5 Slides. Canonical Sums and Products (Minterms and Maxterms) 2-3 Variable Theorems DeMorgan s Theorem Lecture 5 Slides Canonical Sums and Products (Minterms and Materms) 2-3 Variable Theorems DeMorgan s Theorem Using products of materms to implement a function MAXTERMS Question Is there a set of functions

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

Digital Logic Design. Malik Najmus Siraj

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

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

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

8. BOOLEAN ALGEBRAS x x

8. BOOLEAN ALGEBRAS x x 8. BOOLEAN ALGEBRAS 8.1. Definition of a Boolean Algebra There are man sstems of interest to computing scientists that have a common underling structure. It makes sense to describe such a mathematical

More information

Digital Design. Digital Design

Digital Design. Digital Design Principles Of Digital Design Chapter 3 Boolean Algebra and Logic Design Boolean Algebra Logic Gates Digital Design Implementation Technology ASICs Gate Arrays Basic Algebraic Properties A set is a collection

More information

7.1. Unit 7. Minterm and Canonical Sums 2- and 3-Variable Boolean Algebra Theorems DeMorgan's Theorem Simplification using Boolean Algebra

7.1. Unit 7. Minterm and Canonical Sums 2- and 3-Variable Boolean Algebra Theorems DeMorgan's Theorem Simplification using Boolean Algebra 7.1 Unit 7 Minterm and Canonical Sums 2- and 3-Variable Boolean Algebra Theorems DeMorgan's Theorem Simplification using Boolean Algebra CHECKERS / DECODERS 7.2 7.3 Gates Gates can have more than 2 inputs

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

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

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

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

Learning Objectives 10/7/2010. CE 411 Digital System Design. Fundamental of Logic Design. Review the basic concepts of logic circuits. Dr.

Learning Objectives 10/7/2010. CE 411 Digital System Design. Fundamental of Logic Design. Review the basic concepts of logic circuits. Dr. /7/ CE 4 Digital ystem Design Dr. Arshad Aziz Fundamental of ogic Design earning Objectives Review the basic concepts of logic circuits Variables and functions Boolean algebra Minterms and materms ogic

More information

Chapter 2 Boolean Algebra and Logic Gates

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

Digital Logic Design ABC. Representing Logic Operations. Dr. Kenneth Wong. Determining output level from a diagram. Laws of Boolean Algebra

Digital Logic Design ABC. Representing Logic Operations. Dr. Kenneth Wong. Determining output level from a diagram. Laws of Boolean Algebra Digital Logic Design ENGG1015 1 st Semester, 2011 Representing Logic Operations Each function can be represented equivalently in 3 ways: Truth table Boolean logic expression Schematics Truth Table Dr.

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

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

Solutions to Assignment No 5 Digital Techniques Fall 2007

Solutions to Assignment No 5 Digital Techniques Fall 2007 Solutions to Assignment No 5 Digital Techniques Fall 2007 André Deutz October 19, 2007 1 Simplifying and Manipulating Boolean Expressions 1. Simplification (a) Simplify each of the following expressions,

More information

Mark Redekopp, All rights reserved. Lecture 4 Slides. Boolean Algebra Logic Functions Canonical Sums/Products

Mark Redekopp, All rights reserved. Lecture 4 Slides. Boolean Algebra Logic Functions Canonical Sums/Products Lecture 4 Slides Boolean Algebra Logic Functions Canonical Sums/Products LOGIC FUNCTION REPRESENTATION Logic Functions A logic function maps input combinations to an output value ( 1 or ) 3 possible representations

More information

Advanced Digital Design with the Verilog HDL, Second Edition Michael D. Ciletti Prentice Hall, Pearson Education, 2011

Advanced Digital Design with the Verilog HDL, Second Edition Michael D. Ciletti Prentice Hall, Pearson Education, 2011 Problem 2-1 Recall that a minterm is a cube in which every variable appears. A Boolean expression in SOP form is canonical if every cube in the expression has a unique representation in which all of the

More information

Boolean Algebra, Gates and Circuits

Boolean Algebra, Gates and Circuits Boolean Algebra, Gates and Circuits Kasper Brink November 21, 2017 (Images taken from Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc.) Outline Last week: Von

More information

Lecture 3: Boolean Algebra

Lecture 3: Boolean Algebra Lecture 3: 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 Overview

More information

In Module 3, we have learned about Exclusive OR (XOR) gate. Boolean Expression AB + A B = Y also A B = Y. Logic Gate. Truth table

In Module 3, we have learned about Exclusive OR (XOR) gate. Boolean Expression AB + A B = Y also A B = Y. Logic Gate. Truth table Module 8 In Module 3, we have learned about Exclusive OR (XOR) gate. Boolean Expression AB + A B = Y also A B = Y Logic Gate Truth table A B Y 0 0 0 0 1 1 1 0 1 1 1 0 In Module 3, we have learned about

More information

If f = ABC + ABC + A B C then f = AB C + A BC + AB C + A BC + A B C

If f = ABC + ABC + A B C then f = AB C + A BC + AB C + A BC + A B C Examples: If f 5 = AB + AB then f 5 = A B + A B = f 10 If f = ABC + ABC + A B C then f = AB C + A BC + AB C + A BC + A B C In terms of a truth table, if f is the sum (OR) of all the minterms with a 1 in

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

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

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

Boolean Algebra. Boolean Variables, Functions. NOT operation. AND operation. AND operation (cont). OR operation

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

BOOLEAN ALGEBRA. Introduction. 1854: Logical algebra was published by George Boole known today as Boolean Algebra

BOOLEAN ALGEBRA. Introduction. 1854: Logical algebra was published by George Boole known today as Boolean Algebra BOOLEAN ALGEBRA Introduction 1854: Logical algebra was published by George Boole known today as Boolean Algebra It s a convenient way and systematic way of expressing and analyzing the operation of logic

More information

Boolean Algebra and Logic Simplification

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

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

Logic and Computer Design Fundamentals. Chapter 2 Combinational Logic Circuits. Part 2 Circuit Optimization

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

Boolean Algebra CHAPTER 15

Boolean Algebra CHAPTER 15 CHAPTER 15 Boolean Algebra 15.1 INTRODUCTION Both sets and propositions satisfy similar laws, which are listed in Tables 1-1 and 4-1 (in Chapters 1 and 4, respectively). These laws are used to define an

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

ECE380 Digital Logic. Axioms of Boolean algebra

ECE380 Digital Logic. Axioms of Boolean algebra ECE380 Digital Logic Introduction to Logic Circuits: Boolean algebra Dr. D. J. Jackson Lecture 3-1 Axioms of Boolean algebra Boolean algebra: based on a set of rules derived from a small number of basic

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

Computer Organization I. Lecture 13: Design of Combinational Logic Circuits

Computer Organization I. Lecture 13: Design of Combinational Logic Circuits Computer Organization I Lecture 13: Design of Combinational Logic Circuits Overview The optimization of multiple-level circuits Mapping Technology Verification Objectives To know how to optimize the multiple-level

More information

UC Berkeley College of Engineering, EECS Department CS61C: Representations of Combinational Logic Circuits

UC Berkeley College of Engineering, EECS Department CS61C: Representations of Combinational Logic Circuits 2 Wawrzynek, Garcia 2004 c UCB UC Berkeley College of Engineering, EECS Department CS61C: Representations of Combinational Logic Circuits 1 Introduction Original document by J. Wawrzynek (2003-11-15) Revised

More information