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) British Council Certified Facilitator Trainer Computer Sciences Department Bahria University (Karachi Campus) Floyd, Digital Fundamentals, 10 th ed 2009 Pearson Education, Upper Saddle River, NJ All Rights Reserved
2 BOOLEAN ALGEBRA Floyd, Digital Fundamentals, 10 th ed Lecture No 04 By Engr. Syed Rizwan Ali 2009 Pearson Education, Upper Saddle River, NJ All Rights Reserved
3 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 1 or 0. The complement represents the inverse of a variable and is indicated with an overbar. Thus, the complement of A is A. A literal is a variable or its complement. Addition is equivalent to the OR operation. The sum term is 1 if one or more if the literals are 1. The sum term is zero only if each literal is 0. Determine the values of A, B, and C that make the sum term of the expression A + B + C = 0? Each literal must = 0; therefore A = 1, B = 0 and C = 1.
4 Boolean Multiplication In Boolean algebra, multiplication is equivalent to the AND operation. The product of literals forms a product term. The product term will be 1 only if all of the literals are 1. What are the values of the A, B and C if the product term of A. B. C = 1? Each literal must = 1; therefore A = 1, B = 0 and C = 0.
5 Commutative Laws The commutative laws are applied to addition and multiplication. For addition, the commutative law states In terms of the result, the order in which variables are ORed makes no difference. A + B = B + A For multiplication, the commutative law states In terms of the result, the order in which variables are ANDed makes no difference. AB = BA
6 Associative Laws The associative laws are also applied to addition and multiplication. For addition, the associative law states When ORing more than two variables, the result is the same regardless of the grouping of the variables. A + (B +C) = (A + B) + C For multiplication, the associative law states When ANDing more than two variables, the result is the same regardless of the grouping of the variables. A(BC) = (AB)C
7 Distributive Law The distributive law is the factoring law. A common variable can be factored from an expression just as in ordinary algebra. That is AB + AC = A(B+ C) The distributive law can be illustrated with equivalent circuits: B C A B + C A(B+ C) X A B A C AB AC AB + AC X
8 Rules of Boolean Algebra 1. A + 0 = A 2. A + 1 = 1 3. A. 0 = 0 4. A. 1 = A 5. A + A = A 6. A + A = 1 7. A. A = A 8. A. A = 0 = 9. A = A 10. A + AB = A 11. A + AB = A + B 12. (A + B)(A + C) = A + BC
9 Rules of Boolean Algebra Rules of Boolean algebra can be illustrated with Venn diagrams. The variable A is shown as an area. The rule A + AB = A can be illustrated easily with a diagram. Add an overlapping area to represent the variable B. The overlap region between A and B represents AB. A AB B = A The diagram visually shows that A + AB = A. Other rules can be illustrated with the diagrams as well.
10 Rules of Boolean Algebra Illustrate the rule diagram. A + AB = A + B with a Venn This time, A is represented by the blue area and B again by the red circle. The intersection represents AB. Notice that A + AB = A + B A A AB BA
11 Rules of Boolean Algebra Rule 12, which states that (A + B)(A + C) = A + BC, can be proven by applying earlier rules as follows: (A + B)(A + C) = AA + AC + AB + BC = A + AC + AB + BC = A(1 + C + B) + BC = A. 1 + BC = A + BC This rule is a little more complicated, but it can also be shown with a Venn diagram, as given on the following slide
12 Three areas represent the variables A, B, and C. The area representing A + B is shown in yellow. The area representing A + C is shown in red. The overlap of red and yellow is shown in orange. The overlapping area between B and C represents BC. ORing with A gives the same area as before. A B A + B A + C = C (A + B)(A + C) A + BC A B BC C
13 DeMorgan s Theorem DeMorgan s 1 st Theorem The complement of a product of variables is equal to the sum of the complemented variables. AB = A + B Applying DeMorgan s first theorem to gates: A B AB A B A + B Inputs Output A B AB A + B NAND Negative-OR
14 DeMorgan s Theorem DeMorgan s 2 nd Theorem The complement of a sum of variables is equal to the product of the complemented variables. A + B = A. B Applying DeMorgan s second theorem to gates: A B NOR A + B A B Negative-AND AB Inputs Output A B A + B AB
15 DeMorgan s Theorem Apply DeMorgan s theorem to remove the overbar covering both terms from the expression X = C + D. To apply DeMorgan s theorem to the expression, you can break the overbar covering both terms and change the sign between the terms. This results in = X = C. D. Deleting the double bar gives X = C. D.
16 DeMorgan s Theorem Apply DeMorgan s theorem to remove the over bar covering both terms from the expression X = (A+B+C) +D To apply DeMorgan s theorem to the expression. Theorem 1 says XY = X+Y. This results in X = (A+B+C) +D. The again apply DeMorgan s theorem and final expression gives X = A B C.D.
17 Boolean Analysis of Logic Circuits Combinational logic circuits can be analyzed by writing the expression for each gate and combining the expressions according to the rules for Boolean algebra. Apply Boolean algebra to derive the expression for X. Write the expression for each gate: A B C D (A + B ) C (A + B ) Applying DeMorgan s theorem and the distribution law: X = C (A B) + D = A B C + D X = C (A + B )+ D
18 Boolean Analysis of Logic Circuits Simplify the expression by using Boolean algebra for X =A(A+ B) Write the simplification by using Boolean Algebra: Applying, Distributive Law, Rule 7, Factoring, Rule 2, and the Rule 4: X = A (A + B) = AA + AB = A + AB = A (1 + B) X = A = A (1)
19 Simplification using Boolean Algebra Simplify the expression by using Boolean algebra for X =AB + A(B+C) + B(B+C) Write the simplification by using Boolean Algebra: Applying Distributive Law, Rule 7, Factoring, Rule 2, Factoring, Rule 2, Rule 4, Factoring, Rule 2, and the Rule 4: X = AB + AB + AC + BB +BC = AB + AC + B + BC = AB + AC + B (1+ C) = AB + AC + B = B(A+1) + AC = B(1) + AC = B + AC X = B+AC
20 Boolean Analysis of Logic Circuits Use Multisim to generate the truth table for the circuit in the previous example. Set up the circuit using the Logic Converter as shown. (Note that the logic converter has no real-world counterpart.) Double-click the Logic Converter top open it. Then click on the conversion bar on the right side to see the truth table for the circuit (see next slide).
21 Boolean Analysis of Logic Circuits The simplified logic expression can be viewed by clicking Simplified expression
22 SOP and POS forms Boolean expressions can be written in the sum-of-products form (SOP) or in the product-of-sums form (POS). These forms can simplify the implementation of combinational logic, particularly with PLDs. In both forms, an over bar cannot extend over more than one variable. An expression is in SOP form when two or more product terms are summed as in the following examples: A B C + A B A B C + C D C D + E An expression is in POS form when two or more sum terms are multiplied as in the following examples: (A + B)(A + C) (A + B + C)(B + D) (A + B)C
23 SOP Standard form In SOP standard form, every variable in the domain must appear in each term. This form is useful for constructing truth tables or for implementing logic in PLDs. You can expand a nonstandard term to standard form by multiplying the term by a term consisting of the sum of the missing variable and its complement. Convert X = A B + A B C to standard form. The first term does not include the variable C. Therefore, multiply it by the Rule: 6 (C + C) = 1: X = A B (C + C) + A B C = A B C + A B C + A B C
24 SOP Standard form The Logic Converter in Multisim can convert a circuit into standard SOP form. Use Multisim to view the logic for the circuit in standard SOP form. Click the truth table to logic button on the Logic Converter. See next slide
25 SOP Standard form SOP Standard form
26 POS Standard form In POS standard form, every variable in the domain must appear in each sum term of the expression. You can expand a nonstandard POS expression to standard form by adding the product of the missing variable and its complement and applying Rule 12, which states that (A + B)(A + C) = A + BC. Convert X = (A + B)(A + B + C) to standard form. The first sum term does not include the variable C. Therefore, add Rule 8: C.C = 0 and expand the result by Rule 12. X = (A + B + C C)(A + B + C) = (A +B + C )(A + B + C)(A + B + C)
27 Binary Representation of MINTERMS AND MAXTERMS A B C Min-terms Max-terms A. BC. A. BC. A. BC. A. BC. A. BC. A. BC. A. BC. A. BC. A B C A B C A B C A B C A B C A B C A B C A B C
28 3 Variable K Map AB\C A\BC
29 4 Variable K Map AB\CD
30 Karnaugh maps The Karnaugh map (K-map) is a tool for simplifying combinational logic with 3 or 4 variables. For 3 variables, 8 cells are required (2 3 ). The map shown is for three variables labeled A, B, and C. Each cell represents one possible product term. Each cell differs from an adjacent cell by only one variable. ABC ABC ABC ABC ABC ABC ABC ABC
31 Gray code Karnaugh maps Cells are usually labeled using 0 s and 1 s to represent the variable and its complement. The numbers are entered in gray code, to force adjacent cells to be different by only one variable. Ones are read as the true variable and zeros are read as the complemented variable.
32 Karnaugh maps Alternatively, cells can be labeled with the variable letters. This makes it simple to read, but it takes more time preparing the map. Read the terms for the yellow cells. AB AB AB AB C C ABC ABC ABC C C ABC ABC The cells are ABC and ABC. AB AB ABC ABC AB AB ABC ABC
33 Karnaugh maps K-maps can simplify combinational logic by grouping cells and eliminating variables that change. Group the 1 s on the map and read the minimum logic. B changes across this boundary AB C C changes across this boundary 1. Group the 1 s into two overlapping groups as indicated. 2. Read each group by eliminating any variable that changes across a boundary. 3. The vertical group is read AC. 4. The horizontal group is read AB. X = AC +AB
34 Karnaugh maps A 4-variable map has an adjacent cell on each of its four boundaries as shown. AB AB AB AB CD CD CD CD Each cell is different only by one variable from an adjacent cell. Grouping follows the rules given in the text. The following slide shows an example of reading a four variable map using binary numbers for the variables
35 Karnaugh maps Group the 1 s on the map and read the minimum logic. B changes B changes CD AB C changes across outer boundary C changes X Group the 1 s into two separate groups as indicated. 2. Read each group by eliminating any variable that changes across a boundary. 3. The upper (yellow) group is read as AD. 4. The lower (green) group is read as AD. X = AD +AD
36 Karnaugh Map 3 Variables A B Ç+A BC+AB C+ABC. X = C
37 Karnaugh Map 3 Variables A B Ç +A B C+A BC+A BC +ABC+ABC Try X = A +B
38 Karnaugh Map 3 Variables A B Ç +A B C+A BC+A BC +AB C +ABC Try Yourself X =?
39 Karnaugh Map 4 Variables Try X =?
40 Karnaugh Map 4 Variables Try X =?
41 Karnaugh Map 4 Variables X =?
42 Karnaugh Map 4 Variables Try Yourself X =?
43 Karnaugh Map 4 Variables Try
44 Karnaugh Map 4 Variables Try
45 Karnaugh Map 4 Variables Try
46 Karnaugh Map 5 Variables
47 Karnaugh Map 5 Variables A B C D E+A B C DE+A B C DE +A B CD E+ A B CDE+A BC DE+A BCD E+ABCD E+ABCE+ AB C D E+AB C DE+AB CDE TRY Out = A B E + B C E + A C DE + A CD E + ABCE + AB DE + A B C D
48 Karnaugh Map 5 Variables A B E+A B CE+A B CD E+A BC DE+A BCD E+ ABCDE+ABCD E+AB C D E+AB C DE+AB CDE TRY Y=A'B'E + B'C'E + A'B'C'D + AB'DE + ACDE + ABCE +BCD E+B'CDE
49 Karnaugh Map 5 Variables A B C D E +A B CD E +A BCD E +A BC D E + A B C D E+A BCD E+A BCDE+AB C D E + AB C D E+ABCD E+ABCDE+AB CDE TRY Y=A D'E' + B'C D'+ BCE + ACDE
50 Karnaugh Map 5 Variables If (A,B,C,D,E)= Σ m(1, 2, 3, 5, 7, 11, 17, 19, 15, 21, 29, 31) TRY Out = A B E + B C E + A C DE + A CD E + ABCE + AB DE + A B C D
51 Karnaugh Map 5 Variables If (A,B,C,D,E)= Σ m(1, 2, 3, 5, 7, 11, 15, 17, 19, 21, 29, 31) TRY Out = AB DE + A B E +\
52 Karnaugh Map 5 Variables If (A,B,C,D,E)= Σ m(1, 2, 3, 5, 7, 11, 15, 17, 19, 21, 29, 31) TRY Out = AB DE + A B E +\
53 Karnaugh Map 6 Variables
54 Sum and Product Notation if(a,b,c,d) = Σ m(0,1, 2, 3, 4, 5, 7, 8, 9, 11, 12, 13, 15) or if(a,b,c,d)=σ(m1,m2,m3,m4,m5,m7,m8,m9,m11,m12,m13,m15)
55 Sum and Product Notation f(a,b,c,d) = Π M(2, 6, 8, 9, 10, 11, 14) or f(a,b,c,d) = Π(M2, M6, M8, M9, M10, M11, M14)
56 POS Karnaugh Map 4 Variables TRY
57 Hardware Description Languages (HDLs) A Hardware Description Language (HDL) is a tool for implementing a logic design in a PLD. One important language is called VHDL. In VHDL, there are three approaches to describing logic: 1. Structural Description is like a schematic (components and block diagrams). 2. Dataflow 3. Behavioral Description is equations, such as Boolean operations, and registers. Description is specifications over time (state machines, etc.).
58 Hardware Description Languages (HDLs) The data flow method for VHDL uses Boolean-type statements. There are two-parts to a basic data flow program: the entity and the architecture. The entity portion describes the I/O. The architecture portion describes the logic. The following example is a VHDL program showing the two parts. The program is used to detect an invalid BCD code. entity BCDInv is port (B,C,D: in bit; X: out bit); end entity BCDInv architecture Invalid of BCDInv begin X <= (B or C) and D; end architecture Invalid;
59 Hardware Description Languages (HDLs) Another standard HDL is Verilog. In Verilog, the I/O and the logic is described in one unit called a module. Verilog uses specific symbols to stand for the Boolean logical operators. The following is the same program as in the previous slide, written for Verilog: module BCDInv (X, B, C, D); input B, C, D; output X; assign X = (B C)&D; endmodule
60 Selected Key Terms Variable Complement Sum term Product term A symbol used to represent a logical quantity that can have a value of 1 or 0, usually designated by an italic letter. The inverse or opposite of a number. In Boolean algebra, the inverse function, expressed with a bar over the variable. The Boolean sum of two or more literals equivalent to an OR operation. The Boolean product of two or more literals equivalent to an AND operation.
61 Selected Key Terms Sum-ofproducts (SOP) Product of sums (POS) Karnaugh map VHDL A form of Boolean expression that is basically the ORing of ANDed terms. A form of Boolean expression that is basically the ANDing of ORed terms. An arrangement of cells representing combinations of literals in a Boolean expression and used for systematic simplification of the expression. A standard hardware description language. IEEE Std
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
Company LOGO DKT 122/3 DIGITAL SYSTEM 1 BOOLEAN ALGEBRA (PART 2) Boolean Algebra Contents Boolean Operations & Expression Laws & Rules of Boolean algebra DeMorgan s Theorems Boolean analysis of logic circuits
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.
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
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
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
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
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.
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
CHAPTER-2 STRUCTURE OF BOOLEAN FUNCTION USING GATES, K-Map and Quine-McCluskey 2. Introduction Logic gates are connected together to produce a specified output for certain specified combinations of input
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)
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
ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, firstname.lastname@example.org Dr. Eng. Wassim Alexan, email@example.com Lecture 3 Following the slides of Dr. Ahmed H. Madian ذو الحجة 1438 ه Winter
Points Addressed in this Lecture Lecture 4: Logic Simplication & Karnaugh Map Professor Peter Cheung Department of EEE, Imperial College London Standard form of Boolean Expressions Sum-of-Products (SOP),
Ch. 5 : Boolean Algebra & Reduction firstname.lastname@example.org Objectives Should able to: Write Boolean equations for combinational logic applications. Utilize Boolean algebra laws and rules for simplifying
CSE4: Components and Design Techniques for Digital Systems Specifying logic functions Instructor: Mohsen Imani Slides from: Prof.Tajana Simunic and Dr.Pietro Mercati We have seen various concepts: Last
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
4 KARNAUGH MAP MINIMIZATION A Karnaugh map provides a systematic method for simplifying Boolean expressions and, if properly used, will produce the simplest SOP or POS expression possible, known as the
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)
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
Combinational Circuits Digital Logic (Materials taken primarily from: http://www.facstaff.bucknell.edu/mastascu/elessonshtml/eeindex.html http://www.cs.princeton.edu/~cos126 ) Digital Systems What is a
COURSE / CODE DIGITAL SYSTEMS FUNDAMENTAL (ECE 421) DIGITAL ELECTRONICS FUNDAMENTAL (ECE 422) BOOLEAN ALGEBRA Boolean Logic Boolean logic is a complete system for logical operations. It is used in countless
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
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
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
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 ):
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
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)
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
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
Code No: R059210504 Set No. 1 II B.Tech I Semester Supplementary Examinations, February 2007 DIGITAL LOGIC DESIGN ( Common to Computer Science & Engineering, Information Technology and Computer Science
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
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active in View Show
Name: Instructor: Engr. Date Performed: Marks Obtained: /10 Group Members (ID):. Checked By: Date: Experiment # 04 Boolean Expression Simplification and Implementation OBJECTIVES: To understand the utilization
CSCI 22: Computer Architecture I Instructor: Pranava K. Jha Simplification of Boolean Functions using a Karnaugh Map Q.. Plot the following Boolean function on a Karnaugh map: f(a, b, c, d) = m(, 2, 4,
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
VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur-603 203 DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EC6302 DIGITAL ELECTRONICS YEAR / SEMESTER: II / III ACADEMIC YEAR: 2015-2016 (ODD
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
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
Gate-Level Minimization ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall, 2017 email@example.com http://www.cs.nctu.edu.tw/~ldvan/ Outlines The Map Method
COM111 Introduction to Computer Engineering (Fall 2006-2007) NOTES 5 -- page 1 of 5 Introduction Simplification of Boolean Functions You already know one method for simplifying Boolean expressions: Boolean
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
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
Switching Circuits & Logic Design Jie-Hong Roland Jiang 江介宏 Department of Electrical Engineering National Taiwan University Fall 23 5 Karnaugh Maps K-map Walks and Gray Codes http://asicdigitaldesign.wordpress.com/28/9/26/k-maps-walks-and-gray-codes/
DIGITAL CIRCUIT LOGIC UNIT 5: KARNAUGH MAPS (K-MAPS) 1 Learning Objectives 1. Given a function (completely or incompletely specified) of three to five variables, plot it on a Karnaugh map. The function
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
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
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
Code No: R059210504 Set No. 1 II B.Tech I Semester Regular Examinations, November 2006 DIGITAL LOGIC DESIGN ( Common to Computer Science & Engineering, Information Technology and Computer Science & Systems
Gate-Level Minimization ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall, 2011 firstname.lastname@example.org http://www.cs.nctu.edu.tw/~ldvan/ Outlines The Map Method
數位系統 Digital Systems Department of Computer Science and Information Engineering, Chaoyang University of Technology 朝陽科技大學資工系 Speaker: Fuw-Yi Yang 楊伏夷 伏夷非征番, 道德經察政章 (Chapter 58) 伏者潛藏也道紀章 (Chapter 14) 道無形象,
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 And Logic Design UNIT-II GATE LEVEL MINIMIZATION Two-variable k-map: A two-variable k-map can have 2 2 =4 possible combinations of the input variables A and B. Each of these combinations,
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
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
1. a) What are the three methods of obtaining the 2 s complement of a given binary (3M) number? b) What do you mean by K-map? Name it advantages and disadvantages. (3M) c) Distinguish between a half-adder
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,
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
Pearson Education Limited Edinburgh Gate Harlow Essex M2 2JE England and Associated ompanies throughout the world Visit us on the World Wide Web at: www.pearsoned.co.uk Pearson Education Limited 24 All
Objectives:. Four variables maps. 2. Simplification using prime implicants. 3. "on t care" conditions. 4. Summary.. Four variables Karnaugh maps Minterms A A m m m3 m2 A B C m4 C A B C m2 m8 C C m5 C m3
Boolean Algebra BME28 Logic Circuits Yalçın İŞLER email@example.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: +
SEE223: Digital Electronics 3 Combinational Logic Design Zulkifil Md Yusof Dept. of Microelectronics and Computer Engineering The aculty of Electrical Engineering Universiti Teknologi Malaysia Karnaugh
Boolean relationships on Venn Diagrams The fourth example has A partially overlapping B. Though, we will first look at the whole of all hatched area below, then later only the overlapping region. Let's
Code No: R059210504 Set No. 1 II B.Tech I Semester Regular Examinations, November 2007 DIGITAL LOGIC DESIGN ( Common to Computer Science & Engineering, Information Technology and Computer Science & Systems
Review EECS 150 - Components and Design Techniques for Digital Systems Lec 05 Boolean Logic 94-04 David Culler Electrical Engineering and Computer Sciences University of California, Berkeley Design flow
NH 67, Karur Trichy Highways, Puliyur C.F, 639 114 Karur District DEPARTMENT OF INFORMATION TECHNOLOGY CS 2202 DIGITAL PRINCIPLES AND SYSTEM DESIGN UNIT 1 BOOLEAN ALGEBRA AND LOGIC GATES Review of binary
4-5 Karnaugh Map Method A graphical method of simplifying logic equations or truth tables. Also called a K map. Theoretically can be used for any number of input variables, but practically limited to 5