Fundamentals of Computer Systems
|
|
- Imogene Casey
- 5 years ago
- Views:
Transcription
1 Fundamentals of Computer Systems Boolean Logic Stephen A. Edwards Columbia University Summer 2015
2 Boolean Logic George Boole
3 Boole s Intuition Behind Boolean Logic Variables X,,... represent classes of things No imprecision: A thing either is or is not in a class If X is sheep and is white things, X are all white sheep, and X = X XX = X. If X is men and is women, X + is both men and women, X + = + X and X + X = X. If X is men, is women, and Z is European, Z(X + ) is European men and women and Z(X+) = ZX+Z.
4 The Axioms of (Any) Boolean Algebra A Boolean Algebra consists of A set of values A An and operator An or operator + A not operator X A false value 0 A A true value 1 A
5 The Axioms of (Any) Boolean Algebra A Boolean Algebra consists of A set of values A An and operator An or operator + A not operator X A false value 0 A A true value 1 A Axioms X + = + X X = X X + ( + Z) = (X + ) + Z X ( Z) = (X ) Z X + (X ) = X X (X + ) = X X ( + Z) = (X ) + (X Z) X + ( Z) = (X + ) (X + Z) X + X = 1 X X = 0
6 The Axioms of (Any) Boolean Algebra A Boolean Algebra consists of A set of values A An and operator An or operator + A not operator X A false value 0 A A true value 1 A Axioms X + = + X X = X X + ( + Z) = (X + ) + Z X ( Z) = (X ) Z X + (X ) = X X (X + ) = X X ( + Z) = (X ) + (X Z) X + ( Z) = (X + ) (X + Z) X + X = 1 X X = 0 We will use the first non-trivial Boolean Algebra: A = {0, 1}. This adds the law of excluded middle: if X 0 then X = 1 and if X 1 then X = 0.
7 Simplifying a Boolean Expression ou are a New orker if you were born in New ork or were not born in New ork and lived here ten years. Axioms X + (X ) X + = + X X = X X + ( + Z) = (X + ) + Z X ( Z) = (X ) Z X + (X ) = X X (X + ) = X X ( + Z) = (X ) + (X Z) X + ( Z) = (X + ) (X + Z) X + X = 1 X X = 0 Lemma: X 1 = X (X + X) = X (X + ) if = X = X
8 Simplifying a Boolean Expression ou are a New orker if you were born in New ork or were not born in New ork and lived here ten years. Axioms X + (X ) = (X + X) (X + ) X + = + X X = X X + ( + Z) = (X + ) + Z X ( Z) = (X ) Z X + (X ) = X X (X + ) = X X ( + Z) = (X ) + (X Z) X + ( Z) = (X + ) (X + Z) X + X = 1 X X = 0 Lemma: X 1 = X (X + X) = X (X + ) if = X = X
9 Simplifying a Boolean Expression ou are a New orker if you were born in New ork or were not born in New ork and lived here ten years. Axioms X + (X ) = (X + X) (X + ) = 1 (X + ) X + = + X X = X X + ( + Z) = (X + ) + Z X ( Z) = (X ) Z X + (X ) = X X (X + ) = X X ( + Z) = (X ) + (X Z) X + ( Z) = (X + ) (X + Z) X + X = 1 X X = 0 Lemma: X 1 = X (X + X) = X (X + ) if = X = X
10 Simplifying a Boolean Expression ou are a New orker if you were born in New ork or were not born in New ork and lived here ten years. Axioms X + (X ) = (X + X) (X + ) = 1 (X + ) = X + Lemma: X + = + X X = X X + ( + Z) = (X + ) + Z X ( Z) = (X ) Z X + (X ) = X X (X + ) = X X ( + Z) = (X ) + (X Z) X + ( Z) = (X + ) (X + Z) X + X = 1 X X = 0 X 1 = X (X + X) = X (X + ) if = X = X
11 More properties = = = = = 1 X + 0 = X X + 1 = 1 X + X = X X + X = X X + X = X = = = = = 1 X 0 = 0 X 1 = X X X = X X (X + ) = X X (X + ) = X
12 More Examples X + Z( + Z) = X + Z + ZZ = X + Z = (X + Z) X + (X + Z) + XZ = X + X + Z + XZ = X + Z + XZ = X + Z
13 More Examples XZ + X( + Z) = XZ + X + XZ Expand = X(Z + + Z) Factor w.r.t. X = X(Z + + Z + Z) Z Z + Z = X(Z + Z + + Z) Reorder = X ( (Z + Z) + + Z ) Factor w.r.t. = X( + + Z) + = 1 = X(1 + Z) 1 + Z = 1 = X X1 = X (X + + Z)(X + Z) = XX + XZ + X + Z + ZX + Z Z = X + XZ + X + Z + XZ = X + Z
14 Sum-of-products form Can always reduce a complex Boolean expression to a sum of product terms: X + X ( X + (Z + X) + Z ) = X + X(X + Z + X + Z) = X + XX + XZ + XX + X Z = X + XZ + X Z (can do better) = (X + XZ) + X Z = (X + Z) + X Z = X Z + X Z = + X Z
15 What Does This Have To Do With Logic Circuits? Claude Shannon
16 Shannon s MS Thesis We shall limit our treatment to circuits containing only relay contacts and switches, and therefore at any given time the circuit between any two terminals must be either open (infinite impedance) or closed (zero impedance).
17 Shannon s MS Thesis It is evident that with the above definitions the following postulates hold. 0 0 = 0 A closed circuit in parallel with a closed circuit is a closed circuit = 1 An open circuit in series with an open circuit is an open circuit = = 1 An open circuit in series with a closed circuit in either order is an open circuit. 0 1 = 1 0 = 0 A closed circuit in parallel with an open circuit in either order is an closed circuit = 0 A closed circuit in series with a closed circuit is a closed circuit. 1 1 = 1 An open circuit in parallel with an open circuit is an open circuit. At any give time either X = 0 or X = 1
18 Alternate Notations for Boolean Logic Operator Math Engineer Schematic Copy x X X or X X Complement x X X X AND x y X or X X X OR x y X + X X +
19 Definitions Literal: a Boolean variable or its complement E.g., X X Implicant: A product of literals E.g., X X XZ Minterm: An implicant with each variable once E.g., XZ XZ X Z Maxterm: A sum of literals with each variable once E.g., X + + Z X + + Z X + + Z
20 Be Careful with Bars X X
21 Be Careful with Bars X X Let s check all the combinations of X and : X X X X X
22 Truth Tables A truth table is a canonical representation of a Boolean function X Minterm Maxterm X X X X + X X X X X X X X X Each row has a unique minterm and maxterm The minterm is 1 maxterm is 0 for only its row
23 Sum-of-minterms and Product-of-maxterms Two mechanical ways to translate a function s truth table into an expression: X Minterm Maxterm F 0 0 X X X X X X X X + 0 The sum of the minterms where the function is 1: F = X + X The product of the maxterms where the function is 0: F = (X + )(X + )
24 Expressions to Schematics F = X + X X
25 Expressions to Schematics F = X + X X X
26 Expressions to Schematics F = X + X X X X
27 Expressions to Schematics F = X + X X X X X
28 Expressions to Schematics F = X + X X X X X + X = F X
29 Expressions to Schematics F = X + X = (X + )(X + ) X X X X + X = F X (X + )(X + ) = F
30 Minterms and Maxterms: Another Example The minterm and maxterm representation of functions may look very different: X Minterm Maxterm F 0 0 X X X X X X X X + 1 The sum of the minterms where the function is 1: F = X + X + X The product of the maxterms where the function is 0: F = X +
31 Expressions to Schematics 2 F = X + X + X = X + X X + X + X = F X + = F
32 The Menagerie of Gates
33 The Menagerie of Gates Buffer Inverter AND NAND OR NOR XOR XNOR
34 De Morgan s Theorem X + = X X = X + Proof by Truth Table: X X + X X X
35 De Morgan s Theorem in Gates AB = A + B = A + B = A B =
36 Bubble Pushing A B C D F Apply De Morgan s Theorem: Transform NAND into OR with inverted inputs
37 Bubble Pushing A B C D F Apply De Morgan s Theorem: Transform NAND into OR with inverted inputs Two bubbles on a wire cancel
38 Bubble Pushing A B C D F Apply De Morgan s Theorem: Transform NAND into OR with inverted inputs Two bubbles on a wire cancel
39 PONG PONG, Atari 1973 Built from TTL logic gates; no computer, no software Launched the video arcade game revolution
40 Horizontal Ball Control in PONG M L R A B X X X X X X X X The ball moves either left or right. Part of the control circuit has three inputs: M ( move ), L ( left ), and R ( right ). It produces two outputs A and B. Here, X means I don t care what the output is; I never expect this input combination to occur.
41 Horizontal Ball Control in PONG M L R A B E.g., assume all the X s are 0 s and use Minterms: A = MLR + MLR B = M LR + M LR + MLR 3 inv + 4 AND3 + 1 OR2 + 1 OR3
42 Horizontal Ball Control in PONG M L R A B Assume all the X s are 1 s and use Maxterms: A = (M + L + R)(M + L + R) B = M + L + R 3 inv + 3 OR3 + 1 AND2
43 Horizontal Ball Control in PONG M L R A B Choosing better values for the X s and being much more clever: A = M B = MR 1 NAND2 (!)
44 Karnaugh Maps Basic trick: put similar variable values near each other so simple functions are obvious M L R A B X X X X X X X X The M s are already arranged nicely
45 Karnaugh Maps Basic trick: put similar variable values near each other so simple functions are obvious M L R A B X X Let s rearrange the L s by permuting two pairs of rows X X X X X X
46 Karnaugh Maps Basic trick: put similar variable values near each other so simple functions are obvious M L R A B X X X X X X Let s rearrange the L s by permuting two pairs of rows X X
47 Karnaugh Maps Basic trick: put similar variable values near each other so simple functions are obvious M L R A B X X X X Let s rearrange the L s by permuting two pairs of rows X X X X
48 Karnaugh Maps Basic trick: put similar variable values near each other so simple functions are obvious M L R A B X X X X Let s rearrange the L s by permuting two pairs of rows X X X X
49 Karnaugh Maps Basic trick: put similar variable values near each other so simple functions are obvious M L R A B X X X X Let s rearrange the L s by permuting two pairs of rows X X X X
50 Karnaugh Maps Basic trick: put similar variable values near each other so simple functions are obvious M L R A B X X X X Let s rearrange the L s by permuting two pairs of rows X X X X
51 Karnaugh Maps Basic trick: put similar variable values near each other so simple functions are obvious M L R A B X X X X X X X X Let s rearrange the L s by permuting two pairs of rows
52 Karnaugh Maps Basic trick: put similar variable values near each other so simple functions are obvious M L R A B X X X X X X X X Let s rearrange the L s by permuting two pairs of rows
53 Karnaugh Maps Basic trick: put similar variable values near each other so simple functions are obvious M L R A B X X X X X X X X The R s are really crazy; let s use the second dimension
54 Karnaugh Maps Basic trick: put similar variable values near each other so simple functions are obvious M L R A B X X X X X X X X The R s are really crazy; let s use the second dimension
55 Karnaugh Maps Basic trick: put similar variable values near each other so simple functions are obvious M L R A B X0 X X 1X The R s are really crazy; let s use the second dimension X 1X X1 X0
56 Karnaugh Maps Basic trick: put similar variable values near each other so simple functions are obvious M L R A B X0 X X 1X MR X 1X X1 X0 M
57 Maurice Karnaugh s Maps Transactions of the AIEE, 1953
58 Karnaugh maps (a.k.a., K-maps) All functions can be expressed with a map. There is one square for each minterm in a function s truth table X minterm 0 0 X m0 0 1 X m1 1 0 X m2 1 1 X m3 X m0 m1 1 m2 m3
59 Karnaugh maps (a.k.a., K-maps) All functions can be expressed with a map. There is one square for each minterm in a function s truth table X minterm 0 0 X m0 0 1 X m1 1 0 X m2 1 1 X m3 X m0 m1 X 1 m2 m3 X
60 Karnaugh maps (a.k.a., K-maps) All functions can be expressed with a map. There is one square for each minterm in a function s truth table X minterm 0 0 X m0 0 1 X m1 1 0 X m2 1 1 X m3 X m0 m1 1 m2 m3
61 Karnaugh maps (a.k.a., K-maps) Cont. 1 Fill out the table with the values of some function. X F X
62 Karnaugh maps (a.k.a., K-maps) Cont. 2 When two cells share an edge and both are 1, those two terms can be combined to form a single, simpler term. X F = X + X + X
63 Karnaugh maps (a.k.a., K-maps) Cont. 2 When two cells share an edge and both are 1, those two terms can be combined to form a single, simpler term. X F = X + X + X X F = X + X X F = + X
64 Karnaugh maps (a.k.a., K-maps) Cont. 2 When two cells share an edge and both are 1, those two terms can be combined to form a single, simpler term. X F = X + X + X X F = X + X X X F = X F = + X
65 Karnaugh maps (a.k.a., K-maps) Summary So Far Circle contiguous groups of 1s (circle sizes must be a power of 2) There is a correspondence between circles on a k-map and terms in a function expression The bigger the circle, the simpler the term Add circles (and terms) until all 1s on the k-map are circled Prime implicant: circles that can be no bigger (smallest product term) Essential prime implicant: circles that uniquely covers a 1 is essential X F = X +
66 3-Variable Karnaugh Maps Use gray ordering on edges with multiple variables Gray encoding: order of values such that only one bit changes at a time Two minterms are considered adjacent if they differ in only one variable (this means maps wrap ) Z X m0 m1 m3 m2 1 m4 m5 m7 m6
67 3-Variable Karnaugh Maps Use gray ordering on edges with multiple variables Gray encoding: order of values such that only one bit changes at a time Two minterms are considered adjacent if they differ in only one variable (this means maps wrap ) Z X m0 m1 m3 m2 m4 m5 m7 m6 X Z X Z m0 m1 m3 m2 m4 m5 m7 m6
68 4-Variable Karnaugh Maps An extension of 3-variable maps. C D A B B A D C B D C A
69 The Seven-Segment Decoder Example a W X Z a b c d e f g X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X e f d g c b
70 Karnaugh Map for Seg. a W X Z a X X X X X X Z X X 0 X 1 1 X X W The Karnaugh Map Sum-of-Products Challenge Cover all the 1 s and none of the 0 s using as few literals (gate inputs) as possible. Few, large rectangles are good. Covering X s is optional.
71 Karnaugh Map for Seg. a W X Z a X X X X X X Z X X 0 X 1 1 X X W The minterm solution: cover each 1 with a single implicant. a = W X Z + W X Z + W X Z + W X Z + W X Z + W X Z + W X Z + W X Z 8 4 = 32 literals 4 inv + 8 AND4 + 1 OR8
72 Karnaugh Map for Seg. a W X Z a X X X X X X Z X X 0 X 1 1 X X Merging implicants helps Recall the distributive law: AB + AC = A(B + C) W a = W X Z + W + W X Z + W X = 12 literals 4 inv + 1 AND4 + 2 AND3 + 1 AND2 + 1 OR4
73 Karnaugh Map for Seg. a W X Z a X X X X X X Z X X 0 X 1 1 X X W Missed one: Remember this is actually a torus. a = X Z + W + W X Z + W X = 11 literals 4 inv + 3 AND3 + 1 AND2 + 1 OR4
74 Karnaugh Map for Seg. a W X Z a X X X X X X Z X X 0 X 1 1 X X W Taking don t-cares into account, we can enlarge two implicants: a = X Z + W + W X Z + W X = 9 literals 3 inv + 1 AND3 + 3 AND2 + 1 OR4
75 Karnaugh Map for Seg. a W X Z a X X X X X X Z X X 0 X 1 1 X X W Can also compute the complement of the function and invert the result. Covering the 0 s instead of the 1 s: a = W X Z + X Z + W = 9 literals 5 inv + 1 AND4 + 1 AND3 + 1 AND2 + 1 OR3
76 Karnaugh Map for Seg. a W X Z a X X X X X X Z X X 0 X 1 1 X X W To display the score, PONG used a TTL chip with this solution in it: (13) (12) OUTPUT a OUTPUT b
77 Boolean Laws and Karnaugh Maps W X Z W X Z + W X Z+ W X Z + W X Z+ W X Z + W X Z+ W X Z + W X Z Factor out the W s
78 Boolean Laws and Karnaugh Maps W X Z (W + W) X Z+ (W + W) X Z+ (W + W) X Z+ (W + W) X Z Use the identities W + W = 1 and 1 X = X.
79 Boolean Laws and Karnaugh Maps W X Z X Z+ X Z+ X Z+ X Z Factor out the s
80 Boolean Laws and Karnaugh Maps W Z ( + ) X Z+ ( + ) X Z Apply the identities again X
81 Boolean Laws and Karnaugh Maps W Z X Z+ X Z Factor out Z X
82 Boolean Laws and Karnaugh Maps W Z X (Z + Z) Simplify X
83 Boolean Laws and Karnaugh Maps W Z X Done X
Fundamentals of Computer Systems
Fundamentals of Computer Systems Boolean Logic Stephen A. Edwards Columbia University Summer 2017 Boolean Logic George Boole 1815 1864 Boole s Intuition Behind Boolean Logic Variables,,... represent classes
More informationFundamentals of Computer Systems
Fundamentals of Computer Systems Boolean Logic Stephen A. Edwards Columbia University Fall 2011 Boolean Logic George Boole 1815 1864 Boole s Intuition Behind Boolean Logic Variables x, y,... represent
More informationUnderstand Video Games; Understand Everything
Understand Video Games; Understand Everything Stephen A. Edwards Columbia University The Subject of this Lecture 0 The Subjects of this Lecture 0 1 But let your communication be, Yea, yea; Nay, nay: for
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 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 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 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 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 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 informationDigital Logic (2) Boolean Algebra
Digital Logic (2) Boolean Algebra Boolean algebra is the mathematics of digital systems. It was developed in 1850 s by George Boole. We will use Boolean algebra to minimize logic expressions. Karnaugh
More 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 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 informationLogic Design Combinational Circuits. Digital Computer Design
Logic Design Combinational Circuits Digital Computer Design Topics Combinational Logic Karnaugh Maps Combinational uilding locks Timing 2 Logic Circuit logic circuit is composed of: Inputs Outputs Functional
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 informationFundamentals of Computer Systems
Fundamentals of Computer Systems Review for the Final Stephen A. Edwards Columbia University Summer 25 The Final 2 hours 8 problems Closed book Simple calculators are OK, but unnecessary One double-sided
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 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 informationWorking with Combinational Logic. Design example: 2x2-bit multiplier
Working with ombinational Logic Simplification two-level simplification exploiting don t cares algorithm for simplification Logic realization two-level logic and canonical forms realized with NNs and NORs
More informationCS 226: Digital Logic Design
CS 226: Digital Logic Design 0 1 1 I S 0 1 0 S Department of Computer Science and Engineering, Indian Institute of Technology Bombay. 1 of 29 Objectives In this lecture we will introduce: 1. Logic functions
More 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 informationEECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive
EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive March 30, 2010 John Wawrzynek Spring 2010 EECS150 - Lec19-cl1 Page 1 Boolean Algebra I (Representations of Combinational
More informationChapter 2: Boolean Algebra and Logic Gates
Chapter 2: Boolean Algebra and Logic Gates 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 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 informationLOGIC GATES. Basic Experiment and Design of Electronics. Ho Kyung Kim, Ph.D.
Basic Eperiment and Design of Electronics LOGIC GATES Ho Kyung Kim, Ph.D. hokyung@pusan.ac.kr School of Mechanical Engineering Pusan National University Outline Boolean algebra Logic gates Karnaugh maps
More informationWEEK 3.1 MORE ON KARNAUGH MAPS
WEEK 3. MORE ON KARNAUGH MAPS Don t Cares Sometimes, we might have inputs and it doesn t matter what the output is; i.e., we don t care what the output is. These situations are called don t cares. Rather
More informationPart 1: Digital Logic and Gates. Analog vs. Digital waveforms. The digital advantage. In real life...
Part 1: Digital Logic and Gates Analog vs Digital waveforms An analog signal assumes a continuous range of values: v(t) ANALOG A digital signal assumes discrete (isolated, separate) values Usually there
More informationFundamentals of Computer Systems
Fundamentals of Computer Systems Review for the Midterm Stephen A. Edwards Columbia University Spring 22 The Midterm 75 minutes 4 5 problems Closed book Simple calculators are OK, but unnecessary One double-sided
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 informationCS 121 Digital Logic Design. Chapter 2. Teacher Assistant. Hanin Abdulrahman
CS 121 Digital Logic Design Chapter 2 Teacher Assistant Hanin Abdulrahman 1 2 Outline 2.2 Basic Definitions 2.3 Axiomatic Definition of Boolean Algebra. 2.4 Basic Theorems and Properties 2.5 Boolean Functions
More 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 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 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 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 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 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 informationMODULAR CIRCUITS CHAPTER 7
CHAPTER 7 MODULAR CIRCUITS A modular circuit is a digital circuit that performs a specific function or has certain usage. The modular circuits to be introduced in this chapter are decoders, encoders, multiplexers,
More informationDigital Logic & Computer Design CS Professor Dan Moldovan Spring Copyright 2007 Elsevier 2-<101>
Digital Logic & Computer Design CS 434 Professor Dan Moldovan Spring 2 Copyright 27 Elsevier 2- Chapter 2 :: Combinational Logic Design Digital Design and Computer Architecture David Money Harris and
More information14:332:231 DIGITAL LOGIC DESIGN. Combinational Circuit Synthesis
:: DIGITAL LOGIC DESIGN Ivan Marsic, Rutgers University Electrical & Computer Engineering all Lecture #: Combinational Circuit Synthesis I Combinational Circuit Synthesis Recall: Combinational circuit
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 informationReview. EECS Components and Design Techniques for Digital Systems. Lec 06 Minimizing Boolean Logic 9/ Review: Canonical Forms
Review EECS 150 - Components and Design Techniques for Digital Systems Lec 06 Minimizing Boolean Logic 9/16-04 David Culler Electrical Engineering and Computer Sciences University of California, Berkeley
More 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 informationContents. Chapter 3 Combinational Circuits Page 1 of 36
Chapter 3 Combinational Circuits Page of 36 Contents Combinational Circuits...2 3. Analysis of Combinational Circuits...3 3.. Using a Truth Table...3 3..2 Using a Boolean Function...6 3.2 Synthesis of
More 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 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 informationDigital Logic & Computer Design CS Professor Dan Moldovan Spring 2010
Digital Logic & Computer Design CS 434 Professor Dan Moldovan Spring 2 Copyright 27 Elsevier 2- Chapter 2 :: Combinational Logic Design Digital Design and Computer rchitecture David Money Harris and
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 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 informationKarnaugh Maps Objectives
Karnaugh Maps Objectives For Karnaugh Maps of up to 5 variables Plot a function from algebraic, minterm or maxterm form Obtain minimum Sum of Products and Product of Sums Understand the relationship between
More informationChapter 7 Logic Circuits
Chapter 7 Logic Circuits Goal. Advantages of digital technology compared to analog technology. 2. Terminology of Digital Circuits. 3. Convert Numbers between Decimal, Binary and Other forms. 5. Binary
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 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 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 informationBoolean Algebra and Digital Logic
All modern digital computers are dependent on circuits that implement Boolean functions. We shall discuss two classes of such circuits: Combinational and Sequential. The difference between the two types
More informationSimplifying Logic Circuits with Karnaugh Maps
Simplifying Logic Circuits with Karnaugh Maps The circuit at the top right is the logic equivalent of the Boolean expression: f = abc + abc + abc Now, as we have seen, this expression can be simplified
More informationLecture 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 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 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 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 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 information4 Switching Algebra 4.1 Axioms; Signals and Switching Algebra
4 Switching Algebra 4.1 Axioms; Signals and Switching Algebra To design a digital circuit that will perform a required function, it is necessary to manipulate and combine the various input signals in certain
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 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 informationCS61c: Representations of Combinational Logic Circuits
CS61c: Representations of Combinational Logic Circuits J. Wawrzynek March 5, 2003 1 Introduction Recall that synchronous systems are composed of two basic types of circuits, combination logic circuits,
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 informationBoolean Algebra and logic gates
Boolean Algebra and logic gates Luis Entrena, Celia López, Mario García, Enrique San Millán Universidad Carlos III de Madrid 1 Outline l Postulates and fundamental properties of Boolean Algebra l Boolean
More informationSwitches: basic element of physical implementations
Combinational logic Switches Basic logic and truth tables Logic functions Boolean algebra Proofs by re-writing and by perfect induction Winter 200 CSE370 - II - Boolean Algebra Switches: basic element
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 informationSimplification of Boolean Functions. Dept. of CSE, IEM, Kolkata
Simplification of Boolean Functions Dept. of CSE, IEM, Kolkata 1 Simplification of Boolean Functions: An implementation of a Boolean Function requires the use of logic gates. A smaller number of gates,
More 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 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 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 informationComputer Organization: Boolean Logic
Computer Organization: Boolean Logic Representing and Manipulating Data Last Unit How to represent data as a sequence of bits How to interpret bit representations Use of levels of abstraction in representing
More informationStandard Expression Forms
ThisLecture will cover the following points: Canonical and Standard Forms MinTerms and MaxTerms Digital Logic Families 24 March 2010 Standard Expression Forms Two standard (canonical) expression forms
More informationProve that if not fat and not triangle necessarily means not green then green must be fat or triangle (or both).
hapter : oolean lgebra.) Definition of oolean lgebra The oolean algebra is named after George ool who developed this algebra (854) in order to analyze logical problems. n example to such problem is: Prove
More informationKarnaugh Maps (K-Maps)
Karnaugh Maps (K-Maps) Boolean expressions can be minimized by combining terms P + P = P K-maps minimize equations graphically Put terms to combine close to one another B C C B B C BC BC BC BC BC BC BC
More informationGates and Logic: From Transistors to Logic Gates and Logic Circuits
Gates and Logic: From Transistors to Logic Gates and Logic Circuits Prof. Hakim Weatherspoon CS 3410 Computer Science Cornell University The slides are the product of many rounds of teaching CS 3410 by
More informationL4: Karnaugh diagrams, two-, and multi-level minimization. Elena Dubrova KTH / ICT / ES
L4: Karnaugh diagrams, two-, and multi-level minimization Elena Dubrova KTH / ICT / ES dubrova@kth.se Combinatorial system a(t) not(a(t)) A combinatorial system has no memory - its output depends therefore
More informationSchool of Computer Science and Electrical Engineering 28/05/01. Digital Circuits. Lecture 14. ENG1030 Electrical Physics and Electronics
Digital Circuits 1 Why are we studying digital So that one day you can design something which is better than the... circuits? 2 Why are we studying digital or something better than the... circuits? 3 Why
More informationCHAPTER III BOOLEAN ALGEBRA
CHAPTER III- CHAPTER III CHAPTER III R.M. Dansereau; v.. CHAPTER III-2 BOOLEAN VALUES INTRODUCTION BOOLEAN VALUES Boolean algebra is a form of algebra that deals with single digit binary values and variables.
More informationChapter 2 Combinational logic
Chapter 2 Combinational logic Chapter 2 is very easy. I presume you already took discrete mathemtics. The major part of chapter 2 is boolean algebra. II - Combinational Logic Copyright 24, Gaetano Borriello
More 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 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 informationSolutions 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 informationPossible logic functions of two variables
ombinational logic asic logic oolean algebra, proofs by re-writing, proofs by perfect induction logic functions, truth tables, and switches NOT, ND, OR, NND, NOR, OR,..., minimal set Logic realization
More informationMinimization techniques
Pune Vidyarthi Griha s COLLEGE OF ENGINEERING, NSIK - 4 Minimization techniques By Prof. nand N. Gharu ssistant Professor Computer Department Combinational Logic Circuits Introduction Standard representation
More informationReview for Test 1 : Ch1 5
Review for Test 1 : Ch1 5 October 5, 2006 Typeset by FoilTEX Positional Numbers 527.46 10 = (5 10 2 )+(2 10 1 )+(7 10 0 )+(4 10 1 )+(6 10 2 ) 527.46 8 = (5 8 2 ) + (2 8 1 ) + (7 8 0 ) + (4 8 1 ) + (6 8
More informationChapter 1: Logic systems
Chapter 1: Logic systems 1: Logic gates Learning Objectives: At the end of this topic you should be able to: identify the symbols and truth tables for the following logic gates: NOT AND NAND OR NOR XOR
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 informationLogic Simplification. Boolean Simplification Example. Applying Boolean Identities F = A B C + A B C + A BC + ABC. Karnaugh Maps 2/10/2009 COMP370 1
Digital Logic COMP370 Introduction to Computer Architecture Logic Simplification It is frequently possible to simplify a logical expression. This makes it easier to understand and requires fewer gates
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 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 informationOutcomes. Spiral 1 / Unit 5. Logic Function Synthesis KARNAUGH MAPS. Karnaugh Maps
-. -. Spiral / Unit Mark Redekopp Outcomes I know the difference between combinational and sequential logic and can name examples of each. I understand latency, throughput, and at least technique to improve
More informationSpiral 1 / Unit 5. Karnaugh Maps
-. Spiral / Unit Karnaugh Maps -. Outcomes I know the difference between combinational and sequential logic and can name examples of each. I understand latency, throughput, and at least technique to improve
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 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 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 informationThe Karnaugh Map COE 202. Digital Logic Design. Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals
The Karnaugh Map COE 202 Digital Logic Design Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals Presentation Outline Boolean Function Minimization The Karnaugh Map (K-Map) Two, Three,
More 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 informationCPE100: Digital Logic Design I
Chapter 2 Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu http://www.ee.unlv.edu/~b1morris/cpe100/ CPE100: Digital Logic Design I Section 1004: Dr. Morris Combinational Logic Design Chapter
More informationLecture A: Logic Design and Gates
Lecture A: Logic Design and Gates Syllabus My office hours 9.15-10.35am T,Th or gchoi@ece.tamu.edu 333G WERC Text: Brown and Vranesic Fundamentals of Digital Logic,» Buy it.. Or borrow it» Other book:
More information