CS 121 Digital Logic Design. Chapter 2. Teacher Assistant. Hanin Abdulrahman
|
|
- Marsha Robertson
- 5 years ago
- Views:
Transcription
1 CS 121 Digital Logic Design Chapter 2 Teacher Assistant Hanin Abdulrahman 1
2 2 Outline 2.2 Basic Definitions 2.3 Axiomatic Definition of Boolean Algebra. 2.4 Basic Theorems and Properties 2.5 Boolean Functions 2.6 Canonical and Standard Forms 2.7 Other Logic Operations 2.8 Digital Logic Gates
3 3 2.2 Basic Definitions (1-2) Boolean Algebra: Formulated by E.V. Huntington, A set of elements B={0,1} and two binary operators + and Closure x, y B x+y B x, y B x y B Commutative x + y = y + x x y = y x Associative (x+y)+z = x + (y + z) (x y) z = x (y z) Identity element 0+x = x+0 = x 1 x = x 1=x
4 4 2.2 Basic Definitions (2-2) Complement x B, x' B (complement of x) x+x'=1; x x'=0 Distributive Law Over +: x (y+z)=(x y)+(x z). Over : x+ (y.z)=(x+ y) (x+z).
5 2.3 Axiomatic Definition of Boolean Algebra (1-2) Two- Valued Boolean Algebra: 5 x y x y x y x+y = AND + = OR = NOT x x
6 2.3 Axiomatic Definition of Boolean Algebra (2-2) Two- Valued Boolean Algebra: 6 Distributive law: x (y+z)=(x y)+(x z)
7 2.4 Basic Theorems and Properties (1-7) Duality Principle Using Huntington rules, one part may be obtained from the other if the binary operators and the identity elements are interchanged. Duality done by: 1- Interchange OR and AND Operations 2- Replace the identity elements 1 s by 0 s and 0 s by 1 s. 7
8 2.4 Basic Theorems and Properties (2-7) Table 2.1 Postulates and Theorems of Boolean algebra Postulates 2 (a) X + 0 = X (b) Postulates 5 Theorem 1 (a) X + X = 1 (a) X + X = X (b) (b) Theorem 2 (a) X + 1 = 1 (b) Theorem 3, involution (X ) = X X. 1 X. X X. X = X = 0 = X X. 0 0 = Postulate 3,commutative(a) X + Y Theorem 4, associative Postulate 4, distributive Theorem 5, demorgan s Theorem 6,absorption (b) (a)(x + Y) + Z = X + (Y + Z) (b) (a) = Y + X X(Y + Z) = XY + XZ (a)(x + Y) = X. Y (a) X + XY = X (b) (b) (b) XY = YX (XY) Z X(Y Z) = X + YZ = (X + Y) (X + Z) (X. Y) X + Y = X(X+Y) = X Operator Precedence 1. Parentheses. 2. NOT. 3. AND. 4. OR.
9 2.4 Basic Theorems and Properties (3-7) Basic Theorems 9
10 2.4 Basic Theorems and Properties (4-7) Basic Theorems 10
11 2.4 Basic Theorems and Properties (5-7) Basic Theorems 11
12 2.4 Basic Theorems and Properties (6-7) Truth Table A table of all possible combinations of x and y variables showing the relation between the variable values and the result of the operation. 12 Theorem 6(a) Absorption The theorems of Boolean algebra can be proven by means of truth table.
13 2.4 Basic Theorems and Properties (7-7) Truth Table Theorem 5: DeMorgan theorem, (x + y) = x y 13
14 Boolean Functions (1-11) Example Logic Circuit Boolean Function List the truth table for the follwoing functions and draw their implementation gates. F 1 = x + (y z). F 2 = x y z + x yz + xy
15 2.5 Boolean Functions (1-11) F 1 = x + (y z) X Y Z Y Y *Z X + (y z)
16 2.5 Boolean Functions (1-11) Truth table 16
17 2.5 Boolean Functions (2-11) 17 Gate Implementation of F 1 F1= x + (y z).
18 2.5 Boolean Functions (3-11) 18 Gate Implementation of F 2 F2= x y z + x yz + xy
19 Boolean Functions (4-11) Gate Implementation F 2 after simplifying it F 2 = x y z + x yz + xy. F 2 = x (y z + yz) + xy. F 2 = x (z (y + y)) + xy. F 2 = x (z (1)) + xy. F 2 = x z + xy.
20 Boolean Functions (5-11) Algebraic Manipulation - Simplification Example Simplify the following Boolean functions to a minimum number of literals: x(x +y) =xx + xy =0+xy = xy x+x y =(x+x )(x+y) =1(x+y) = x+y
21 Boolean Functions (6-11) DeMorgan s Theorem (x+y)(x+y ) =x+ xy + xy +yy =x (1+ y + y ) =x xy + x z + yz = xy + x z + yz(x+x ) = xy + x z + xyz + x yz =xy(1+z) + x z (1+y) = xy + x z (x+y)(x +z)(y+z) =(x+y)(x +z) by duality function 4
22 2.5 Boolean Functions (7-11) Complement of a Function Complement of a variable x is x (0 1 and 1 0). The complement of a function F is x and is obtained from an interchange of 0 s for 1 s and 1 s for 0 s in the value of F The dual of a function is obtained from the interchange of AND and OR operators and 1 s and 0 s. Finding the complement of a funtion F Applying DeMorgan s theorem as many times as necessary. Complementing each literal of the dual of F 22
23 Boolean Functions (8-11) DeMorgan s Theorem 2-variable DeMorgan s Theorem (x + y) = x y. (xy) = x + y. 3-variable DeMorgan s Theorem
24 2.5 Boolean Functions (9-11) DeMorgan s Theorem Generalized DeMorgan s Theorem 24
25 Boolean Functions (10-11) Example A simpler procedure for deriving the complement of a function is to take the dual of the function and complement each literal. This method follows from the Generalized DeMorgan s Theorem
26 2.5 Boolean Functions (11-11) Example 26
27 Canonical and Standard Forms (1-23) Logic circuit Boolean function Truth table Any Boolean function can be expressed as a sum of minterms. Any Boolean function can be expressed as a product of maxterms
28 Canonical and Standard Forms (2-23) Minterms and Maxterms Minterm (or standard products): Any binary variable may appear either in its normal form (x) or in its complement form (x'). n variables combined with AND. n variables can be combined to form 2 n minterms. two Variables: x y, x y, xy, and xy A variable of a minterm is: Prime: if the corresponding bit of the binary number is a 0. Unprime: if the corresponding bit of the binary number is a => x y z (m 1 ) 100 => xy z (m 4 ) 111 => xyz (m 7 )
29 Canonical and Standard Forms (3-23) Minterms and Maxterms Maxterm (or standard sums): n variables combined with OR. A variable of a maxterm is: Prime: if the corresponding bit of the binary number is a 1. Unprime: if the corresponding bit of the binary number is a 0. Each maxterm is the complement of its corresponding minterm and vice versa. 001 => x + y + z (M 1 ) 100 => x + y + z (M 4 ) 111 => x + y + z (M 7 )
30 2.6 Canonical and Standard Forms (4-23) Minterms and Maxterms 30
31 Canonical and Standard Forms (5-23) Expressing Truth Table in Boolean Function Any Boolean function can be expressed as: Sum of minterms. Product of maxterms. (either 0 or 1 for each term) Said to be in a canonical form. Expressing Truth Table in Boolean Function Forming a minterm for each combination of the variables that produces a one in the function. Taking the OR of all those terms. n variables: 2 2n possible functions.
32 2.6 Canonical and Standard Forms (6-23) Expressing Truth Table in Boolean Function Example: 32
33 2.6 Canonical and Standard Forms (7-23) Expressing Truth Table in Boolean Function
34 Canonical and Standard Forms (8-23) Expressing Boolean Function in Sum of Minterms (Method 1 - Supplementing) Rule If the function is not in Minterm form Expanding the expression into a sum of AND terms. Each term is then inspected to see if it contains all the variables. If it misses one or more variables, it is ANDed with an expression such as x + x', where x is one of the missing variables.
35 2.6 Canonical and Standard Forms (9-23) Expressing Boolean Function in Sum of Minterms (Method 1 - Supplementing) Example Express the Boolean function F = A + B'C as a sum of minterm. 35
36 Canonical and Standard Forms (10-23) Expressing Boolean Function in Sum of Minterms (Method 1 - Supplementing) Example Short Notation: F(A, B, C ) = (1,4,5,6,7)
37 Canonical and Standard Forms (11-23) Expressing Boolean Function in Sum of Minterms (Method 1 - Supplementing) Short Notation: F(A, B, C ) = (1,4,5,6,7) Stands for the ORing of terms The minterms of the function List of the variables in the order taken when the minterm is converted to an AND term
38 Canonical and Standard Forms (12-23) Expressing Boolean Function in Sum of Minterms (Method 2 Truth Table) Example Express the Boolean function F = A + B'C as a sum of minterm, using the truth table F(A, B, C) = (1, 4, 5, 6,7) = (0, 2, 3) F (A, B, C) = (0, 2, 3) = (1, 4, 5, 6, 7)
39 Canonical and Standard Forms (13-23) Expressing Boolean Function in Product of Maxterms Rule If the function is not in Maxterm form Use distributive law e.g. x + yz = (x + y)(x + z) Each term is then inspected to see if it contains all the variables. If it misses one or more variables, it is ORed with an expression such as xx', where x is one of the missing variables.
40 2.6 Canonical and Standard Forms (14-23) Expressing Boolean Function in Product of Maxterms Example Express the Boolean function F = xy + x z as a product of maxterms. 40
41 2.6 Canonical and Standard Forms (15-23) Expressing Boolean Function in Product of Maxterms Example 41 Short Notation: F(A, B, C ) = (0,2,4,5) The minterms of the function List of the variables in the order taken when the maxterm is converted to an OR term Stands for the ANDing of terms
42 2.6 Canonical and Standard Forms (16-23) Conversion Between Canonical Forms Canonical conversion procedure Consider: F(A, B, C) = (1, 4, 5, 6, 7). F : complement of F = F (A, B, C) = (0, 2, 3) =m 0 +m 2 + m 3 (Missing minterms) Compute complement of F by DeMorgan s Theorem: m j =M j. Summary 42 F = (F ) = (m 0 +m 2 + m 3 ) = (m 0. m 2. m 3 ) = M 0. M 2. M 3 = (0, 2,3). (Obtain F in different form) Interchange the symbols and. List numbers missing from the original form. E.g. (1, 4, 5, 6, 7) = (0, 2,3). Shown by truth table (Table 2-5)
43 2.6 Canonical and Standard Forms (17-23) Two Canonical Forms of Boolean Algebra from Truth Table Example: Boolean exprexsion: x(x, y, z) = xy + x z 43 Truth Table Canonical Forms x(x, y, z) = (1, 3, 6, 7) = (0, 2, 4, 5)
44 2.6 Canonical and Standard Forms (18-23) 44 Standard Forms Canonical Forms: each minterm or maxterm must contain all the variables. Can be obtained from the truth table. Standard Forms: the terms that form the function may contain one, two, or any number of literals (variables). Canonical forms Standard forms Sum of Minterms, Product of Maxterms. Sum of Products, Product of Sums.
45 Canonical and Standard Forms (19-23) Two types of standard forms (2-level) Sum of Products Boolean expression containing AND terms, called product terms with one or more literals each. Sum denotes ORing of these term. E.g. F 1 = y + xy + x yz. Product of Sums Boolean expression containing OR terms, called sum terms with one or more literals each. Product denotes ANDing of these term. E.g. F 2 = x (y + z)(x + y + z )
46 2.6 Canonical and Standard Forms (20-23) Standard Form and Logic Circuit 46 Two level Implementation F 1 = y + xy + x yz
47 2.6 Canonical and Standard Forms (21-23) Standard Form and Logic Circuit 47 Two level Implementation F 2 = x (y + z)(x + y + z )
48 2.6 Canonical and Standard Forms (22-23) NonStandard Form and Logic Circuit 48 Three level Implementation NonStandard Form: F 3 = AB + C(D + E) Can be changed to a standard form by using distributive law
49 Canonical and Standard Forms (23-23) NonStandard Form and Logic Circuit Two level Implementation Standard Form: F 4 = AB + CD + CE A two-level implementation is preferred: produces the least amount of delay through the gates when the signal propagates from the inputs to the output
50 Other Logic Operations (1-3) There are 2 2n functions for n binary variables. For n =2: Where are 16 possible functions. AND and OR operators are two of them: x. y and x + y. Subdivided into Three Categories Two functions that produce a constant 0 or I. Four functions with unary operation: complement and transfer. Ten functions with binary operators that define eight different operations: AND, OR NAND, NOR, exclusive-or, equivalence (XNOR), inhibition, and implication.
51 2.7 Other Logic Operations (2-3) 51 Possible functions for the two n variables = 2 2n
52 2.7 Other Logic Operations (3-3) 52
53 Digital Logic Gates (1-9) Standard Gates Eight gates are: AND. OR. Complement (NOT) (Inverter = Buffer + Bubble) Transfer (Buffer) NAND. NOR. XOR. Equivelance. Each gate has one or two binary input variables, designated by x and y, and one binary output variable designated by F.
54 2.8 Digital Logic Gates (2-9) 54
55 2.8 Digital Logic Gates (3-9) 55
56 Digital Logic Gates (4-9) Mulitple Inputs Inverter and buffere accepts ONLY one variable. AND and OR functions are Communicative and Associative.
57 Digital Logic Gates (5-9) Mulitple Inputs NAND and NOR functions are Communicative but not Associative. Solution Define multiple NOR (or NAND) gate as a complemented OR (or AND) gate (Section 3-6)
58 2.8 Digital Logic Gates (6-9) Mulitple Inputs 58
59 2.8 Digital Logic Gates (7-9) 59
60 Digital Logic Gates (8-9) Mulitple Inputs XOR and equivalence gates are both Communicative and Associative. Uncommon, usually constructed with other types of gates. XOR is an odd function (Section 3.9).
61 2.8 Digital Logic Gates (9-9) Mulitple Inputs 61
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 informationEEA051 - Digital Logic 數位邏輯 吳俊興高雄大學資訊工程學系. September 2004
EEA051 - Digital Logic 數位邏輯 吳俊興高雄大學資訊工程學系 September 2004 Boolean Algebra (formulated by E.V. Huntington, 1904) A set of elements B={0,1} and two binary operators + and Huntington postulates 1. Closure
More informationChapter 2. Boolean Algebra and Logic Gates
Chapter 2 Boolean Algebra and Logic Gates Basic Definitions A binary operator defined on a set S of elements is a rule that assigns, to each pair of elements from S, a unique element from S. The most common
More informationBoolean Algebra and Logic Gates
Boolean Algebra and Logic Gates ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall, 2017 ldvan@cs.nctu.edu.tw http://www.cs.nctu.edu.tw/~ldvan/ Outlines Basic
More informationMC9211 Computer Organization
MC92 Computer Organization Unit : Digital Fundamentals Lesson2 : Boolean Algebra and Simplification (KSB) (MCA) (29-2/ODD) (29 - / A&B) Coverage Lesson2 Introduces the basic postulates of Boolean Algebra
More informationChapter 2 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 informationChapter 2 Boolean Algebra and Logic Gates
Chapter 2 Boolean Algebra and Logic Gates The most common postulates used to formulate various algebraic structures are: 1. Closure. N={1,2,3,4 }, for any a,b N we obtain a unique c N by the operation
More informationChapter 2: Princess Sumaya Univ. Computer Engineering Dept.
hapter 2: Princess Sumaya Univ. omputer Engineering Dept. Basic Definitions Binary Operators AND z = x y = x y z=1 if x=1 AND y=1 OR z = x + y z=1 if x=1 OR y=1 NOT z = x = x z=1 if x=0 Boolean Algebra
More informationChapter 2: Boolean Algebra and Logic Gates
Chapter 2: Boolean Algebra and Logic Gates Mathematical methods that simplify binary logics or circuits rely primarily on Boolean algebra. Boolean algebra: a set of elements, a set of operators, and a
More informationChapter 2 (Lect 2) Canonical and Standard Forms. Standard Form. Other Logic Operators Logic Gates. Sum of Minterms Product of Maxterms
Chapter 2 (Lect 2) Canonical and Standard Forms Sum of Minterms Product of Maxterms Standard Form Sum of products Product of sums Other Logic Operators Logic Gates Basic and Multiple Inputs Positive and
More informationChapter 2 : Boolean Algebra and Logic Gates
Chapter 2 : Boolean Algebra and Logic Gates 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 informationChapter 2: Switching Algebra and Logic Circuits
Chapter 2: Switching Algebra and Logic Circuits Formal Foundation of Digital Design In 1854 George Boole published An investigation into the Laws of Thoughts Algebraic system with two values 0 and 1 Used
More informationCHAPTER III BOOLEAN ALGEBRA
CHAPTER III- CHAPTER III CHAPTER III R.M. Dansereau; v.. CHAPTER III-2 BOOLEAN VALUES INTRODUCTION BOOLEAN VALUES Boolean algebra is a form of algebra that deals with single digit binary values and variables.
More informationIn Module 3, we have learned about Exclusive OR (XOR) gate. Boolean Expression AB + A B = Y also A B = Y. Logic Gate. Truth table
Module 8 In Module 3, we have learned about Exclusive OR (XOR) gate. Boolean Expression AB + A B = Y also A B = Y Logic Gate Truth table A B Y 0 0 0 0 1 1 1 0 1 1 1 0 In Module 3, we have learned about
More informationDigital Circuit And Logic Design I. Lecture 3
Digital Circuit And Logic Design I Lecture 3 Outline Combinational Logic Design Principles (). Introduction 2. Switching algebra 3. Combinational-circuit analysis 4. Combinational-circuit synthesis Panupong
More informationWeek-I. Combinational Logic & Circuits
Week-I Combinational Logic & Circuits Overview Binary logic operations and gates Switching algebra Algebraic Minimization Standard forms Karnaugh Map Minimization Other logic operators IC families and
More informationCHAPTER III BOOLEAN ALGEBRA
CHAPTER III- CHAPTER III CHAPTER III R.M. Dansereau; v.. CHAPTER III-2 BOOLEAN VALUES INTRODUCTION BOOLEAN VALUES Boolean algebra is a form of algebra that deals with single digit binary values and variables.
More informationII. COMBINATIONAL LOGIC DESIGN. - algebra defined on a set of 2 elements, {0, 1}, with binary operators multiply (AND), add (OR), and invert (NOT):
ENGI 386 Digital Logic II. COMBINATIONAL LOGIC DESIGN Combinational Logic output of digital system is only dependent on current inputs (i.e., no memory) (a) Boolean Algebra - developed by George Boole
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Chapter 2 - Part 1 2 Chapter 2 - Part 1 3 Chapter 2 - Part 1 4 Chapter 2 - Part
More informationDigital Logic Design. Malik Najmus Siraj
Digital Logic Design Malik Najmus Siraj siraj@case.edu.pkedu LECTURE 4 Today s Agenda Recap 2 s complement Binary Logic Boolean algebra Recap Computer Arithmetic Signed numbers Radix and diminished radix
More informationBoolean Algebra & Logic Gates. By : Ali Mustafa
Boolean Algebra & Logic Gates By : Ali Mustafa Digital Logic Gates There are three fundamental logical operations, from which all other functions, no matter how complex, can be derived. These Basic functions
More informationEC-121 Digital Logic Design
EC-121 Digital Logic Design Lecture 2 [Updated on 02-04-18] Boolean Algebra and Logic Gates Dr Hashim Ali Spring 2018 Department of Computer Science and Engineering HITEC University Taxila!1 Overview What
More informationLogic Design. Chapter 2: Introduction to Logic Circuits
Logic Design Chapter 2: Introduction to Logic Circuits Introduction Logic circuits perform operation on digital signal Digital signal: signal values are restricted to a few discrete values Binary logic
More informationChapter-2 BOOLEAN ALGEBRA
Chapter-2 BOOLEAN ALGEBRA Introduction: An algebra that deals with binary number system is called Boolean Algebra. It is very power in designing logic circuits used by the processor of computer system.
More informationCHAPTER 2 BOOLEAN ALGEBRA
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 informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active
More informationUnit 2 Boolean Algebra
Unit 2 Boolean Algebra 2.1 Introduction We will use variables like x or y to represent inputs and outputs (I/O) of a switching circuit. Since most switching circuits are 2 state devices (having only 2
More informationE&CE 223 Digital Circuits & Systems. Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev
E&CE 223 Digital Circuits & Systems Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev 4 of 92 Section 2: Boolean Algebra & Logic Gates Major topics Boolean algebra NAND & NOR gates Boolean
More informationWEEK 2.1 BOOLEAN ALGEBRA
WEEK 2.1 BOOLEAN ALGEBRA 1 Boolean Algebra Boolean algebra was introduced in 1854 by George Boole and in 1938 was shown by C. E. Shannon to be useful for manipulating Boolean logic functions. The postulates
More informationENG2410 Digital Design Combinational Logic Circuits
ENG240 Digital Design Combinational Logic Circuits Fall 207 S. Areibi School of Engineering University of Guelph Binary variables Binary Logic Can be 0 or (T or F, low or high) Variables named with single
More informationCombinational Logic Design Principles
Combinational Logic Design Principles Switching algebra Doru Todinca Department of Computers Politehnica University of Timisoara Outline Introduction Switching algebra Axioms of switching algebra Theorems
More informationBOOLEAN ALGEBRA TRUTH TABLE
BOOLEAN ALGEBRA TRUTH TABLE Truth table is a table which represents all the possible values of logical variables / statements along with all the possible results of the given combinations of values. Eg:
More informationContents. Chapter 2 Digital Circuits Page 1 of 30
Chapter 2 Digital Circuits Page 1 of 30 Contents Contents... 1 2 Digital Circuits... 2 2.1 Binary Numbers... 2 2.2 Binary Switch... 4 2.3 Basic Logic Operators and Logic Expressions... 5 2.4 Truth Tables...
More informationNumber System conversions
Number System conversions Number Systems The system used to count discrete units is called number system. There are four systems of arithmetic which are often used in digital electronics. Decimal Number
More informationChapter 2 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 informationCHAPTER1: Digital Logic Circuits Combination Circuits
CS224: Computer Organization S.KHABET CHAPTER1: Digital Logic Circuits Combination Circuits 1 PRIMITIVE LOGIC GATES Each of our basic operations can be implemented in hardware using a primitive logic gate.
More informationBinary Logic and Gates
1 COE 202- Digital Logic Binary Logic and Gates Dr. Abdulaziz Y. Barnawi COE Department KFUPM 2 Outline Introduction Boolean Algebra Elements of Boolean Algebra (Binary Logic) Logic Operations & Logic
More informationECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 2 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Week 2 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering Boolean Algebra Boolean Algebra A Boolean algebra is defined with: A set of
More informationE&CE 223 Digital Circuits & Systems. Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev. Section 2: Boolean Algebra & Logic Gates
Digital Circuits & Systems Lecture Transparencies (Boolean lgebra & Logic Gates) M. Sachdev 4 of 92 Section 2: Boolean lgebra & Logic Gates Major topics Boolean algebra NND & NOR gates Boolean algebra
More informationUNIVERSITI TENAGA NASIONAL. College of Information Technology
UNIVERSITI TENAGA NASIONAL College of Information Technology BACHELOR OF COMPUTER SCIENCE (HONS.) FINAL EXAMINATION SEMESTER 2 2012/2013 DIGITAL SYSTEMS DESIGN (CSNB163) January 2013 Time allowed: 3 hours
More informationECE380 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 informationComputer Organization I
Computer Organization I Lecture 6: Boolean Algebra /2/29 Wei Lu CS283 Overview Two Principles in Boolean Algebra () Duality Principle (2) Complement Principle Standard Form of Logic Expression () Sum of
More informationDigital Logic. Lecture 5 - Chapter 2. Outline. Other Logic Gates and their uses. Other Logic Operations. CS 2420 Husain Gholoom - lecturer Page 1
Lecture 5 - Chapter 2 Outline Other Logic Gates and their uses Other Logic Operations CS 2420 Husain Gholoom - lecturer Page 1 Digital logic gates CS 2420 Husain Gholoom - lecturer Page 2 Buffer A buffer
More informationDigital Logic Design. Combinational Logic
Digital Logic Design Combinational Logic Minterms A product term is a term where literals are ANDed. Example: x y, xz, xyz, A minterm is a product term in which all variables appear exactly once, in normal
More informationEECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits)
EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) September 5, 2002 John Wawrzynek Fall 2002 EECS150 Lec4-bool1 Page 1, 9/5 9am Outline Review of
More informationChap 2. Combinational Logic Circuits
Overview 2 Chap 2. Combinational Logic Circuits Spring 24 Part Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra Standard Forms Part 2 Circuit Optimization Two-Level Optimization
More informationOutline. EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) Combinational Logic (CL) Defined
EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) January 30, 2003 John Wawrzynek Outline Review of three representations for combinational logic:
More informationCombinational Logic. Review of Combinational Logic 1
Combinational Logic! Switches -> Boolean algebra! Representation of Boolean functions! Logic circuit elements - logic gates! Regular logic structures! Timing behavior of combinational logic! HDLs and combinational
More informationBinary Logic and Gates. Our objective is to learn how to design digital circuits.
Binary Logic and Gates Introduction Our objective is to learn how to design digital circuits. These circuits use binary systems. Signals in such binary systems may represent only one of 2 possible values
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. Overview Part 1 Gate
More informationGate-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 informationDigital 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 informationBoolean 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 informationBoolean Algebra and Logic Gates Chapter 2. Topics. Boolean Algebra 9/21/10. EECE 256 Dr. Sidney Fels Steven Oldridge
Boolean Algebra and Logic Gates Chapter 2 EECE 256 Dr. Sidney Fels Steven Oldridge Topics DefiniGons of Boolean Algebra Axioms and Theorems of Boolean Algebra two valued Boolean Algebra Boolean FuncGons
More informationFunctions. Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways:
Boolean Algebra (1) Functions Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways: An expression is finite but not unique f(x,y)
More informationECE 20B, Winter 2003 Introduction to Electrical Engineering, II LECTURE NOTES #2
ECE 20B, Winter 2003 Introduction to Electrical Engineering, II LECTURE NOTES #2 Instructor: Andrew B. Kahng (lecture) Email: abk@ucsd.edu Telephone: 858-822-4884 office, 858-353-0550 cell Office: 3802
More informationLecture 2 Review on Digital Logic (Part 1)
Lecture 2 Review on Digital Logic (Part 1) Xuan Silvia Zhang Washington University in St. Louis http://classes.engineering.wustl.edu/ese461/ Grading Engagement 5% Review Quiz 10% Homework 10% Labs 40%
More informationLogic Gate Level. Part 2
Logic Gate Level Part 2 Constructing Boolean expression from First method: write nonparenthesized OR of ANDs Each AND is a 1 in the result column of the truth table Works best for table with relatively
More information2009 Spring CS211 Digital Systems & Lab CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS
CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS What will we learn? 2 Logic functions and circuits Boolean Algebra Logic gates and Synthesis CAD tools and VHDL Read Section 2.9 and 2.0 Terminology 3 Digital
More informationDIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA
DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA 1 Learning Objectives Understand the basic operations and laws of Boolean algebra. Relate these operations and laws to circuits composed of AND gates, OR gates, INVERTERS
More informationUnit 2 Session - 6 Combinational Logic Circuits
Objectives Unit 2 Session - 6 Combinational Logic Circuits Draw 3- variable and 4- variable Karnaugh maps and use them to simplify Boolean expressions Understand don t Care Conditions Use the Product-of-Sums
More informationBoolean 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 informationDiscrete Mathematics. CS204: Spring, Jong C. Park Computer Science Department KAIST
Discrete Mathematics CS204: Spring, 2008 Jong C. Park Computer Science Department KAIST Today s Topics Combinatorial Circuits Properties of Combinatorial Circuits Boolean Algebras Boolean Functions and
More informationEx: Boolean expression for majority function F = A'BC + AB'C + ABC ' + ABC.
Boolean Expression Forms: Sum-of-products (SOP) Write an AND term for each input combination that produces a 1 output. Write the input variable if its value is 1; write its complement otherwise. OR the
More informationGray Code. ASCII Character Code. To convert the number from binary to Gray code the relations must be known. 1 1 = = = = 0
Gray Code To convert the number from binary to Gray code the relations must be known. = = = = Ex Convert the binary number ( ) into Gray Code? bit األول من جهة اليسار ومن ثم تطبق Gray لتحويل الرقم من صيغة
More informationLearning Objectives. Boolean Algebra. In this chapter you will learn about:
Ref. Page Slide /78 Learning Objectives In this chapter you will learn about: oolean algebra Fundamental concepts and basic laws of oolean algebra oolean function and minimization Logic gates Logic circuits
More informationCSE20: Discrete Mathematics for Computer Science. Lecture Unit 2: Boolan Functions, Logic Circuits, and Implication
CSE20: Discrete Mathematics for Computer Science Lecture Unit 2: Boolan Functions, Logic Circuits, and Implication Disjunctive normal form Example: Let f (x, y, z) =xy z. Write this function in DNF. Minterm
More informationLecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions
EE210: Switching Systems Lecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions Prof. YingLi Tian Feb. 15, 2018 Department of Electrical Engineering The City College of New York The
More informationEvery time has a value associated with it, not just some times. A variable can take on any value within a range
Digital Logic Circuits Binary Logic and Gates Logic Simulation Boolean Algebra NAND/NOR and XOR gates Decoder fundamentals Half Adder, Full Adder, Ripple Carry Adder Analog vs Digital Analog Continuous»
More informationCh 2. Combinational Logic. II - Combinational Logic Contemporary Logic Design 1
Ch 2. Combinational Logic II - Combinational Logic Contemporary Logic Design 1 Combinational logic Define The kind of digital system whose output behavior depends only on the current inputs memoryless:
More informationBOOLEAN LOGIC. By- Neha Tyagi PGT CS KV 5 Jaipur II Shift, Jaipur Region. Based on CBSE curriculum Class 11. Neha Tyagi, KV 5 Jaipur II Shift
BOOLEAN LOGIC Based on CBSE curriculum Class 11 By- Neha Tyagi PGT CS KV 5 Jaipur II Shift, Jaipur Region Neha Tyagi, KV 5 Jaipur II Shift Introduction Boolean Logic, also known as boolean algebra was
More informationLecture 6: Manipulation of Algebraic Functions, Boolean Algebra, Karnaugh Maps
EE210: Switching Systems Lecture 6: Manipulation of Algebraic Functions, Boolean Algebra, Karnaugh Maps Prof. YingLi Tian Feb. 21/26, 2019 Department of Electrical Engineering The City College of New York
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT2: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 2 Following the slides of Dr. Ahmed H. Madian ذو الحجة 438 ه Winter
More information1. Name the person who developed Boolean algebra
MATHEMATIC CENTER D96 MUNIRKA VILLAGE NEW DELHI 67 & VIKAS PURI NEW DELHI CONTACT FOR COACHING MATHEMATICS FOR TH 2TH NDA DIPLOMA SSC CAT SAT CPT CONTACT FOR ADMISSION GUIDANCE B.TECH BBA BCA, MCA MBA
More informationCombinational logic. Possible logic functions of two variables. Minimal set of functions. Cost of different logic functions.
Combinational logic Possible logic functions of two variables Logic functions, truth tables, and switches NOT, ND, OR, NND, NOR, OR,... Minimal set xioms and theorems of oolean algebra Proofs by re-writing
More informationCHAPTER 12 Boolean Algebra
318 Chapter 12 Boolean Algebra CHAPTER 12 Boolean Algebra SECTION 12.1 Boolean Functions 2. a) Since x 1 = x, the only solution is x = 0. b) Since 0 + 0 = 0 and 1 + 1 = 1, the only solution is x = 0. c)
More informationCircuits & Boolean algebra.
Circuits & Boolean algebra http://xkcd.com/730/ CSCI 255: Introduction to Embedded Systems Keith Vertanen Copyright 2011 Digital circuits Overview How a switch works Building basic gates from switches
More informationcontrol in out in out Figure 1. Binary switch: (a) opened or off; (b) closed or on.
Chapter 2 Digital Circuits Page 1 of 18 2. Digital Circuits Our world is an analog world. Measurements that we make of the physical objects around us are never in discrete units but rather in a continuous
More informationUnit 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 informationEECS Variable Logic Functions
EECS150 Section 1 Introduction to Combinational Logic Fall 2001 2-Variable Logic Functions There are 16 possible functions of 2 input variables: in general, there are 2**(2**n) functions of n inputs X
More informationBOOLEAN 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 informationCombinational Logic Fundamentals
Topic 3: Combinational Logic Fundamentals In this note we will study combinational logic, which is the part of digital logic that uses Boolean algebra. All the concepts presented in combinational logic
More information7.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 informationXOR - XNOR Gates. The graphic symbol and truth table of XOR gate is shown in the figure.
XOR - XNOR Gates Lesson Objectives: In addition to AND, OR, NOT, NAND and NOR gates, exclusive-or (XOR) and exclusive-nor (XNOR) gates are also used in the design of digital circuits. These have special
More informationAdministrative Notes. Chapter 2 <9>
Administrative Notes Note: New homework instructions starting with HW03 Homework is due at the beginning of class Homework must be organized, legible (messy is not), and stapled to be graded Chapter 2
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 3 Additional Gates and Circuits Overview Part 1 Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra
More informationCombinatorial Logic Design Principles
Combinatorial Logic Design Principles ECGR2181 Chapter 4 Notes Logic System Design I 4-1 Boolean algebra a.k.a. switching algebra deals with boolean values -- 0, 1 Positive-logic convention analog voltages
More informationEEE130 Digital Electronics I Lecture #4
EEE130 Digital Electronics I Lecture #4 - Boolean Algebra and Logic Simplification - By Dr. Shahrel A. Suandi Topics to be discussed 4-1 Boolean Operations and Expressions 4-2 Laws and Rules of Boolean
More informationSlide Set 3. for ENEL 353 Fall Steve Norman, PhD, PEng. Electrical & Computer Engineering Schulich School of Engineering University of Calgary
Slide Set 3 for ENEL 353 Fall 2016 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary Fall Term, 2016 SN s ENEL 353 Fall 2016 Slide Set 3 slide
More informationTotal Time = 90 Minutes, Total Marks = 50. Total /50 /10 /18
University of Waterloo Department of Electrical & Computer Engineering E&CE 223 Digital Circuits and Systems Midterm Examination Instructor: M. Sachdev October 23rd, 2007 Total Time = 90 Minutes, Total
More informationEECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive
EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive March 30, 2010 John Wawrzynek Spring 2010 EECS150 - Lec19-cl1 Page 1 Boolean Algebra I (Representations of Combinational
More informationThis form sometimes used in logic circuit, example:
Objectives: 1. Deriving of logical expression form truth tables. 2. Logical expression simplification methods: a. Algebraic manipulation. b. Karnaugh map (k-map). 1. Deriving of logical expression from
More information211: Computer Architecture Summer 2016
211: Computer Architecture Summer 2016 Liu Liu Topic: Storage Project3 Digital Logic - Storage: Recap - Review: cache hit rate - Project3 - Digital Logic: - truth table => SOP - simplification: Boolean
More informationUC 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 informationChapter 2. Digital Logic Basics
Chapter 2 Digital Logic Basics 1 2 Chapter 2 2 1 Implementation using NND gates: We can write the XOR logical expression B + B using double negation as B+ B = B+B = B B From this logical expression, we
More informationBinary logic consists of binary variables and logical operations. The variables are
1) Define binary logic? Binary logic consists of binary variables and logical operations. The variables are designated by the alphabets such as A, B, C, x, y, z, etc., with each variable having only two
More informationSignals and Systems Digital Logic System
Signals and Systems Digital Logic System Prof. Wonhee Kim Chapter 2 Design Process for Combinational Systems Step 1: Represent each of the inputs and outputs in binary Step 1.5: If necessary, break the
More informationBoolean Algebra and Logic Simplification
S302 Digital Logic Design Boolean Algebra and Logic Simplification Boolean Analysis of Logic ircuits, evaluating of Boolean expressions, representing the operation of Logic circuits and Boolean expressions
More informationChapter 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 informationBoolean Algebra. Examples: (B=set of all propositions, or, and, not, T, F) (B=2 A, U,, c, Φ,A)
Boolean Algebra Definition: A Boolean Algebra is a math construct (B,+,.,, 0,1) where B is a non-empty set, + and. are binary operations in B, is a unary operation in B, 0 and 1 are special elements of
More information