Binary logic. Dr.Abu-Arqoub
|
|
|
- Silas Woods
- 3 years ago
- Views:
Transcription
1 Binary logic Binary logic deals with variables like (a, b, c,, x, y) that take on two discrete values (, ) and with operations that assume logic meaning ( AND, OR, NOT) Truth table is a table of all possible combinations of the variables showing the relation between the values that the variables may take and the result of operation. Ex. AND (. ) z= x. y z= x and y z=xy z=x and y
2 AND GATE x y Z=x.y off on X Y ~` 2
3 OR GATE OR (+) X Y Z=X+Y Z=X+Y Z= x or y 3
4 OR GATE X ~` Y 4
5 NOT GATE NOT (Bar), (Prime) Z = X, Z = X NOT X, X Bar, X Prime X Z=X 5
6 NOT GATE ` ~ X 6
7 Boolean algebra and logic gates Boolean algebra is an algebraic structure defined on a set of elements B together with two binary operators +(OR) and.(and) providing the following postulates:. closed with (مغلقة) respect to operator +(OR) a + b=c a, b, c Є B and closer with respect to operator.(and) a. b=c a, b, c Є B 2. An identity (محايد) element with respect to +(OR) by and an identity element with respect to.(and) by x+=+x=x x. =. x=x 3. (تبديلي) Commutative with respect to +: x +y=y + x Commutative with respect to. : x. y=y. x (توزيعي) 4. Distributive. (AND) is distributive over +(OR): x (y + z)=x. y + x. z +(OR) is distributive over.(and): x +(y. z)=(x + y). (x + z) 7
8 Boolean algebra and logic gates 5. For every element x Є B, there exist an element x Є B called the complement of x such that : x+x = and x.x = 6. There exist at least two elements x, y Є B such that x y 8
9 Boolean algebra and logic gates Example : a two valued Boolean algebra is defined on a set of two elements B={,}, with rules for the two binary operators (+) & (.) such. Closed results or and (,) Є B 2. It has the two identity elements for (+) and for (.) 3 commutative since x+y=y+x & x.y=y.x next slide 5. For each x there is x : x+x = += += 6. Two elements (,) with x y x.y x+y x x+x x.x 9
10 Boolean algebra and logic gates 4. Distributive since x.(y+z)=x.y+x.z xy+xz x.(y+z) Y+z x.z x.y z y x
11 Basic theorems and properties of Boolean algebra Duality :(ازدواجية) in duality leave the element (variables) of the set of B the same, then change the (+) by (.) operators, the (.) by (+) & replace the s by zeros, and zeros by ones. Ex x+=x by duality x.=x
12 Postulates & Theorems of Boolean Algebra. X + = X Dual X. = X 2. X + X = X. X = 3. X + X = X X. X = X 4. X + = X. = 5. (X ) = X 6. X + Y = Y + X X. Y = Y. X 7. X + ( Y + Z ) = ( X + Y ) + Z X. ( Y. Z ) = ( X. Y ). Z 2
13 Postulates & Theorems of Boolean Algebra 8. X. ( Y + Z ) = X. Y + X. Z X + ( Y. Z ) = X + Y. X + Z 9. ( X + Y ) = X. Y (De Morgan Theorem) ( X. Y ) = X + Y. X + XY = X X. ( X + Y ) = X X. ( X + Y ) = X. X + X. Y = X + XY = X ( + Y ) = X. = X 3
14 Postulates & Theorems of Boolean Algebra 4
15 Boolean Functions A Boolean function is an expression formed with binary variables, the two binary operators OR & AND, the unary operator NOT, parentheses, and equal sign. A Boolean function may be represented in a truth table. 5
16 Boolean Functions Ex: Suppose we have three Boolean functions: F, F 2, and F 3. F = F 2 & F F 3 X Y F (X, Y) F 2 (X, Y) F 3 (X, Y) 6
17 Boolean Functions Two functions of n variables are said to be equal if they have the same value for all possible 2 n combinations of n variables. The complement of a function F is F and it s obtained from an interchange of s for s and s for s in the value of F. 7
18 Boolean Functions Ex: Note: (F ) (F 2 ),(F dual F2) but (F) =(F3) F 3 (X, Y, Z) = X + Y + Z F 2 (X, Y, Z) = X + Y + Z F (X, Y, Z) = X. Y. Z Z Y X 8
19 Examples on functions Draw a logic circuit that represents the following function: F=x+y z 9
20 Examples on functions Draw a logic circuit that represents the following function: F=xy +x z 2
21 Examples on functions Draw a logic circuit that represents the following functions: 2
22 Simplification of Boolean Functions Simplify the following Boolean functions:. x(x +y) 2. x+x y 3. (x+y).(x+y ) 4. xy+x z+yz 22
23 Simplification of Boolean Functions Simplify the following Boolean functions: F=x y z+x yz+xy =x z(y +y)+xy =x z.+xy = x z+xy 23
24 Complement of a Boolean function To find the complement of any Boolean function we can use:. Direct method (using Demorgan law) 2. Dual of the function and complement of each literal. 3. min-max terms 24
25 Complement a function using Demorgan law In this method. the relation between elements changed from AND to OR and vice versa 2. each element individually inversed Examples: find the complement of the following functions:. F=x yz +x y z F 25
26 Examples 2. F 3. F2=x.(y z+yz ) F2 =x +(y z+yz ) =x +(y z).(yz ) =x +(y+z ).(y +z) 26
27 Complement a function using Duality In this method :. take the dual of the function 2. take the complement of each literal Example: F=x.(y z+yz ) find F. dual x+(y +z).(y+z ) 2. complement of each litiral x +(y+z ).(y +z) 27
28 Example Given F (X, Y, Z) = XY Z + XYZ, Find F using:.de Morgan s theorem 2.Dual & then complement the variables. 28 Continue
29 Example. Using De Morgan s theorem F (X, Y, Z) = (XY Z + XYZ ) = (X + Y + Z ). (X + Y + Z) 2. Using dual & then complement the variables Duality of F (X + Y + Z). (X + Y + Z ) Then complement the variables F (X, Y, Z) = (X + Y + Z ). (X + Y + Z) 29
30 Digital logic gates 3
31 Digital logic gates 3
32 NAND (NOT AND) Gate F (X, Y, Z) F (X, Y, Z) We can describe it using the NAND gate as follows: 32 Continue
33 NAND Gate 33 Continue
34 NOR (NOT OR) Gate F 2 (X, Y, Z) F 2 (X, Y, Z) We can describe it using the NOR gate as follows: 34 Continue
35 NOR Gate Note: A simple way for deriving the complement of a function is to take the dual & complement each literal. 35
36 Boolean Functions (Min-terms) Any Boolean function can be expressed as a sum of min-terms ( sum : ORing of terms) and the function will be in sum of Product (SOP). n variables forming an AND term with each variable being primed (if equal to ) or unprimed (if equal to ) providing 2 n possible combinations called min-term (m j ) or Standard of Product. 36
37 Boolean Functions (Min-terms) Ex: X Y m j F(X, Y) = m + m2 m m m 2 m 3 m = X. Y m 2 = X. Y m = X. Y m 3 = X. Y F(X, Y) = m + m 2 = X Y + XY = (, 2) (SOP) (Canonical form) 37
38 Boolean Functions (Min-terms) Ex: X Y Z m j F(X, Y, Z) m m m 2 m 3 m 4 m 5 m 6 m 7 38
39 Boolean Functions (Min-terms) m = X. Y. Z m = X. Y. Z m 2 = X. Y. Z m 3 = X. Y. Z m 4 = X. Y. Z m 5 = X. Y. Z m 6 = X. Y. Z m 7 = X. Y. Z F(X, Y, Z) = m + m 3 + m 5 + m 6 + m 7 = (, 3, 5, 6, 7) 39
40 Boolean Functions (Max-terms) A Boolean function can be expressed as the product of max-terms ( Product = ANDing of the terms) and the function would be then in the product of Sum (POS). n variables forming an OR term with each variable being primed (if equal to ) or unprimed (if equal to ) providing 2 n possible combinations called max-term (M j ) or Standard Sum. 4
41 Boolean Functions (Max-terms) Ex: X Y M j F ( X, Y ) M M M 2 M 3 M = X + Y M 2 = X + Y M = X + Y M 3 = X + Y F(X, Y) = M. M 3 = (X + Y). (X + Y ) = (,3) (POS) 4
42 Boolean Functions (Max-terms) Note that (,2) is a complement of (,2) (m j ) = M j ( M j) = m j (m ) = M (X + Y) = X. Y If given F(x,Y)= m + m2 = X Y + XY = (, 2) = M. M3 = (X + Y). (X + Y )= (,3) then F (x,y)=m+m3=x y +xy= (, 3) =M.M2=(x+y )(X +y)= (,2) 42
43 Conversion between canonical forms m M F 3,5,6,7,,2,4 F,,2,4 3,5,6,7 43
44 Boolean Functions (Max-terms) Ex: X Y Z M j F (X, Y, Z) M M M 2 M 3 M 4 M 5 M 6 M 7 44
45 Boolean Functions (Max-terms) M = X + Y + Z M = X + Y + Z M 2 = X + Y + Z M 3 = X + Y + Z M 4 = X + Y + Z M 5 = X + Y + Z M 6 = X + Y + Z M 7 = X + Y + Z F (X, Y, Z) = M. M 2. M 4 F (X, Y, Z) = (,2,4) 45
46 Boolean Functions To convert from one Canonical form to another, interchange the symbols with and list those numbers missing from the original form. The total number of min-terms or max-terms is 2 n where n is the number of binary variables in the function. Ex: Given F(X, Y) = (, 3), Find F(X, Y) = (?) F(X, Y) = (, 2) (POS) 46
47 Boolean Functions Ex: Given F(X, Y, Z) = (, 3, 7), Find F(X, Y, Z) = (?) F(X, Y, Z) = (, 2, 4, 5, 6) (SOP) 47
48 Boolean Functions If the Boolean function is not in SOP, it can be made so by first expanding the expression into a sum of AND terms, then if any term missing one or more variables it s ANDed with an expression such as (X + X ) ( X is one of the missing variables). Ex: F(A, B, C) = B + A C, Find the SOP form of F(A, B, C) 48
49 Boolean Functions F(A, B, C) = B (A + A ) (C + C ) + A C (B + B ) = (BA + BA ) (C + C ) + A BC + A B C = ABC + ABC + A BC + A BC + A BC + A B C = m 7 + m 6 + m 3 + m 2 + m 3 + m = (, 2, 3, 6, 7) (SOP) F(A, B, C) = (, 4, 5) (POS) = (A + B + C ). (A + B + C ). (A + B + C ) 49
50 Boolean Functions If the Boolean function is not in POS, it can be made so by first expanding the expression into a product of OR terms (using the distributive rule), then if any term missing one or more variables it s ORed with an expression such as (X X ) ( X is one of the missing variables). Ex: F(A, B, C) = B + A C, Find the POS form of F(A, B, C) 5
51 F(A,B,C)=B+A C =(B+A )(B+C) =(B+A +CC )(B+C+AA ) =(B+A +C)(B+A +C )(B+C+A) (B+C+A ) =(A +B+C)(A +B+C )(A+B+C) =M4.M5.M =M.M4.M5 = (,4,5) 5
52 Boolean Functions Ex: X Y F (X, Y). Find F 2 (X, Y) = F (X, Y) 2. Find F 3 (X, Y) = (F ) (X, Y) 3. Express F (X, Y) in sum of min-terms (SOM) 4. Express F (X, Y) in product of max-terms (POM) 5. Express F 3 in SOM 6. Implement F (X, Y) using logic gates (Logic Diagram). 52
53 Boolean Functions X Y F (X, Y) F 2 (X, Y) F 3 (X, Y) Note: & 2 answers are shown in the table. 3. F (X, Y) = m + m 3 = X Y + XY = (, 3) 4. F (X, Y) = M. M 2 = (X + Y ). (X + Y) = (, 2) 53
54 Boolean Functions 5. F 3 (X, Y) = m + m 2 = X Y + XY = (, 2) 6. F (X, Y) = X Y + XY X Y 54
55 Boolean Functions Ex: Given F (X, Y, Z) = X YZ + XY Z + XYZ.. Find Truth Table for F (X, Y, Z). 2. Express F (X, Y, Z) in Product of Max-terms (POM). 3. Find F 2 (X, Y, Z) = (F ) (X, Y, Z). 4. Express F 2 (X, Y, Z) in SOM. 5. Implement F (X, Y, Z) using logic gates. 55
56 Boolean Functions. F (X, Y, Z) = m 3 + m 5 + m 7 = (3, 5, 7) F 2 (X, Y, Z) F (X, Y, Z) Z Y X 56
57 Boolean Functions 2. F (X, Y, Z) = (,, 2, 4, 6) = M. M. M 2. M 4. M 6 = (X + Y + Z). (X + Y + Z ). (X + Y + Z). (X + Y + Z). (X + Y + Z) 3. F 2 (X, Y, Z) = (F ) (X, Y, Z) =[ (X YZ) + (XY Z) + (XYZ) ] = (X + Y + Z ). (X + Y + Z ). (X + Y + Z ) = M 3. M 5. M 7 (Look at Truth Table) 57
58 Boolean Functions 4. F 2 (X, Y, Z) = m + m + m 2 + m 4 + m 6 = (X.Y. Z ) + (X.Y. Z) + 5. Logic Diagram (X.Y.Z ) + (X.Y.Z ). (X.Y.Z ) 58
59 Boolean Functions Logical Function can be expressed in Canonical forms:. Sum of min-terms (SOM). 2. Product of max-terms (POM). Or the logical Function can be expressed in the standard forms:. Sum of Product (SOP). 2. Product of Sum (POS). 59
60 Boolean Functions Ex: F(X, Y, Z) = X + XZ + XYZ Sum of Products Ex: F(X, Y, Z) = Y (X + Y) (X + Y + Z) Product of Sums Ex: Given F(X, Y, Z) = XY + XZ + YZ Find. The truth table of F(X, Y, Z). 2. Express F(X, Y, Z) in SOM. SOP 3. Implement F(X, Y, Z) using logic gates. 6
61 Boolean Functions. The answer is shown in the table. F(X, Y, Z) Z Y X 6
62 Boolean Functions 2. F(X, Y, Z) = XY (Z + Z ) + XZ (Y + Y ) + YZ (X + X ) = XYZ + XYZ + XYZ + XY Z + XYZ + X YZ = m 7 + m 6 + m 5 + m 3 3. Logic Diagram 62
Unit-IV Boolean Algebra
Unit-IV Boolean Algebra Boolean Algebra Chapter: 08 Truth table: Truth table is a table, which represents all the possible values of logical variables/statements along with all the possible results of
X Y Z F=X+Y+Z
This circuit is used to obtain the compliment of a value. If X = 0, then X = 1. The truth table for NOT gate is : X X 0 1 1 0 2. OR gate : The OR gate has two or more input signals but only one output
Chapter 2. Boolean Expressions:
Chapter 2 Boolean Expressions: A Boolean expression or a function is an expression which consists of binary variables joined by the Boolean connectives AND and OR along with NOT operation. Any Boolean
Chapter 2 Boolean algebra and Logic Gates
Chapter 2 Boolean algebra and Logic Gates 2. Introduction In working with logic relations in digital form, we need a set of rules for symbolic manipulation which will enable us to simplify complex expressions
Menu. Algebraic Simplification - Boolean Algebra EEL3701 EEL3701. MSOP, MPOS, Simplification
Menu Minterms & Maxterms SOP & POS MSOP & MPOS Simplification using the theorems/laws/axioms Look into my... 1 Definitions (Review) Algebraic Simplification - Boolean Algebra Minterms (written as m i ):
2.6 BOOLEAN FUNCTIONS
2.6 BOOLEAN FUNCTIONS Binary variables have two values, either 0 or 1. A Boolean function is an expression formed with binary variables, the two binary operators AND and OR, one unary operator NOT, parentheses
Variable, Complement, and Literal are terms used in Boolean Algebra.
We have met gate logic and combination of gates. Another way of representing gate logic is through Boolean algebra, a way of algebraically representing logic gates. You should have already covered the
Philadelphia University Faculty of Information Technology Department of Computer Science. Computer Logic Design. By Dareen Hamoudeh.
Philadelphia University Faculty of Information Technology Department of Computer Science Computer Logic Design By Dareen Hamoudeh Dareen Hamoudeh 1 Canonical Forms (Standard Forms of Expression) Minterms
Chapter 3 Simplification of Boolean functions
3.1 Introduction Chapter 3 Simplification of Boolean functions In this chapter, we are going to discuss several methods for simplifying the Boolean function. What is the need for simplifying the Boolean
Boolean Algebra and Logic Gates
Boolean Algebra and Logic Gates Binary logic is used in all of today's digital computers and devices Cost of the circuits is an important factor Finding simpler and cheaper but equivalent circuits can
UNIT-4 BOOLEAN LOGIC. NOT Operator Operates on single variable. It gives the complement value of variable.
UNIT-4 BOOLEAN LOGIC Boolean algebra is an algebra that deals with Boolean values((true and FALSE). Everyday we have to make logic decisions: Should I carry the book or not?, Should I watch TV or not?
Lecture 5. Chapter 2: Sections 4-7
Lecture 5 Chapter 2: Sections 4-7 Outline Boolean Functions What are Canonical Forms? Minterms and Maxterms Index Representation of Minterms and Maxterms Sum-of-Minterm (SOM) Representations Product-of-Maxterm
Circuit analysis summary
Boolean Algebra Circuit analysis summary After finding the circuit inputs and outputs, you can come up with either an expression or a truth table to describe what the circuit does. You can easily convert
IT 201 Digital System Design Module II Notes
IT 201 Digital System Design Module II Notes BOOLEAN OPERATIONS AND EXPRESSIONS Variable, complement, and literal are terms used in Boolean algebra. A variable is a symbol used to represent a logical quantity.
ENGINEERS ACADEMY. 7. Given Boolean theorem. (a) A B A C B C A B A C. (b) AB AC BC AB BC. (c) AB AC BC A B A C B C.
Digital Electronics Boolean Function QUESTION BANK. The Boolean equation Y = C + C + C can be simplified to (a) (c) A (B + C) (b) AC (d) C. The Boolean equation Y = (A + B) (A + B) can be simplified to
Assignment (3-6) Boolean Algebra and Logic Simplification - General Questions
Assignment (3-6) Boolean Algebra and Logic Simplification - General Questions 1. Convert the following SOP expression to an equivalent POS expression. 2. Determine the values of A, B, C, and D that make
Experiment 3: Logic Simplification
Module: Logic Design Name:... University no:.. Group no:. Lab Partner Name: Mr. Mohamed El-Saied Experiment : Logic Simplification Objective: How to implement and verify the operation of the logical functions
BOOLEAN ALGEBRA. 1. State & Verify Laws by using :
BOOLEAN ALGEBRA. State & Verify Laws by using :. State and algebraically verify Absorption Laws. (2) Absorption law states that (i) X + XY = X and (ii) X(X + Y) = X (i) X + XY = X LHS = X + XY = X( + Y)
CS February 17
Discrete Mathematics CS 26 February 7 Equal Boolean Functions Two Boolean functions F and G of degree n are equal iff for all (x n,..x n ) B, F (x,..x n ) = G (x,..x n ) Example: F(x,y,z) = x(y+z), G(x,y,z)
Boolean Algebra. P1. The OR operation is closed for all x, y B x + y B
Boolean Algebra A Boolean Algebra is a mathematical system consisting of a set of elements B, two binary operations OR (+) and AND ( ), a unary operation NOT ('), an equality sign (=) to indicate equivalence
2008 The McGraw-Hill Companies, Inc. All rights reserved.
28 The McGraw-Hill Companies, Inc. All rights reserved. 28 The McGraw-Hill Companies, Inc. All rights reserved. All or Nothing Gate Boolean Expression: A B = Y Truth Table (ee next slide) or AB = Y 28
Gate Level Minimization Map Method
Gate Level Minimization Map Method Complexity of hardware implementation is directly related to the complexity of the algebraic expression Truth table representation of a function is unique Algebraically
Gate-Level Minimization. BME208 Logic Circuits Yalçın İŞLER
Gate-Level Minimization BME28 Logic Circuits Yalçın İŞLER islerya@yahoo.com http://me.islerya.com Complexity of Digital Circuits Directly related to the complexity of the algebraic expression we use to
Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University
Logic Design First Stage Lecture No.5 Boolean Algebra Bawar Abid Abdalla Assistant Lecturer Software Engineering Department Koya University Boolean Operations Laws of Boolean Algebra Rules of Boolean Algebra
Standard Forms of Expression. Minterms and Maxterms
Standard Forms of Expression Minterms and Maxterms Standard forms of expressions We can write expressions in many ways, but some ways are more useful than others A sum of products (SOP) expression contains:
Computer Organization
Computer Organization (Logic circuits design and minimization) KR Chowdhary Professor & Head Email: kr.chowdhary@gmail.com webpage: krchowdhary.com Department of Computer Science and Engineering MBM Engineering
SYNERGY INSTITUTE OF ENGINEERING & TECHNOLOGY,DHENKANAL LECTURE NOTES ON DIGITAL ELECTRONICS CIRCUIT(SUBJECT CODE:PCEC4202)
Lecture No:5 Boolean Expressions and Definitions Boolean Algebra Boolean Algebra is used to analyze and simplify the digital (logic) circuits. It uses only the binary numbers i.e. 0 and 1. It is also called
R.M.D. ENGINEERING COLLEGE R.S.M. Nagar, Kavaraipettai
L T P C R.M.D. ENGINEERING COLLEGE R.S.M. Nagar, Kavaraipettai- 601206 DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EC8392 UNIT - I 3 0 0 3 OBJECTIVES: To present the Digital fundamentals, Boolean
UNIT 2 BOOLEAN ALGEBRA
UNIT 2 BOOLEN LGEBR Spring 2 2 Contents Introduction Basic operations Boolean expressions and truth tables Theorems and laws Basic theorems Commutative, associative, and distributive laws Simplification
Objectives: 1- Bolean Algebra. Eng. Ayman Metwali
Objectives: Chapter 3 : 1- Boolean Algebra Boolean Expressions Boolean Identities Simplification of Boolean Expressions Complements Representing Boolean Functions 2- Logic gates 3- Digital Components 4-
Experiment 4 Boolean Functions Implementation
Experiment 4 Boolean Functions Implementation Introduction: Generally you will find that the basic logic functions AND, OR, NAND, NOR, and NOT are not sufficient to implement complex digital logic functions.
Chapter 3. Boolean Algebra and Digital Logic
Chapter 3 Boolean Algebra and Digital Logic Chapter 3 Objectives Understand the relationship between Boolean logic and digital computer circuits. Learn how to design simple logic circuits. Understand how
Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University
Logic Design First Stage Lecture No.6 Boolean Algebra Bawar Abid Abdalla Assistant Lecturer Software Engineering Department Koya University Outlines Boolean Operations Laws of Boolean Algebra Rules of
ELCT201: DIGITAL LOGIC DESIGN
ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 3 Following the slides of Dr. Ahmed H. Madian محرم 1439 ه Winter
Gate Level Minimization
Gate Level Minimization By Dr. M. Hebaishy Digital Logic Design Ch- Simplifying Boolean Equations Example : Y = AB + AB Example 2: = B (A + A) T8 = B () T5 = B T Y = A(AB + ABC) = A (AB ( + C ) ) T8 =
Summary. Boolean Addition
Summary Boolean Addition In Boolean algebra, a variable is a symbol used to represent an action, a condition, or data. A single variable can only have a value of or 0. The complement represents the inverse
LSN 4 Boolean Algebra & Logic Simplification. ECT 224 Digital Computer Fundamentals. Department of Engineering Technology
LSN 4 Boolean Algebra & Logic Simplification Department of Engineering Technology LSN 4 Key Terms Variable: a symbol used to represent a logic quantity Compliment: the inverse of a variable Literal: a
Combinational Logic & Circuits
Week-I Combinational Logic & Circuits Spring' 232 - Logic Design Page Overview Binary logic operations and gates Switching algebra Algebraic Minimization Standard forms Karnaugh Map Minimization Other
Module -7. Karnaugh Maps
1 Module -7 Karnaugh Maps 1. Introduction 2. Canonical and Standard forms 2.1 Minterms 2.2 Maxterms 2.3 Canonical Sum of Product or Sum-of-Minterms (SOM) 2.4 Canonical product of sum or Product-of-Maxterms(POM)
Get Free notes at Module-I One s Complement: Complement all the bits.i.e. makes all 1s as 0s and all 0s as 1s Two s Complement: One s complement+1 SIGNED BINARY NUMBERS Positive integers (including zero)
CS8803: Advanced Digital Design for Embedded Hardware
CS883: Advanced Digital Design for Embedded Hardware Lecture 2: Boolean Algebra, Gate Network, and Combinational Blocks Instructor: Sung Kyu Lim (limsk@ece.gatech.edu) Website: http://users.ece.gatech.edu/limsk/course/cs883
Announcements. Chapter 2 - Part 1 1
Announcements If you haven t shown the grader your proof of prerequisite, please do so by 11:59 pm on 09/05/2018 (Wednesday). I will drop students that do not show us the prerequisite proof after this
QUESTION BANK FOR TEST
CSCI 2121 Computer Organization and Assembly Language PRACTICE QUESTION BANK FOR TEST 1 Note: This represents a sample set. Please study all the topics from the lecture notes. Question 1. Multiple Choice
ENGIN 112 Intro to Electrical and Computer Engineering
ENGIN 2 Intro to Electrical and Computer Engineering Lecture 5 Boolean Algebra Overview Logic functions with s and s Building digital circuitry Truth tables Logic symbols and waveforms Boolean algebra
Boolean algebra. June 17, Howard Huang 1
Boolean algebra Yesterday we talked about how analog voltages can represent the logical values true and false. We introduced the basic Boolean operations AND, OR and NOT, which can be implemented in hardware
Computer Science. Unit-4: Introduction to Boolean Algebra
Unit-4: Introduction to Boolean Algebra Learning Objective At the end of the chapter students will: Learn Fundamental concepts and basic laws of Boolean algebra. Learn about Boolean expression and will
Lecture (04) Boolean Algebra and Logic Gates
Lecture (4) Boolean Algebra and Logic Gates By: Dr. Ahmed ElShafee ١ Dr. Ahmed ElShafee, ACU : Spring 26, Logic Design Boolean algebra properties basic assumptions and properties: Closure law A set S is
Lecture (04) Boolean Algebra and Logic Gates By: Dr. Ahmed ElShafee
Lecture (4) Boolean Algebra and Logic Gates By: Dr. Ahmed ElShafee Boolean algebra properties basic assumptions and properties: Closure law A set S is closed with respect to a binary operator, for every
EEE130 Digital Electronics I Lecture #4_1
EEE130 Digital Electronics I Lecture #4_1 - Boolean Algebra and Logic Simplification - By Dr. Shahrel A. Suandi 4-6 Standard Forms of Boolean Expressions There are two standard forms: Sum-of-products form
Boolean Algebra. BME208 Logic Circuits Yalçın İŞLER
Boolean Algebra BME28 Logic Circuits Yalçın İŞLER islerya@yahoo.com http://me.islerya.com 5 Boolean Algebra /2 A set of elements B There exist at least two elements x, y B s. t. x y Binary operators: +
Chapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization Overview Part Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra Standard
ELCT201: DIGITAL LOGIC DESIGN
ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 3 Following the slides of Dr. Ahmed H. Madian ذو الحجة 1438 ه Winter
Combinational Logic Circuits
Chapter 3 Combinational Logic Circuits 12 Hours 24 Marks 3.1 Standard representation for logical functions Boolean expressions / logic expressions / logical functions are expressed in terms of logical
Chapter 2: Combinational Systems
Uchechukwu Ofoegbu Chapter 2: Combinational Systems Temple University Adapted from Alan Marcovitz s Introduction to Logic and Computer Design Riddle Four switches can be turned on or off. One is the switch
Lecture (05) Boolean Algebra and Logic Gates
Lecture (05) Boolean Algebra and Logic Gates By: Dr. Ahmed ElShafee ١ Minterms and Maxterms consider two binary variables x and y combined with an AND operation. Since eachv ariable may appear in either
Digital Logic Lecture 7 Gate Level Minimization
Digital Logic Lecture 7 Gate Level Minimization By Ghada Al-Mashaqbeh The Hashemite University Computer Engineering Department Outline Introduction. K-map principles. Simplification using K-maps. Don t-care
2.1 Binary Logic and Gates
1 EED2003 Digital Design Presentation 2: Boolean Algebra Asst. Prof.Dr. Ahmet ÖZKURT Asst. Prof.Dr Hakkı T. YALAZAN Based on the Lecture Notes by Jaeyoung Choi choi@comp.ssu.ac.kr Fall 2000 2.1 Binary
Introduction to Computer Architecture
Boolean Operators The Boolean operators AND and OR are binary infix operators (that is, they take two arguments, and the operator appears between them.) A AND B D OR E We will form Boolean Functions of
Lecture 4: Implementation AND, OR, NOT Gates and Complement
EE210: Switching Systems Lecture 4: Implementation AND, OR, NOT Gates and Complement Prof. YingLi Tian Feb. 13, 2018 Department of Electrical Engineering The City College of New York The City University
Spring 2010 CPE231 Digital Logic Section 1 Quiz 1-A. Convert the following numbers from the given base to the other three bases listed in the table:
Section 1 Quiz 1-A Convert the following numbers from the given base to the other three bases listed in the table: Decimal Binary Hexadecimal 1377.140625 10101100001.001001 561.24 454.3125 111000110.0101
Chapter 3. Gate-Level Minimization. Outlines
Chapter 3 Gate-Level Minimization Introduction The Map Method Four-Variable Map Five-Variable Map Outlines Product of Sums Simplification Don t-care Conditions NAND and NOR Implementation Other Two-Level
Computer Engineering Chapter 3 Boolean Algebra
Computer Engineering Chapter 3 Boolean Algebra Hiroaki Kobayashi 5/30/2011 Ver. 06102011 5/30/2011 Computer Engineering 1 Agenda in Chapter 3 What is Boolean Algebra Basic Boolean/Logical Operations (Operators)
Combinational Logic Circuits
Chapter 2 Combinational Logic Circuits J.J. Shann (Slightly trimmed by C.P. Chung) Chapter Overview 2-1 Binary Logic and Gates 2-2 Boolean Algebra 2-3 Standard Forms 2-4 Two-Level Circuit Optimization
Boolean Analysis of Logic Circuits
Course: B.Sc. Applied Physical Science (Computer Science) Year & Sem.: IInd Year, Sem - IIIrd Subject: Computer Science Paper No.: IX Paper Title: Computer System Architecture Lecture No.: 7 Lecture Title:
Gate-Level Minimization
MEC520 디지털공학 Gate-Level Minimization Jee-Hwan Ryu School of Mechanical Engineering Gate-Level Minimization-The Map Method Truth table is unique Many different algebraic expression Boolean expressions may
Chapter 2. Boolean Algebra and Logic Gates
Chapter 2. Boolean Algebra and Logic Gates Tong In Oh 1 Basic Definitions 2 3 2.3 Axiomatic Definition of Boolean Algebra Boolean algebra: Algebraic structure defined by a set of elements, B, together
SWITCHING THEORY AND LOGIC CIRCUITS
SWITCHING THEORY AND LOGIC CIRCUITS COURSE OBJECTIVES. To understand the concepts and techniques associated with the number systems and codes 2. To understand the simplification methods (Boolean algebra
Gate-Level Minimization
Gate-Level Minimization ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall, 2011 ldvan@cs.nctu.edu.tw http://www.cs.nctu.edu.tw/~ldvan/ Outlines The Map Method
Simplification of Boolean Functions
Simplification of Boolean Functions Contents: Why simplification? The Map Method Two, Three, Four and Five variable Maps. Simplification of two, three, four and five variable Boolean function by Map method.
Switching Theory & Logic Design/Digital Logic Design Question Bank
Switching Theory & Logic Design/Digital Logic Design Question Bank UNIT I NUMBER SYSTEMS AND CODES 1. A 12-bit Hamming code word containing 8-bits of data and 4 parity bits is read from memory. What was
Class Subject Code Subject Prepared By Lesson Plan for Time: Lesson. No 1.CONTENT LIST: Introduction to UnitI 2. SKILLS ADDRESSED: Listening I year, 02 sem CS6201 Digital Principles & System Design S.Seedhanadevi
Digital Logic Design (CEN-120) (3+1)
Digital Logic Design (CEN-120) (3+1) ASSISTANT PROFESSOR Engr. Syed Rizwan Ali, MS(CAAD)UK, PDG(CS)UK, PGD(PM)IR, BS(CE)PK HEC Certified Master Trainer (MT-FPDP) PEC Certified Professional Engineer (COM/2531)
Permutation Matrices. Permutation Matrices. Permutation Matrices. Permutation Matrices. Isomorphisms of Graphs. 19 Nov 2015
9 Nov 25 A permutation matrix is an n by n matrix with a single in each row and column, elsewhere. If P is a permutation (bijection) on {,2,..,n} let A P be the permutation matrix with A ip(i) =, A ij
CDA 3200 Digital Systems. Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012
CDA 3200 Digital Systems Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012 Outline Data Representation Binary Codes Why 6-3-1-1 and Excess-3? Basic Operations of Boolean Algebra Examples
Introduction to Boolean Algebra
Introduction to Boolean Algebra Boolean algebra which deals with two-valued (true / false or and ) variables and functions find its use in modern digital computers since they too use two-level systems
Code No: 07A3EC03 Set No. 1
Code No: 07A3EC03 Set No. 1 II B.Tech I Semester Regular Examinations, November 2008 SWITCHING THEORY AND LOGIC DESIGN ( Common to Electrical & Electronic Engineering, Electronics & Instrumentation Engineering,
Definitions. 03 Logic networks Boolean algebra. Boolean set: B 0,
3. Boolean algebra 3 Logic networks 3. Boolean algebra Definitions Boolean functions Properties Canonical forms Synthesis and minimization alessandro bogliolo isti information science and technology institute
Introduction to Boolean Algebra
Introduction to Boolean Algebra Boolean algebra which deals with two-valued (true / false or and ) variables and functions find its use in modern digital computers since they too use two-level systems
Introduction to Boolean logic and Logical Gates
Introduction to Boolean logic and Logical Gates Institute of Statistics Fall 2014 We saw the importance of the binary number system for data representation in a computer system. We ll see that the construction
1. Mark the correct statement(s)
1. Mark the correct statement(s) 1.1 A theorem in Boolean algebra: a) Can easily be proved by e.g. logic induction b) Is a logical statement that is assumed to be true, c) Can be contradicted by another
Ch. 5 : Boolean Algebra &
Ch. 5 : Boolean Algebra & Reduction elektronik@fisika.ui.ac.id Objectives Should able to: Write Boolean equations for combinational logic applications. Utilize Boolean algebra laws and rules for simplifying
DSAS Laboratory no 4. Laboratory 4. Logic forms
Laboratory 4 Logic forms 4.1 Laboratory work goals Going from Boolean functions to Boolean forms. Logic forms equivalence. Boolean forms simplification. Shannon s theorems. Representation in NAND and NOR
Digital Logic Design. Outline
Digital Logic Design Gate-Level Minimization CSE32 Fall 2 Outline The Map Method 2,3,4 variable maps 5 and 6 variable maps (very briefly) Product of sums simplification Don t Care conditions NAND and NOR
9/10/2016. The Dual Form Swaps 0/1 and AND/OR. ECE 120: Introduction to Computing. Every Boolean Expression Has a Dual Form
University of Illinois at Urbana-Champaign Dept. of Electrical and Computer Engineering ECE 120: Introduction to Computing Boolean Properties and Optimization The Dual Form Swaps 0/1 and AND/OR Boolean
Gate-Level Minimization
Gate-Level Minimization ( 范倫達 ), 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 The Map Method
Designing Computer Systems Boolean Algebra
Designing Computer Systems Boolean Algebra 08:34:45 PM 4 June 2013 BA-1 Scott & Linda Wills Designing Computer Systems Boolean Algebra Programmable computers can exhibit amazing complexity and generality.
Boolean Logic CS.352.F12
Boolean Logic CS.352.F12 Boolean Algebra Boolean Algebra Mathematical system used to manipulate logic equations. Boolean: deals with binary values (True/False, yes/no, on/off, 1/0) Algebra: set of operations
Gate-Level Minimization
Gate-Level Minimization Mano & Ciletti Chapter 3 By Suleyman TOSUN Ankara University Outline Intro to Gate-Level Minimization The Map Method 2-3-4-5 variable map methods Product-of-Sums Method Don t care
B.Tech II Year I Semester (R13) Regular Examinations December 2014 DIGITAL LOGIC DESIGN
B.Tech II Year I Semester () Regular Examinations December 2014 (Common to IT and CSE) (a) If 1010 2 + 10 2 = X 10, then X is ----- Write the first 9 decimal digits in base 3. (c) What is meant by don
SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE)
SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road 517583 QUESTION BANK (DESCRIPTIVE) Subject with Code : STLD(16EC402) Year & Sem: II-B.Tech & I-Sem Course & Branch: B.Tech
數位系統 Digital Systems 朝陽科技大學資工系. Speaker: Fuw-Yi Yang 楊伏夷. 伏夷非征番, 道德經察政章 (Chapter 58) 伏者潛藏也道紀章 (Chapter 14) 道無形象, 視之不可見者曰夷
數位系統 Digital Systems Department of Computer Science and Information Engineering, Chaoyang University of Technology 朝陽科技大學資工系 Speaker: Fuw-Yi Yang 楊伏夷 伏夷非征番, 道德經察政章 (Chapter 58) 伏者潛藏也道紀章 (Chapter 14) 道無形象,
Chapter 2 Combinational
Computer Engineering 1 (ECE290) Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization HOANG Trang 2008 Pearson Education, Inc. Overview Part 1 Gate Circuits and Boolean Equations Binary Logic
CMPE223/CMSE222 Digital Logic
CMPE223/CMSE222 Digital Logic Optimized Implementation of Logic Functions: Strategy for Minimization, Minimum Product-of-Sums Forms, Incompletely Specified Functions Terminology For a given term, each
ENGIN 112. Intro to Electrical and Computer Engineering
ENIN 2 Intro to Electrical and Computer Engineering Lecture 6 More Boolean Algebra ENIN2 L6: More Boolean Algebra September 5, 23 A B Overview Epressing Boolean functions Relationships between algebraic
Dr. Chuck Cartledge. 10 June 2015
Miscellanea Exam #1 Break Exam review 2.1 2.2 2.3 2.4 Break 3 4 Conclusion References CSC-205 Computer Organization Lecture #003 Chapter 2, Sections 2.1 through 4 Dr. Chuck Cartledge 10 June 2015 1/30
UNIT II. Circuit minimization
UNIT II Circuit minimization The complexity of the digital logic gates that implement a Boolean function is directly related to the complexity of the algebraic expression from which the function is implemented.
DIGITAL CIRCUIT LOGIC UNIT 7: MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES
DIGITAL CIRCUIT LOGIC UNIT 7: MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES 1 iclicker Question 13 Considering the K-Map, f can be simplified as (2 minutes): A) f = b c + a b c B) f = ab d + a b d AB CD
Gate-Level Minimization. section instructor: Ufuk Çelikcan
Gate-Level Minimization section instructor: Ufuk Çelikcan Compleity of Digital Circuits Directly related to the compleity of the algebraic epression we use to build the circuit. Truth table may lead to
ECE380 Digital Logic
ECE38 Digital Logic Optimized Implementation of Logic Functions: Strategy for Minimization, Minimum Product-of-Sums Forms, Incompletely Specified Functions Dr. D. J. Jackson Lecture 8- Terminology For
To write Boolean functions in their standard Min and Max terms format. To simplify Boolean expressions using Karnaugh Map.
3.1 Objectives To write Boolean functions in their standard Min and Max terms format. To simplify Boolean expressions using. 3.2 Sum of Products & Product of Sums Any Boolean expression can be simplified