Combinational Logic Design/Circuits
|
|
- Abigayle Flowers
- 5 years ago
- Views:
Transcription
1 3 ` Combinational Logic Design/Circuits Chapter-3(Hours : 12 Marks:24 ) Combinational Logic design / Circuits 3.1 Simplification of Boolean expression using Boolean algebra. 3.2 Construction of logical circuits forms Boolean expressions. 3.3 Boolean expressions using Sum of products and product of sums forms. 3.4 K-map representation of logical functions. 3.5 Minimization of logical expressions using K-map ( 2, 3, 4 variables). 3.6 Standardization of SOP & POS equations 3.7 Concept of Adders / Subtractor. 3.8 Truth table, K-map, Simplified logical expression and logical circuit using basic gates and universal gates of : (a) Half adder and full adder. (b) Half subtractor and full subtractor. 3.9 Block diagram, Truth table, Logical expression and logic diagram of Multiplexers (4:1 and 8:1), Multiplexer IC Block diagram and Truth table of Demultiplexer (1:4; 1:8;1:16), Demultiplexer IC Block diagram and Truth table of Encoders, Priority Encoders ICs and Decoder Block diagram, Truth table, working principle, Applications, pin functions of Decimal to BCD Encoder (IC 74147) and BCD to 7-segment Decoder. Block diagram and function table of Parity generator (IC 74180), Digital comparator IC (7485); Block diagram and pin functions of ALU Combinational Logic Circuit Combination Logic circuits are made up from basic logic AND, OR or NOT gates that are "combined" or connected together to produce more complicated switching circuits. As combination logic circuits are made up from individual logic gates they can also be considered as "decision making circuits" and combinational logic is about combining logic gates together to process two or more signals in order to produce at least one output signal according to the logical function of each logic gate. Common combinational circuits made up from individual logic gates include Multiplexers, Decoders and De-multiplexers, Full and Half Adders etc. Classification of Combinational Logic One of the most common uses of combination logic is in Multiplexer and De-multiplexer type circuits. Here, multiple inputs or outputs are connected to a common signal line and logic gates are used 1
2 to decode an address to select a single data input or output switch. A multiplexer consist of two separate components, a logic decoder and some solid state switches, but before we can discuss multiplexers, decoders and de-multiplexers in more detail we first need to understand how these devices use these "solid state switches" in their design. Standard Representation For Logical Function Q1.What is Variable and list the standard from of the Boolean Function Ans.A Variable in complemented or uncomplemented form is known as Literal. Thus Boolean functions or equation are expressed in terms of literal. The values assumed by literal are in binary form. Any Boolean function can be expressed in two standard or canonical forms 1) Sum of product (SOP) 2) Product of sum (POS) If each term in SOP and POS form contain all the literal (variables) then these are known as standard SOP or standard POS form. Q2.What SOP and How SOP Equations are represented? Ans.Standard SOP form Each individual term in standard SOP form is called as minterm. Y = PQR + PQR + PQR + PQR + PQR 2
3 This contain all the independent variable in SOP form which is obtained by first ANDing and then ORing them i.e. minterm or each term. Hence above equation has 5 minterm's PQR,PQR,PQR,PQR,PQR. The possible number of minterm is equal to 2 to the power of number of variable i.e. if 3 variables are present in equation then there are 2 3 = 8 minterm's. Minterm with normal complemented variables is taken as 0 and uncomplemented is taken as 1. Fig. Shows the truth able for 3 variables Boolean expressions. A B A Decimal equivalent Minterm(mi) Notation CBA m CBA m CBA m CBA m CBA m CBA m CBA m CBA m7 Using these notation we can write equation as Y = m7 +m6+m5+m4+m3+m2+m1+m0 Y = m Σ (0,1,2,3,4,5,6,7) Hence it is easy to used notation instead of minterm. The symbol Σ represent ORing of minterm. Q3. Write truth table and equation in SOP form for following minterm. Y = m(1,3,6,7) Ans : Minterm are M1,M2,M3,M4,M5,M6,M7. And equation has 3 variables. Hence the truth table is M table for minterm available in function write 1. A B C Minterm Notations Y ABC M ABC M ABC M ABC M ABC M ABC M ABC M ABC M7 1 Y = ABC +ABC+ABC+ABC. 3
4 In general each row of truth table has functional value 1 described by minterm. The minterm is product of literal. The complement variable has value logic 0 and uncomplemented variable has value logic 1. Combining all the products term (minterm) constructed for the variable having value=1 i.e. minterm value = 1 by Boolean OR operation results in minterm canonical form. Q4.What POS and How POS Equations are represented? Ans.Product of Sum( POS ) Product of sum method is also called as maxterm canonical form. Consider the equation Y = (A+B+C)(A+B+C)(A+B+C) In this approach independent variables are ORing is followed by ANDing of individual term. Each individual is called as maxterm. Number of maxterm depends on number of literal or variables i.e. if equation has three variables then there will be 2 3 = 8 maxterm. Each maxterm is represented by M i where subscript i is decimal equivalent of natural binary number. The maxterm with complemented variable is taken as 1 and uncomplemented variable is taken as 0. Table shows possible maxterm for 3 variables equation. A B C Decimal equivalent Maxterm Notation Mi M0 A+B+C M1 A+B+C M2 A+B+C M3 A+B+C M4 A+B+C M5 A+B+C M6 A+B+C M7 A+B+C Using this notation above equation can be written as M2.M3.M4 = πm( i=2,3,6) = πm(2,3,6) Where π is represented ANDing of maxterm Y = (A+B+C)(A+B+C)(A+B+C) Q5.Write truth table and equation in POS form for following minterm. Y = ( A+B+C)(A+B+C)(A+B+C) 4
5 A B C Decimal equivalent Y = πm(2,3,6) Maxterm Mi Notation M0 A+B+C M1 A+B+C M2 A+B+C M3 A+B+C M4 A+B+C M5 A+B+C M6 A+B+C M7 A+B+C 0 In general each row of truth table represent that has functional (i.e. output) of logical 0. It is described by maxterm. Maxterm is sum of all the term. In maxterm representation complemented variable has value 1 and uncomplemented variable has value 0. Combining all the sum term(maxterm) constructed for variable having value logic 0 by Boolean AND operation results in maxterm canonical form. Q6.Write truth table and equation in SOP form for following minterm. πm(2,3,6,7) Solution: A B C Decimal Maxterm Mi Notation Y equivalent M0 A+B+C M1 A+B+C M2 A+B+C M3 A+B+C M4 A+B+C M5 A+B+C M6 A+B+C M7 A+B+C 0 Substitute 0 for all values represented in equation and then AND all maxterm from truth table (A+B+C) (A+B+C) (A+B+C) (A+B+C) Q7.Describe Conversion of SOP to standard SOP form Ans.The SOP form can be converted to standard SOP form by ANDing the term in the expression with term form by ORing the variable and its complement which are not present in that term. AB+AB+BC In first term C is missing, AND it with(c+c) Y 5
6 In second term B is missing, AND it with(b+b) In third term A missing, AND it with (A+A) Y = AB(C+C)+AC(B+B)+BC(A+A) = ABC+ABC+ABC+ABC+ABC+ABC Y = ABC+ABC+ABC+ABC+ABC Hence above equation is standard SOP equation. Q8.Describe the step Conversion of standard SOP to POS Ans.The Boolean expression in standard SOP form can be converted to standard POS as follows: 1) Complement the Boolean expression in standard SOP form which will contain missing minterm. 2) Complement the individual missing minterm to get maxterm and by using demorgan law change OR(sum) to AND (product). Q9.Describe the Conversion of POS to standard POS Ans.The POS form can be converted to standard POS form by ORing the terms in the expression with terms formed by ANDing the variable and its complement which are not present in that term. Y = (A+B)(A+C)(B+C) to standard POS form. 1 st term A+B, C is missing, OR with it C.C 2 nd term A+C, B is missing, OR it with B.B 3 rd term B+C, A is missing, Or it with A.A Y = (A+B+C.C)(A+C+B.B)(B+C+A.A) = (A+B+C)(A+B+C)(A+B+C)(A+B+C)(A+B+C)(A+B+C) Y = (A+B+C)(A+B+C)(A+B+C)(A+B+C) Hence above equation is in standard POS form. Q10.Convert Y = ABC+ABC+ABC+ABC+ABC in standard SOP form to standard POS form. Terms in the minterm are m1, m3, m4, m5, m7 1) Step1:Missing minterm are M0,M2,M6. Y = Σ(m0,m2,m6) Y = Σ(m0,m2,m6) 2) Step2: Complement equation using DMT. Y = π(m0,m2,m6) Y = (A+B+C)(A+B+C)(A+B+C) Q11.Describe the Conversion of standard POS to Standard SOP form The Boolean expression in standard POS form can be converted to standard SOP form by following, following procedure 6
7 1) Complement the Boolean expression in standard POS form which will contain missing maxterm. 2) Complement the individual missing maxterm to get the minterm and by using demorgan(dmt) law change AND(product) to OR(sum). Q12.Convert the Boolean expression SPOS to SSOP (A+B+C) (A+B+C) (A+B+C) = (M0,M3,M4) Solution 1) Step1: Missing maxterm are M1,M2,M5,M6,M7. Y = πm1,m2,m5,m6,m7. 2) Step2 : Complement expression by DMT. Y = πm1.m2.m5.m6.m7 = ABC+ ABC+ ABC+ ABC+ ABC Q13.List the different Boolean expression simplification technique Ans.The SSOP or SPOS equation that has more than just a few products are difficult to reduce by algebraic method. Karnaugh map or K-map method is used for simplification of Boolean expression. It is graphical method of representation. But if number of variables are more than 4 or exceeds 4 than it is difficult to solve using K-map than other following techniques are used. 1) Variable entered mapping 2) Quine MC cluskey method Hence to solve any Boolean expression there are four methods out of Which two are listed above and other two are 1) Algebraic method 2) K-map method. Q14.What is Karnaugh or K-map?Describe Ans. The Karnaugh map, like Boolean algebra, is a simplification tool applicable to digital logic. Maurice Karnaugh, a telecommunications engineer, developed the Karnaugh map at Bell Labs in Karnaugh map or K-map method is used for simplification of Boolean expression. It is graphical method of representation k-map for two, three and four variable is shown in fig. In an n-variable K- map there are 2 n cells. Each cell corresponds to one of the combination of n- variables. In k-map one cell represent one minterm or maxterm. In k-map the variables and all possible values of the variable are indicated to identify cell. GRAY code is used for identification of cell Sample Two, Three and Four Variable KMaps variable k-map (n=2) F(AB) variable k-map (n=3) F(ABC) Variable K-Map (n=4) 7
8 8
9 Q15.Describe Two Variable K Maps? Ans.2-variable k-map: Table shows truth table for 2 variable equation In 2 variable A & B has four combination corresponds to 4-minterm (or maxterm) and needs four location in k-map. These four locations corresponds to 4 rows of truth table. A 1 is placed in those boxes where minterm are included (1) and 0 is included where the minterm are absent or excluded (0). Hence for above truth table the k-map is Truth Table A B Y Minterms K- Map Entry AB AB 1 AB AB Q16.Describe Three Variable K Maps? Ans. 3 variable k-map : Truth table for three variable k-map is as shown. For three variable equation k-map will have 8 cells as shown(2 3 = 8). A 1 is placed in those boxes where minterm are included (1) and 0 is included where the minterm are absent or excluded (0). Hence for above truth table the k-map is K Map For 3 Variable 0 ABC ABC ABC ABC 1 ABC ABC ABC ABC In this case also enter 1 for minterm's whose 1 and 0 for the maxterm's Truth Table A B C Y
10 Q17.Describe Three Variable K Maps? Ans. 4 variable k-map : Table shows truth table for 4-variable Boolean expression. For 4 variable equation k-map has 16 cells i.e. 2 4 = 16 A 1 is placed in those boxes where minterm are included (1) and 0 is included where the minterm are absent or excluded (0). Hence for above truth table the k-map is Truth Table ABCDY K-Map for 4-Variable is as shown 00ABCDABCDABCDABCD01ABCDABC DABCDABCD11ABCDABCDABCDABC D10ABCDABCDABCDABCD K Map Q18.Describe the terms Minterm and Maxterm Ans.Minterm A product in as SSOP is called as Minterm.A minterm is a Boolean expression resulting in 1 for the output of a single cell, and 0s for all other cells in a Karnaugh map, or truth table. If a minterm has a single 1 and the remaining cells as 0s, it would appear to cover a minimum area of 1s. 10
11 The example above left shows the minterm ABC, a single product term, as a single 1 in a map that is otherwise 0s. Another minterm A'BC' is shown above right. The point to noted is that the address of the cell corresponds directly to the minterm being mapped. That is, the cell 111 corresponds to the minterm ABC above left. Above right we see that the minterm A'BC' corresponds directly to the cell 010. A Boolean expression or map may have multiple minterms. Maxterm A product in as SPOS is called as Maxterm.A maxterm is a Boolean expression resulting in a 0 for the output of a single cell expression, and 1s for all other cells in the Karnaugh map, or truth table. The illustration above left shows the maxterm (A+B+C), a single sum term, as a single 0 in a map that is otherwise 1s. If a maxterm has a single 0 and the remaining cells as 1s, it would appear to cover a maximum area of 1s. The maxterm is a 0, not a 1 in the Karnaugh map. A maxterm is a sum term, (A+B+C) in our example, not a product term. Therefore (A+B+C) is mapped into the cell 000. For the equation Out=(A+B+C)=0, all three variables (A, B, C) must individually be equal to 0. Only (0+0+0)=0 will equal 0. Thus we place our sole 0 for minterm (A+B+C) in cell A,B,C=000 in the K-map, where the inputs are all0. This is the only case which will give us a 0 for our maxterm. All other cells contain 1s because any input values other than ((0,0,0) for (A+B+C) yields 1s upon evaluation. Q19.List the Procedure for placing a minterm in a K-map Ans. Following are the steps to Place Minterm in KMAP identify the minterm (product term) term to be mapped. Write the corresponding binary numeric value. Use binary value as an address to place a 1 in the K-map Repeat steps for other minterms (P-terms within a Sum-Of-Products). 11
12 Q20.List the Procedure for placing a maxterm in a K-map Ans. Following are the steps to Place Maxterm in KMAP Identify the Sum term to be mapped. Write corresponding binary numeric value. Form the complement Use the complement as an address to place a 0 in the K-map Repeat for other maxterms (Sum terms within Product-of-Sums expression). Q21.List the procedure for writing the Sum-Of-Products reduced Boolean equation from a K-map: Ans : The procedure for writing the Sum-Of-Products reduced Boolean equation from a K-map: Form largest groups of 1s possible covering all minterms. Groups must be a power of 2. Write binary numeric value for groups. Convert binary value to a product term. Repeat steps for other groups. Each group yields a p-terms within a Sum-Of- Products. Q22.List the procedure for writing the Product-Of-Sums Boolean reduction for a K- map: Ans.The procedure for writing the Product-Of-Sums Boolean reduction for a K-map: Form largest groups of 0s possible, covering all maxterms. Groups must be a power of 2. Write binary numeric value for group. Complement binary numeric value for group. Convert complement value to a sum-term. Repeat steps for other groups. Each group yields a sum-term within a Product-Of- Sums result. Q23.Describe the terms PAIR, QUAD and OCTECTS related to KMAPS Ans.Simplification of logical function with k-map is based on the principle of combining terms in adjacent cells. Two cells are said to be adjacent if they differ in only one variable. Also left two cells and right two cells are adjacent Similarly simplification of logical function is achieved by grouping adjacent 1 s or 0 s in group of 2 i where i= 0,1,2,3 i.e. up to the number of variables. PAIR : Grouping two adjacent ones: If there are two adjacent ones in k- map these can be grouped together and the resulting term will have one literal less than original two terms (minterm) i.e. Pairs. 12
13 AB+AB AC Y = BC Other possibilities Other possibilities QUAD : Grouping adjacent 4 one s: A quad is group of four 1 s that are 1) Horizontally or vertically adjacent. 2) 1 s may be end to end. 3) 1 s in form of a square. In quad group two variable and their complement are eliminated Y = C Y = AB CD Y = Y =
14 OCTECT: Grouping of adjacent 8 one s: Other than pair there is one more group of adjacent 1 s i.e. the octet. This is a group of 8-1 s as shown in fig. An octect group eliminates three variables and its complement Overlapping Groups: When there are pairs, quads, octet in a k-map. There is possibility that these group overlap i.e. it is possible to combine a particular 1 in k-map in more than one way Y = Q24.Describe the term ROLLING, Redundant Group, Corner related to KMAP Ans. Rolling the map :Rolling of map is also possible as shown in fig. In k-map rolling is done so that the left side touches the right side. If you see carefully it is two pair forming quad Other possibilities
15 Eliminate redundant group After you finished encircling groups, eliminate any redundant group. This is a group whose 1 s are already grouped. In fig. All pairs are grouped, then if you form quad, already all 1 s of quad are grouped in pair. Therefore quad is redundant it should be eliminated Corner Fold up the corners of the map below like it is a napkin to make the four cells physically adjacent. The four cells above are a group of four because they all have the Boolean variables B' and D' in common. In other words, B=0 for the four cells, and D=0 for the four cells. The other variables (A, B) are 0 in some cases, 1 in other cases with respect to the four corner cells. Thus, these variables (A, B) are not involved with this group of four. This single group comes out of the map as one product term for the simplified result: Out=B'C' Q25. Find grouping for following k-map?
16 Q26.List the Rules for simplification of k-maps Ans.Rules for Simplification of KMAP 2 variables k-maps 1) Any two in adjacent is one then k-map may be k-map combined to represent single variable. 2) Any single 1 on map represent the AND function (product) of two variables. 3) The total expression corresponding to 1 s of map the ORed function(sum) of various variable term which covers all 1 s in the map 3 variable k-maps 1) A group of 4-adjacent 1 s can be combined to represent a single variable. 2) A group of 2-adjacent 1 s can be combined to represent 2 variable. 3) Any single 1 on map represent three variable. 4 variable k-map 1) Grouping of 8-1 s represent a single variable term. 2) Group of 4-1 s represent two variables term. 3) Group of 2-1 s represent 3 variable term. 4) Individual 1 s represent 4-variable terms. Notes 1) Top row is considered to be adjacent to bottom row. 2) Extreme left hand row is adjacent to the extreme right hand row. 3) Always try to overlap group of possible i.e. try to make largest group. 4) Sometimes take care that all the 1 s should not overlap. Q27.Simplify the Following Ans. 16
17 Circuit Diagram for the Solution obtained 17
18 Q28. Simplify the following Boolean expression: 1) f(a,b,c) = πm(0,2,4,6,7) Solution: A B C Y AB Y = 2. f(a,b,c,d) = πm(0,1,5,7,8,9,12,13,15) Solution: A B C D Y f(a,b,c,d) = πm(0,1,2,4,5,8,9,10) Implementation using NAND and OR gate after simplification. Solution: A B C D Y A B C D Y
19 Q29. Simplify 1) f(a,b,c,d) = πm(1,3,4,5,6,7,8,9,13,15) Implement using NOR gate Solution: AB ) f(a,b,c,d) = πm(4,5,6,7,8,12) Solution: AB f=
Minimization 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 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 informationThis form sometimes used in logic circuit, example:
Objectives: 1. Deriving of logical expression form truth tables. 2. Logical expression simplification methods: a. Algebraic manipulation. b. Karnaugh map (k-map). 1. Deriving of logical expression from
More information211: Computer Architecture Summer 2016
211: Computer Architecture Summer 2016 Liu Liu Topic: Storage Project3 Digital Logic - Storage: Recap - Review: cache hit rate - Project3 - Digital Logic: - truth table => SOP - simplification: Boolean
More informationEx: Boolean expression for majority function F = A'BC + AB'C + ABC ' + ABC.
Boolean Expression Forms: Sum-of-products (SOP) Write an AND term for each input combination that produces a 1 output. Write the input variable if its value is 1; write its complement otherwise. OR the
More 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 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 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 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 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 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 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 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 informationBoolean Algebra and Logic Simplification
S302 Digital Logic Design Boolean Algebra and Logic Simplification Boolean Analysis of Logic ircuits, evaluating of Boolean expressions, representing the operation of Logic circuits and Boolean expressions
More 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 informationCombinational Logic Circuits Part II -Theoretical Foundations
Combinational Logic Circuits Part II -Theoretical Foundations Overview Boolean Algebra Basic Logic Operations Basic Identities Basic Principles, Properties, and Theorems Boolean Function and Representations
More 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 informationUNIT 4 MINTERM AND MAXTERM EXPANSIONS
UNIT 4 MINTERM AND MAXTERM EXPANSIONS Spring 2 Minterm and Maxterm Expansions 2 Contents Conversion of English sentences to Boolean equations Combinational logic design using a truth table Minterm and
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 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active
More informationChapter 2 : Boolean Algebra and Logic Gates
Chapter 2 : Boolean Algebra and Logic Gates By Electrical Engineering Department College of Engineering King Saud University 1431-1432 2.1. Basic Definitions 2.2. Basic Theorems and Properties of Boolean
More 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 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 informationUNIT 5 KARNAUGH MAPS Spring 2011
UNIT 5 KRNUGH MPS Spring 2 Karnaugh Maps 2 Contents Minimum forms of switching functions Two- and three-variable Four-variable Determination of minimum expressions using essential prime implicants Five-variable
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 informationChapter 2 Boolean Algebra and Logic Gates
Ch1: Digital Systems and Binary Numbers Ch2: Ch3: Gate-Level Minimization Ch4: Combinational Logic Ch5: Synchronous Sequential Logic Ch6: Registers and Counters Switching Theory & Logic Design Prof. Adnan
More informationMidterm1 Review. Jan 24 Armita
Midterm1 Review Jan 24 Armita Outline Boolean Algebra Axioms closure, Identity elements, complements, commutativity, distributivity theorems Associativity, Duality, De Morgan, Consensus theorem Shannon
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 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 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 informationVidyalankar S.E. Sem. III [CMPN] Digital Logic Design and Analysis Prelim Question Paper Solution
. (a) (i) ( B C 5) H (A 2 B D) H S.E. Sem. III [CMPN] Digital Logic Design and Analysis Prelim Question Paper Solution ( B C 5) H (A 2 B D) H = (FFFF 698) H (ii) (2.3) 4 + (22.3) 4 2 2. 3 2. 3 2 3. 2 (2.3)
More informationLogic. Combinational. inputs. outputs. the result. system can
Digital Electronics Combinational Logic Functions Digital logic circuits can be classified as either combinational or sequential circuits. A combinational circuit is one where the output at any time depends
More informationUnit 3 Session - 9 Data-Processing Circuits
Objectives Unit 3 Session - 9 Data-Processing Design of multiplexer circuits Discuss multiplexer applications Realization of higher order multiplexers using lower orders (multiplexer trees) Introduction
More informationKP/Worksheets: Propositional Logic, Boolean Algebra and Computer Hardware Page 1 of 8
KP/Worksheets: Propositional Logic, Boolean Algebra and Computer Hardware Page 1 of 8 Q1. What is a Proposition? Q2. What are Simple and Compound Propositions? Q3. What is a Connective? Q4. What are Sentential
More informationELC224C. Karnaugh Maps
KARNAUGH MAPS Function Simplification Algebraic Simplification Half Adder Introduction to K-maps How to use K-maps Converting to Minterms Form Prime Implicants and Essential Prime Implicants Example on
More informationBoolean Algebra and Digital Logic 2009, University of Colombo School of Computing
IT 204 Section 3.0 Boolean Algebra and Digital Logic Boolean Algebra 2 Logic Equations to Truth Tables X = A. B + A. B + AB A B X 0 0 0 0 3 Sum of Products The OR operation performed on the products of
More information( c) Give logic symbol, Truth table and circuit diagram for a clocked SR flip-flop. A combinational circuit is defined by the function
Question Paper Digital Electronics (EE-204-F) MDU Examination May 2015 1. (a) represent (32)10 in (i) BCD 8421 code (ii) Excess-3 code (iii) ASCII code (b) Design half adder using only NAND gates. ( c)
More informationKarnaugh Map & Boolean Expression Simplification
Karnaugh Map & Boolean Expression Simplification Mapping a Standard POS Expression For a Standard POS expression, a 0 is placed in the cell corresponding to the product term (maxterm) present in the expression.
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 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 informationNumber System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary
Number System Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary BOOLEAN ALGEBRA BOOLEAN LOGIC OPERATIONS Logical AND Logical OR Logical COMPLEMENTATION
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 informationDigital Circuit And Logic Design I. Lecture 4
Digital Circuit And Logic Design I Lecture 4 Outline Combinational Logic Design Principles (2) 1. Combinational-circuit minimization 2. Karnaugh maps 3. Quine-McCluskey procedure Panupong Sornkhom, 2005/2
More informationLogic Design I (17.341) Fall Lecture Outline
Logic Design I (17.341) Fall 2011 Lecture Outline Class # 06 October 24, 2011 Dohn Bowden 1 Today s Lecture Administrative Main Logic Topic Homework 2 Course Admin 3 Administrative Admin for tonight Syllabus
More informationCombinational Logic. By : Ali Mustafa
Combinational Logic By : Ali Mustafa Contents Adder Subtractor Multiplier Comparator Decoder Encoder Multiplexer How to Analyze any combinational circuit like this? Analysis Procedure To obtain the output
More informationBoolean Algebra and Logic Design (Class 2.2 1/24/2013) CSE 2441 Introduction to Digital Logic Spring 2013 Instructor Bill Carroll, Professor of CSE
Boolean Algebra and Logic Design (Class 2.2 1/24/2013) CSE 2441 Introduction to Digital Logic Spring 2013 Instructor Bill Carroll, Professor of CSE Today s Topics Boolean algebra applications in logic
More informationDIGITAL ELECTRONICS & it0203 Semester 3
DIGITAL ELECTRONICS & it0203 Semester 3 P.Rajasekar & C.M.T.Karthigeyan Asst.Professor SRM University, Kattankulathur School of Computing, Department of IT 8/22/2011 1 Disclaimer The contents of the slides
More 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 informationUNIT 1. BOOLEAN ALGEBRA AND COMBINATIONAL CIRCUITS
UNIT 1. BOOLEAN ALGEBRA AND COMBINATIONAL CIRCUITS Numerical Presentation: In science, technology, business, and, in fact, most other fields of endeavour, we are constantly dealing with quantities. Quantities
More informationKUMARAGURU COLLEGE OF TECHNOLOGY COIMBATORE
Estd-1984 KUMARAGURU COLLEGE OF TECHNOLOGY COIMBATORE 641 006 QUESTION BANK UNIT I PART A ISO 9001:2000 Certified 1. Convert (100001110.010) 2 to a decimal number. 2. Find the canonical SOP for the function
More informationSystems I: Computer Organization and Architecture
Systems I: Computer Organization and Architecture Lecture 6 - Combinational Logic Introduction A combinational circuit consists of input variables, logic gates, and output variables. The logic gates accept
More informationProf.Manoj Kavedia 2 Algebra
` Logic Gates and Boolean 2 Algebra Chapter-2 (Hours:06 Marks:14 )( 12064 Digital Techniques) Logic Gates And Boolean Algebra 2.1 Logical symbol, logical expression and truth table of AND, OR, NOT, NAND,
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 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 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 informationENGG 1203 Tutorial - 2 Recall Lab 2 - e.g. 4 input XOR. Parity checking (for interest) Recall : Simplification methods. Recall : Time Delay
ENGG 23 Tutorial - 2 Recall Lab 2 - e.g. 4 input XOR Parity checking (for interest) Parity bit Parity checking Error detection, eg. Data can be Corrupted Even parity total number of s is even Odd parity
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 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 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 informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Chapter 2 - Part 1 2 Chapter 2 - Part 1 3 Chapter 2 - Part 1 4 Chapter 2 - Part
More informationAdvanced Digital Design with the Verilog HDL, Second Edition Michael D. Ciletti Prentice Hall, Pearson Education, 2011
Problem 2-1 Recall that a minterm is a cube in which every variable appears. A Boolean expression in SOP form is canonical if every cube in the expression has a unique representation in which all of the
More 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 informationL2: Combinational Logic Design (Construction and Boolean Algebra)
L2: Combinational Logic Design (Construction and Boolean Algebra) Acknowledgements: Lecture material adapted from Chapter 2 of R. Katz, G. Borriello, Contemporary Logic Design (second edition), Pearson
More informationUNIT II COMBINATIONAL CIRCUITS:
UNIT II COMBINATIONAL CIRCUITS: INTRODUCTION: The digital system consists of two types of circuits, namely (i) (ii) Combinational circuits Sequential circuits Combinational circuit consists of logic gates
More informationGate-Level Minimization
Gate-Level Minimization Dr. Bassem A. Abdullah Computer and Systems Department Lectures Prepared by Dr.Mona Safar, Edited and Lectured by Dr.Bassem A. Abdullah Outline 1. The Map Method 2. Four-variable
More informationCs302 Quiz for MID TERM Exam Solved
Question # 1 of 10 ( Start time: 01:30:33 PM ) Total Marks: 1 Caveman used a number system that has distinct shapes: 4 5 6 7 Question # 2 of 10 ( Start time: 01:31:25 PM ) Total Marks: 1 TTL based devices
More informationAdministrative Notes. Chapter 2 <9>
Administrative Notes Note: New homework instructions starting with HW03 Homework is due at the beginning of class Homework must be organized, legible (messy is not), and stapled to be graded Chapter 2
More informationChapter 2 Combinational logic
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 informationBinary logic consists of binary variables and logical operations. The variables are
1) Define binary logic? Binary logic consists of binary variables and logical operations. The variables are designated by the alphabets such as A, B, C, x, y, z, etc., with each variable having only two
More 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 informationCS470: Computer Architecture. AMD Quad Core
CS470: Computer Architecture Yashwant K. Malaiya, Professor malaiya@cs.colostate.edu AMD Quad Core 1 Architecture Layers Building blocks Gates, flip-flops Functional bocks: Combinational, Sequential Instruction
More informationChapter 4. Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. elements. Dr.
Chapter 4 Dr. Panos Nasiopoulos Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. Sequential: In addition, they include storage elements Combinational
More informationIntroduction to Digital Logic Missouri S&T University CPE 2210 Karnaugh Maps
Introduction to Digital Logic Missouri S&T University CPE 2210 Karnaugh Maps Egemen K. Çetinkaya Egemen K. Çetinkaya Department of Electrical & Computer Engineering Missouri University of Science and Technology
More informationComputer Organization I. Lecture 13: Design of Combinational Logic Circuits
Computer Organization I Lecture 13: Design of Combinational Logic Circuits Overview The optimization of multiple-level circuits Mapping Technology Verification Objectives To know how to optimize the multiple-level
More informationCOMBINATIONAL LOGIC FUNCTIONS
COMBINATIONAL LOGIC FUNCTIONS Digital logic circuits can be classified as either combinational or sequential circuits. A combinational circuit is one where the output at any time depends only on the present
More informationChapter 4: Combinational Logic Solutions to Problems: [1, 5, 9, 12, 19, 23, 30, 33]
Chapter 4: Combinational Logic Solutions to Problems: [, 5, 9, 2, 9, 23, 3, 33] Problem: 4- Consider the combinational circuit shown in Fig. P4-. (a) Derive the Boolean expressions for T through T 4. Evaluate
More informationDHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN
DHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN UNIT I : BOOLEAN ALGEBRA AND LOGIC GATES PART - A (2 MARKS) Number
More informationIntroduction to Karnaugh Maps
Introduction to Karnaugh Maps Review So far, you (the students) have been introduced to truth tables, and how to derive a Boolean circuit from them. We will do an example. Consider the truth table for
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 informationSignals and Systems Digital Logic System
Signals and Systems Digital Logic System Prof. Wonhee Kim Chapter 2 Design Process for Combinational Systems Step 1: Represent each of the inputs and outputs in binary Step 1.5: If necessary, break the
More 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 informationMAHALAKSHMI ENGINEERING COLLEGE TIRUCHIRAPALLI
MAHALAKSHMI ENGINEERING COLLEGE TIRUCHIRAPALLI 6 DEPARTMENT: ECE QUESTION BANK SUBJECT NAME: DIGITAL ELECTRONICS UNIT I: Boolean Functions and Logic Gates PART -A ( Marks). What are the limitations of
More informationDepartment of Electrical & Electronics EE-333 DIGITAL SYSTEMS
Department of Electrical & Electronics EE-333 DIGITAL SYSTEMS 1) Given the two binary numbers X = 1010100 and Y = 1000011, perform the subtraction (a) X -Y and (b) Y - X using 2's complements. a) X = 1010100
More informationELECTRONICS & COMMUNICATION ENGINEERING PROFESSIONAL ETHICS AND HUMAN VALUES
EC 216(R-15) Total No. of Questions :09] [Total No. of Pages : 02 II/IV B.Tech. DEGREE EXAMINATIONS, DECEMBER- 2016 First Semester ELECTRONICS & COMMUNICATION ENGINEERING PROFESSIONAL ETHICS AND HUMAN
More informationEvery time has a value associated with it, not just some times. A variable can take on any value within a range
Digital Logic Circuits Binary Logic and Gates Logic Simulation Boolean Algebra NAND/NOR and XOR gates Decoder fundamentals Half Adder, Full Adder, Ripple Carry Adder Analog vs Digital Analog Continuous»
More 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 informationOptimizations and Tradeoffs. Combinational Logic Optimization
Optimizations and Tradeoffs Combinational Logic Optimization Optimization & Tradeoffs Up to this point, we haven t really considered how to optimize our designs. Optimization is the process of transforming
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 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 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 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 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 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 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 informationDesign of Combinational Logic
Pune Vidyarthi Griha s COLLEGE OF ENGINEERING, NASHIK 3. Design of Combinational Logic By Prof. Anand N. Gharu (Assistant Professor) PVGCOE Computer Dept.. 30 th June 2017 CONTENTS :- 1. Code Converter
More informationClass Website:
ECE 20B, Winter 2003 Introduction to Electrical Engineering, II LECTURE NOTES #5 Instructor: Andrew B. Kahng (lecture) Email: abk@ece.ucsd.edu Telephone: 858-822-4884 office, 858-353-0550 cell Office:
More informationDigital Logic Design ABC. Representing Logic Operations. Dr. Kenneth Wong. Determining output level from a diagram. Laws of Boolean Algebra
Digital Logic Design ENGG1015 1 st Semester, 2011 Representing Logic Operations Each function can be represented equivalently in 3 ways: Truth table Boolean logic expression Schematics Truth Table Dr.
More informationEE40 Lec 15. Logic Synthesis and Sequential Logic Circuits
EE40 Lec 15 Logic Synthesis and Sequential Logic Circuits Prof. Nathan Cheung 10/20/2009 Reading: Hambley Chapters 7.4-7.6 Karnaugh Maps: Read following before reading textbook http://www.facstaff.bucknell.edu/mastascu/elessonshtml/logic/logic3.html
More information/ M Morris Mano Digital Design Ahmad_911@hotmailcom / / / / wwwuqucscom Binary Systems Introduction - Digital Systems - The Conversion Between Numbering Systems - From Binary To Decimal - Octet To Decimal
More informationBOOLEAN ALGEBRA CLASS XII. Presented By : Dinesh Patel PGT CS KV IIT Powai
BOOLEAN ALGEBRA CLASS II Presented By : Dinesh Patel PGT CS KV IIT Powai Introduction Boolean Algebra is a set of rules and regulation which is suitable for Digital Circuits, whose answer is either True
More information