More Gates & Minterm Maxterm
|
|
- Sharleen McLaughlin
- 7 years ago
- Views:
Transcription
1 More Gates & Minterm Maxterm
2 Outline Review: Duality Principle Mores gates: XOR,XNOR, NAND, NOR Design Min term & Sum of Product Max Term & Product of SUM Boolean function: Representation, Canonical form Karnough map simplification 2
3 Principle of Duality Dual of a statement S is obtained By interchanging * and + By interchanging and By interchanging for all x by x also valid (for an expression) only for simple demorgan law Dual of (*)*( (a*)*(+a ) = is (a+)+(*a ) (* = (a+b) = a * b ( a+b ) * = (a *b )+
4 Duality examples x + = x x.=x X+x = A+B C A B +AB x.x = A. (B +C) (A +B ).(A+B) 4
5 Logic Gates: XOR, XNOR XOR A B A XOR B A B A XNOR B XNOR 5
6 Logic Gates: NAND, NOR NAND A B A NAND B A B A NOR B NOR NOR 6
7 NAND & NOR are universal (xx) = x ((xy) ) = xy (x y ) = x+y X (XX) =X X Y X (XY) X ((XY) ) =XY (X Y ) =X+Y Y Y 7
8 NAND & NOR are universal (x+x) = x ((x+y) ) = x+y (x +y ) = x.y X (X+X) =X X Y (X+Y) ((X+Y) ) =X+Y X X (X +Y ) =XY Y Y 8
9 Multi input input gate X X+X2+X3+ +Xn X2 X3 Xn X X2 X3 X. X2. X3..Xn Xn 9
10 Boolean Functions:Terminology F(a,b,c) = a bc + abc + ab + c Variable Represents a value ( or ), Three variables: a, b, and c Literal Appearance of a variable, in true or complemented form Nine literals: a,, b, c, a, b, c, a, b, and c Product term Product of literals, Four product terms: a bc, abc, ab, c p Sum of products (SOP) Above equation is in sum of products form. F = (a+b)c + d is not.
11 Representations of Boolean Functions English : F outputs when a is and b is, or when a is and b is. English 2: F outputs when a is, regardless of b s value (a) a a b F b Equation : F(a,b) = a b + a b F Equation 2: F(a,b) = a (b) (c) Circuit Truth table a F (d) Circuit 2 function F A function can be represented in different ways Above shows seven representations of the same functions F(a,b), using four different methods: English, Equation, Circuit, and Truth Table
12 Truth Table Representation of Functions Define value of F for each possible c d a b F c a b F a b F p combination of input values 2 input function: 4 rows (a) 2 input function: 4 rows 3 input function: 8 rows 4 input function: 6 (b) p rows Q: Use truth table to define function F(a b c) (b) c a b F a define function F(a,b,c) that is when abc is 5 or greater in binary (c)
13 Converting among Representations Can convert from any representation to any other Common conversions Equation to circuit Truth table to equation Equation to truth table Easy just evaluate equation for each input combination (row) Creating intermediate columns helps Q: Convert to truth table: F = a b + a b Inputs a b a' b' a' b Output F Inputs a b Outputs F F = a b b + a b Term F = sum of a b a b ab Q: Convert to equation a b c F ab c abc abc F = ab c + abc + abc
14 Standard Representation: Truth Table How to determine two functions are the same? Use algebraic methods But tif we failed, does that t prove not equal? No. Solution: Convert to truth tables Only ONE truth thtbl table representation tti of given same functions: Standard representation F = ab + a F = a b +a b + ab a b F a b F a
15 Canonical Form Sum of Minterms Truth thtbl tables too big for numerous inputs Use standard form of equation instead Known as canonical form Regular algebra: group terms of polynomial by power ax 2 + bx + c (3x 2 + 4x + 2x > 5x 2 + 4x + 4) Boolean algebra: create sumof minterms Minterm: product term with every function literal appearing exactly once, in true or complemented form Just multiply out equation until sum of product terms Then expand each term until all terms are minterms Determine if F(a,b)=ab+a is same function as F(a,b) = a b +a b+ab b+ab by to canonical form. F = ab+a (already sum of products) a F=ab +a (b+b ) a(b+b (expanding term) F = ab + a b + a b (it is canonical form)
16 Canonical form or Standard Form Canonical forms Sum of minterms (SOM) Product of maxterms (POM) Standard forms (may use less gates) Sum of products (SOP) Product of sums (POS) F = ab+a (already sum of products:sop) F=ab +a (b+b ) a(b+b (expanding term) F = ab + a b + a b (it is canonical form:som)
17 Canonical Forms It is useful to specify Boolean functions in a form that: Allows comparison for equality. Has a correspondence to the truth tables CanonicalForms incommonusage: Sum of Minterms (SOM) Productof of Maxterms (POM)
18 Minterms product term is a term where literals are ANDed. Example: x y, xz, xyz, minterm : A product term in which all variables appear exactly once, in normal or complemented form Example: F(x,y,z) has 8 minterms x y z, x y z, x yz,... Function with n variables has 2 n minterms A minterm equals at exactly one input combination and is equal to otherwise Example: x y z = only when x=, y=, z= A minterm is denoted as m i where i corresponds the input combination at which this minterm is equal to
19 2 Variable Minterms Two variables (X and Y) produce 2x2=4 combinations XY (both normal) XY (X normal, Y complemented) X Y (X complemented, Y normal) X Y (both complemented)
20 Maxterms Maxterms are OR terms with every variable in true or complemented form. X+Y (both normal) X+Y (x normal, y complemented) X +Y (x complemented, y normal) X +Y (both complemented)
21 Maxterms and Minterms Two variable minterms and maxterms. Index Minterm Maxterm x y x + y x y x + y 2 x y x + y 3 x y x + y The index above is important for describing which variables in the terms are true and which are complemented.
22 Minterms Variable complemented if Variable uncomplemented if m i indicated the i th minterm i indicates the binary combination m i is equal to for ONLY THAT combination
23 Maxterms Sum term : A term where literals are ORed. Example: x +y, x+z, x+y+z, Maxterm : a sum term in which all variables appear exactly once, in normal or complemented form Example: F(x,y,z) has 8 maxterms (x+y+z), (x+y+z ), (x+y +z),... Function with n variables has 2 n maxterms A maxterm equals at exactly one input combination and is equal to otherwize Example: (x+y+z) = only when x=, y=, z= A maxterm is denoted as M i where i corresponds the input combination at which this maxterm is equal to
24 Maxterms Variable complemented if Variable not complemented if M i indicated the i th maxterm i indicates the binary combination M i is equal to for ONLY THAT combination
25 Expressing Functions with Minterms Boolean function can be expressed algebraically from a give truth table Forming sum of ALL the minterms that produce in the function X Y Z m F Example : Consider the function m defined by the truth table m m 2 F(X,Y,Z)= X Y Z + X YZ + XY Z + m 3 XYZ m 4 = m + m 2 + m 5 + m 7 m 5 = m(, (257) 2, 5, m 6 m 7
26 Expressing Functions with Maxterms Boolean function : Expressed algebraically from a give truth table By forming logical product (AND) of ALL the maxterms that produce in the function Example: X Y Z M F F Consider the function defined by the truth table F(X,Y,Z) = Π M(,3,4,6) 2 Applying DeMorgan F =m +m 3 +m 4 + m 6 = m(346) m(,3,4,6) F = F = [m + m 3 + m 4 + m 6 ] = m.m 3.m 4.m 6 = M.M 3.M 4.M 6 are missing from the previous list in Σm(,2,5,7) = Π M(,3,4,6) X Y Z M F F M M M 2 M 3 M 4 M 5 M 6 M 7 Notethethe indicesinthislistarethose those that
27 Sum of Minterms vs Product of Maxterms A function can be expressed algebraically as: The sum of minterms The product of maxterms Given the truth table, writing F as m i for all minterms that produce in the table, or ΠM i for all maxterms that produce in the table Minterms and Maxterms are complement of each other.
28 Example: minterm & maxterm Write E = Y + X Z in the form of m i and ΠM i? Method First construct the Truth Table as shown E = m(245)and m(,,2,4,5), E = ΠM(3,6,7) X Y Z m M E m M m M m 2 M 2 m 3 M 3 m 4 M 4 m 5 M 5 m 6 M 6 m 7 M 7
29 Example (Cont.) Solution: Method2_a E = Y +X Z = Y (X+X )(Z+Z ) + Z (Y+Y ) = (XY +X Y )(Z+Z ) + X YZ + X Z Y = Y Z+X Y Z+XY Z +X Y Z + X YZ +X Z Y XYZ+XZY = m 5 + m + m 4 + m + m 2 + m = m + m + m 2 + m 4 + m 5 = m(,,2,4,5) To find the form ΠMi, consider the remaining indices E = ΠM(3,6,7) Solution: Method2_b E = Y +X Z E = Y(X+Z) = YX + YZ = YX(Z+Z ) + YZ(X+X ) = XYZ+XYZ +X YZ E = (X +Y +Z )(X +Y +Z)(X+Y +Z ) = M 7. M 6. M 3 = ΠM(3,6,7) To find the form Sm i, consider the remaining indices E = m(,,2,4,5)
30 Canonical Forms The sum of minterms and the product of maxterms forms are known as the canonical forms of a function.
31 Standard Forms Sum of Products (SOP) and Product of Sums (POS) are also standard forms AB+CD = (A+C)(B+C)(A+D)(B+D) ) The sum of minterms is a special case of the SOP form, where all product terms are minterms The product of maxterms is a special case of the POS form, where all sum terms are maxterms
32 SOP and POS Conversion SOP POS POS SOP F = AB + CD = (AB+C)(AB+D) = (A+C)(B+C)(AB+D) = (A+C)(B+C)(A+D)(B+D) ) Hint : Use id5: X+YZ=(X+Y)(X+Z) Hint 2: Factor F = (A +B)(A +C)(C+D) = (A +BC)(C+D) ) = A C+A D+BCC+BCD = A C+A D+BC+BCD = A C+A D+BC Hint : Use id5 (X+Y)(X+Z)=X+YZX+YZ Hint 2: Multiply
33 Thanks 33
CSEE 3827: Fundamentals of Computer Systems. Standard Forms and Simplification with Karnaugh Maps
CSEE 3827: Fundamentals of Computer Systems Standard Forms and Simplification with Karnaugh Maps Agenda (M&K 2.3-2.5) Standard Forms Product-of-Sums (PoS) Sum-of-Products (SoP) converting between Min-terms
More informationKarnaugh Maps. Circuit-wise, this leads to a minimal two-level implementation
Karnaugh Maps Applications of Boolean logic to circuit design The basic Boolean operations are AND, OR and NOT These operations can be combined to form complex expressions, which can also be directly translated
More informationBoolean Algebra Part 1
Boolean Algebra Part 1 Page 1 Boolean Algebra Objectives Understand Basic Boolean Algebra Relate Boolean Algebra to Logic Networks Prove Laws using Truth Tables Understand and Use First Basic Theorems
More informationBoolean Algebra. Boolean Algebra. Boolean Algebra. Boolean Algebra
2 Ver..4 George Boole was an English mathematician of XIX century can operate on logic (or Boolean) variables that can assume just 2 values: /, true/false, on/off, closed/open Usually value is associated
More informationBoolean Algebra (cont d) UNIT 3 BOOLEAN ALGEBRA (CONT D) Guidelines for Multiplying Out and Factoring. Objectives. Iris Hui-Ru Jiang Spring 2010
Boolean Algebra (cont d) 2 Contents Multiplying out and factoring expressions Exclusive-OR and Exclusive-NOR operations The consensus theorem Summary of algebraic simplification Proving validity of an
More informationBOOLEAN ALGEBRA & LOGIC GATES
BOOLEAN ALGEBRA & LOGIC GATES Logic gates are electronic circuits that can be used to implement the most elementary logic expressions, also known as Boolean expressions. The logic gate is the most basic
More informationKarnaugh Maps & Combinational Logic Design. ECE 152A Winter 2012
Karnaugh Maps & Combinational Logic Design ECE 52A Winter 22 Reading Assignment Brown and Vranesic 4 Optimized Implementation of Logic Functions 4. Karnaugh Map 4.2 Strategy for Minimization 4.2. Terminology
More informationCH3 Boolean Algebra (cont d)
CH3 Boolean Algebra (cont d) Lecturer: 吳 安 宇 Date:2005/10/7 ACCESS IC LAB v Today, you ll know: Introduction 1. Guidelines for multiplying out/factoring expressions 2. Exclusive-OR and Equivalence operations
More informationUnit 3 Boolean Algebra (Continued)
Unit 3 Boolean Algebra (Continued) 1. Exclusive-OR Operation 2. Consensus Theorem Department of Communication Engineering, NCTU 1 3.1 Multiplying Out and Factoring Expressions Department of Communication
More informationChapter 2: Boolean Algebra and Logic Gates. Boolean Algebra
The Universit Of Alabama in Huntsville Computer Science Chapter 2: Boolean Algebra and Logic Gates The Universit Of Alabama in Huntsville Computer Science Boolean Algebra The algebraic sstem usuall used
More informationCSE140: Components and Design Techniques for Digital Systems
CSE4: Components and Design Techniques for Digital Systems Tajana Simunic Rosing What we covered thus far: Number representations Logic gates Boolean algebra Introduction to CMOS HW#2 due, HW#3 assigned
More information1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1.
File: chap04, Chapter 04 1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1. 2. True or False? A gate is a device that accepts a single input signal and produces one
More informationCSE140: Midterm 1 Solution and Rubric
CSE140: Midterm 1 Solution and Rubric April 23, 2014 1 Short Answers 1.1 True or (6pts) 1. A maxterm must include all input variables (1pt) True 2. A canonical product of sums is a product of minterms
More informationSwitching Algebra and Logic Gates
Chapter 2 Switching Algebra and Logic Gates The word algebra in the title of this chapter should alert you that more mathematics is coming. No doubt, some of you are itching to get on with digital design
More informationUnited States Naval Academy Electrical and Computer Engineering Department. EC262 Exam 1
United States Naval Academy Electrical and Computer Engineering Department EC262 Exam 29 September 2. Do a page check now. You should have pages (cover & questions). 2. Read all problems in their entirety.
More informationLogic in Computer Science: Logic Gates
Logic in Computer Science: Logic Gates Lila Kari The University of Western Ontario Logic in Computer Science: Logic Gates CS2209, Applied Logic for Computer Science 1 / 49 Logic and bit operations Computers
More information2.0 Chapter Overview. 2.1 Boolean Algebra
Thi d t t d ith F M k 4 0 2 Boolean Algebra Chapter Two Logic circuits are the basis for modern digital computer systems. To appreciate how computer systems operate you will need to understand digital
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 informationLogic Reference Guide
Logic eference Guide Advanced Micro evices INTOUCTION Throughout this data book and design guide we have assumed that you have a good working knowledge of logic. Unfortunately, there always comes a time
More informationChapter 5. Rational Expressions
5.. Simplify Rational Expressions KYOTE Standards: CR ; CA 7 Chapter 5. Rational Expressions Definition. A rational expression is the quotient P Q of two polynomials P and Q in one or more variables, where
More informationCM2202: Scientific Computing and Multimedia Applications General Maths: 2. Algebra - Factorisation
CM2202: Scientific Computing and Multimedia Applications General Maths: 2. Algebra - Factorisation Prof. David Marshall School of Computer Science & Informatics Factorisation Factorisation is a way of
More informationGates, Circuits, and Boolean Algebra
Gates, Circuits, and Boolean Algebra Computers and Electricity A gate is a device that performs a basic operation on electrical signals Gates are combined into circuits to perform more complicated tasks
More informationSection 1. Finding Common Terms
Worksheet 2.1 Factors of Algebraic Expressions Section 1 Finding Common Terms In worksheet 1.2 we talked about factors of whole numbers. Remember, if a b = ab then a is a factor of ab and b is a factor
More informationDigital Logic Design
Digital Logic Design Version 4.6 printed on February 2016 First published on August 2006 Background and Acknowledgements This material has been developed for the first course in Digital Logic Design. The
More informationCombinational circuits
Combinational circuits Combinational circuits are stateless The outputs are functions only of the inputs Inputs Combinational circuit Outputs 3 Thursday, September 2, 3 Enabler Circuit (High-level view)
More informationCDA 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 Multi-Level Gate Circuits NAND and NOR Gates Design of Two-Level Circuits Using NAND and NOR Gates
More informationBinary Adders: Half Adders and Full Adders
Binary Adders: Half Adders and Full Adders In this set of slides, we present the two basic types of adders: 1. Half adders, and 2. Full adders. Each type of adder functions to add two binary bits. In order
More informationBasic Logic Gates Richard E. Haskell
BASIC LOGIC GATES 1 E Basic Logic Gates Richard E. Haskell All digital systems are made from a few basic digital circuits that we call logic gates. These circuits perform the basic logic functions that
More informationDigital circuits make up all computers and computer systems. The operation of digital circuits is based on
Digital Logic Circuits Digital circuits make up all computers and computer systems. The operation of digital circuits is based on Boolean algebra, the mathematics of binary numbers. Boolean algebra is
More informationFACTORING ax 2 bx c. Factoring Trinomials with Leading Coefficient 1
5.7 Factoring ax 2 bx c (5-49) 305 5.7 FACTORING ax 2 bx c In this section In Section 5.5 you learned to factor certain special polynomials. In this section you will learn to factor general quadratic polynomials.
More informationTwo-level logic using NAND gates
CSE140: Components and Design Techniques for Digital Systems Two and Multilevel logic implementation Tajana Simunic Rosing 1 Two-level logic using NND gates Replace minterm ND gates with NND gates Place
More informationDESIGN OF GATE NETWORKS
DESIGN OF GATE NETWORKS DESIGN OF TWO-LEVEL NETWORKS: and-or and or-and NETWORKS MINIMAL TWO-LEVEL NETWORKS KARNAUGH MAPS MINIMIZATION PROCEDURE AND TOOLS LIMITATIONS OF TWO-LEVEL NETWORKS DESIGN OF TWO-LEVEL
More informationFINDING THE LEAST COMMON DENOMINATOR
0 (7 18) Chapter 7 Rational Expressions GETTING MORE INVOLVED 7. Discussion. Evaluate each expression. a) One-half of 1 b) One-third of c) One-half of x d) One-half of x 7. Exploration. Let R 6 x x 0 x
More informationBEGINNING ALGEBRA ACKNOWLEDMENTS
BEGINNING ALGEBRA The Nursing Department of Labouré College requested the Department of Academic Planning and Support Services to help with mathematics preparatory materials for its Bachelor of Science
More informationDigital Logic Design. Basics Combinational Circuits Sequential Circuits. Pu-Jen Cheng
Digital Logic Design Basics Combinational Circuits Sequential Circuits Pu-Jen Cheng Adapted from the slides prepared by S. Dandamudi for the book, Fundamentals of Computer Organization and Design. Introduction
More informationCHAPTER 3 Boolean Algebra and Digital Logic
CHAPTER 3 Boolean Algebra and Digital Logic 3.1 Introduction 121 3.2 Boolean Algebra 122 3.2.1 Boolean Expressions 123 3.2.2 Boolean Identities 124 3.2.3 Simplification of Boolean Expressions 126 3.2.4
More informationCOMPUTER SCIENCE. Paper 1 (THEORY)
COMPUTER SCIENCE Paper 1 (THEORY) (Three hours) Maximum Marks: 70 (Candidates are allowed additional 15 minutes for only reading the paper. They must NOT start writing during this time) -----------------------------------------------------------------------------------------------------------------------
More informationFactoring Polynomials
Factoring Polynomials 4-1-2014 The opposite of multiplying polynomials is factoring. Why would you want to factor a polynomial? Let p(x) be a polynomial. p(c) = 0 is equivalent to x c dividing p(x). Recall
More informationElementary Logic Gates
Elementary Logic Gates Name Symbol Inverter (NOT Gate) ND Gate OR Gate Truth Table Logic Equation = = = = = + C. E. Stroud Combinational Logic Design (/6) Other Elementary Logic Gates NND Gate NOR Gate
More informationFactoring - Grouping
6.2 Factoring - Grouping Objective: Factor polynomials with four terms using grouping. The first thing we will always do when factoring is try to factor out a GCF. This GCF is often a monomial like in
More informationDefinitions 1. A factor of integer is an integer that will divide the given integer evenly (with no remainder).
Math 50, Chapter 8 (Page 1 of 20) 8.1 Common Factors Definitions 1. A factor of integer is an integer that will divide the given integer evenly (with no remainder). Find all the factors of a. 44 b. 32
More informationGates & Boolean Algebra. Boolean Operators. Combinational Logic. Introduction
Introduction Gates & Boolean lgebra Boolean algebra: named after mathematician George Boole (85 864). 2-valued algebra. digital circuit can have one of 2 values. Signal between and volt =, between 4 and
More informationexclusive-or and Binary Adder R eouven Elbaz reouven@uwaterloo.ca Office room: DC3576
exclusive-or and Binary Adder R eouven Elbaz reouven@uwaterloo.ca Office room: DC3576 Outline exclusive OR gate (XOR) Definition Properties Examples of Applications Odd Function Parity Generation and Checking
More informationHow To Factor By Gcf In Algebra 1.5
7-2 Factoring by GCF Warm Up Lesson Presentation Lesson Quiz Algebra 1 Warm Up Simplify. 1. 2(w + 1) 2. 3x(x 2 4) 2w + 2 3x 3 12x Find the GCF of each pair of monomials. 3. 4h 2 and 6h 2h 4. 13p and 26p
More information1.4. Arithmetic of Algebraic Fractions. Introduction. Prerequisites. Learning Outcomes
Arithmetic of Algebraic Fractions 1.4 Introduction Just as one whole number divided by another is called a numerical fraction, so one algebraic expression divided by another is known as an algebraic fraction.
More informationChapter 1. Computation theory
Chapter 1. Computation theory In this chapter we will describe computation logic for the machines. This topic is a wide interdisciplinary field, so that the students can work in an interdisciplinary context.
More informationSPECIAL PRODUCTS AND FACTORS
CHAPTER 442 11 CHAPTER TABLE OF CONTENTS 11-1 Factors and Factoring 11-2 Common Monomial Factors 11-3 The Square of a Monomial 11-4 Multiplying the Sum and the Difference of Two Terms 11-5 Factoring the
More information1.5. Factorisation. Introduction. Prerequisites. Learning Outcomes. Learning Style
Factorisation 1.5 Introduction In Block 4 we showed the way in which brackets were removed from algebraic expressions. Factorisation, which can be considered as the reverse of this process, is dealt with
More informationUnderstanding Logic Design
Understanding Logic Design ppendix of your Textbook does not have the needed background information. This document supplements it. When you write add DD R0, R1, R2, you imagine something like this: R1
More informationFACTORING POLYNOMIALS
296 (5-40) Chapter 5 Exponents and Polynomials where a 2 is the area of the square base, b 2 is the area of the square top, and H is the distance from the base to the top. Find the volume of a truncated
More informationHow To Solve Factoring Problems
05-W4801-AM1.qxd 8/19/08 8:45 PM Page 241 Factoring, Solving Equations, and Problem Solving 5 5.1 Factoring by Using the Distributive Property 5.2 Factoring the Difference of Two Squares 5.3 Factoring
More information3.Basic Gate Combinations
3.Basic Gate Combinations 3.1 TTL NAND Gate In logic circuits transistors play the role of switches. For those in the TTL gate the conducting state (on) occurs when the baseemmiter signal is high, and
More informationLecture 5: Gate Logic Logic Optimization
Lecture 5: Gate Logic Logic Optimization MAH, AEN EE271 Lecture 5 1 Overview Reading McCluskey, Logic Design Principles- or any text in boolean algebra Introduction We could design at the level of irsim
More informationLecture 2 Matrix Operations
Lecture 2 Matrix Operations transpose, sum & difference, scalar multiplication matrix multiplication, matrix-vector product matrix inverse 2 1 Matrix transpose transpose of m n matrix A, denoted A T or
More informationSect 6.1 - Greatest Common Factor and Factoring by Grouping
Sect 6.1 - Greatest Common Factor and Factoring by Grouping Our goal in this chapter is to solve non-linear equations by breaking them down into a series of linear equations that we can solve. To do this,
More informationA Course Material on DIGITAL PRINCIPLES AND SYSTEM DESIGN
A Course Material on By MS.G.MANJULA ASSISTANT PROFESSOR DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING SASURIE COLLEGE OF ENGINEERING VIJAYAMANGALAM 638 56 QUALITY CERTIFICATE This is to certify
More information1.3 Polynomials and Factoring
1.3 Polynomials and Factoring Polynomials Constant: a number, such as 5 or 27 Variable: a letter or symbol that represents a value. Term: a constant, variable, or the product or a constant and variable.
More informationA single register, called the accumulator, stores the. operand before the operation, and stores the result. Add y # add y from memory to the acc
Other architectures Example. Accumulator-based machines A single register, called the accumulator, stores the operand before the operation, and stores the result after the operation. Load x # into acc
More informationScilab Textbook Companion for Digital Electronics: An Introduction To Theory And Practice by W. H. Gothmann 1
Scilab Textbook Companion for Digital Electronics: An Introduction To Theory And Practice by W. H. Gothmann 1 Created by Aritra Ray B.Tech Electronics Engineering NIT-DURGAPUR College Teacher Prof. Sabyasachi
More informationFactoring Flow Chart
Factoring Flow Chart greatest common factor? YES NO factor out GCF leaving GCF(quotient) how many terms? 4+ factor by grouping 2 3 difference of squares? perfect square trinomial? YES YES NO NO a 2 -b
More informationFactoring Quadratic Expressions
Factoring the trinomial ax 2 + bx + c when a = 1 A trinomial in the form x 2 + bx + c can be factored to equal (x + m)(x + n) when the product of m x n equals c and the sum of m + n equals b. (Note: the
More information( ) FACTORING. x In this polynomial the only variable in common to all is x.
FACTORING Factoring is similar to breaking up a number into its multiples. For example, 10=5*. The multiples are 5 and. In a polynomial it is the same way, however, the procedure is somewhat more complicated
More informationRotation Matrices and Homogeneous Transformations
Rotation Matrices and Homogeneous Transformations A coordinate frame in an n-dimensional space is defined by n mutually orthogonal unit vectors. In particular, for a two-dimensional (2D) space, i.e., n
More informationFactoring Guidelines. Greatest Common Factor Two Terms Three Terms Four Terms. 2008 Shirley Radai
Factoring Guidelines Greatest Common Factor Two Terms Three Terms Four Terms 008 Shirley Radai Greatest Common Factor 008 Shirley Radai Factoring by Finding the Greatest Common Factor Always check for
More informationTim Kerins. Leaving Certificate Honours Maths - Algebra. Tim Kerins. the date
Leaving Certificate Honours Maths - Algebra the date Chapter 1 Algebra This is an important portion of the course. As well as generally accounting for 2 3 questions in examination it is the basis for many
More information5.1 FACTORING OUT COMMON FACTORS
C H A P T E R 5 Factoring he sport of skydiving was born in the 1930s soon after the military began using parachutes as a means of deploying troops. T Today, skydiving is a popular sport around the world.
More informationNegative Integer Exponents
7.7 Negative Integer Exponents 7.7 OBJECTIVES. Define the zero exponent 2. Use the definition of a negative exponent to simplify an expression 3. Use the properties of exponents to simplify expressions
More informationClick on the links below to jump directly to the relevant section
Click on the links below to jump directly to the relevant section What is algebra? Operations with algebraic terms Mathematical properties of real numbers Order of operations What is Algebra? Algebra is
More informationC H A P T E R. Logic Circuits
C H A P T E R Logic Circuits Many important functions are naturally computed with straight-line programs, programs without loops or branches. Such computations are conveniently described with circuits,
More informationFactoring - Greatest Common Factor
6.1 Factoring - Greatest Common Factor Objective: Find the greatest common factor of a polynomial and factor it out of the expression. The opposite of multiplying polynomials together is factoring polynomials.
More informationNSM100 Introduction to Algebra Chapter 5 Notes Factoring
Section 5.1 Greatest Common Factor (GCF) and Factoring by Grouping Greatest Common Factor for a polynomial is the largest monomial that divides (is a factor of) each term of the polynomial. GCF is the
More informationDEPARTMENT OF INFORMATION TECHNLOGY
DRONACHARYA GROUP OF INSTITUTIONS, GREATER NOIDA Affiliated to Mahamaya Technical University, Noida Approved by AICTE DEPARTMENT OF INFORMATION TECHNLOGY Lab Manual for Computer Organization Lab ECS-453
More informationAIP Factoring Practice/Help
The following pages include many problems to practice factoring skills. There are also several activities with examples to help you with factoring if you feel like you are not proficient with it. There
More informationAlgebra 1 Chapter 08 review
Name: Class: Date: ID: A Algebra 1 Chapter 08 review Multiple Choice Identify the choice that best completes the statement or answers the question. Simplify the difference. 1. (4w 2 4w 8) (2w 2 + 3w 6)
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More information#6 Opener Solutions. Move one more spot to your right. Introduce yourself if needed.
1. Sit anywhere in the concentric circles. Do not move the desks. 2. Take out chapter 6, HW/notes #1-#5, a pencil, a red pen, and your calculator. 3. Work on opener #6 with the person sitting across from
More informationCOMPUTER SCIENCE 1999 (Delhi Board)
COMPUTER SCIENCE 1999 (Delhi Board) Time allowed: 3 hours Max. Marks: 70 Instructions: (i) All the questions are compulsory. (ii) Programming Language: C++ QUESTION l. (a) Why main function is special?
More information~ EQUIVALENT FORMS ~
~ EQUIVALENT FORMS ~ Critical to understanding mathematics is the concept of equivalent forms. Equivalent forms are used throughout this course. Throughout mathematics one encounters equivalent forms of
More informationFactoring Methods. Example 1: 2x + 2 2 * x + 2 * 1 2(x + 1)
Factoring Methods When you are trying to factor a polynomial, there are three general steps you want to follow: 1. See if there is a Greatest Common Factor 2. See if you can Factor by Grouping 3. See if
More information7-6. Choosing a Factoring Model. Extension: Factoring Polynomials with More Than One Variable IN T RO DUC E T EACH. Standards for Mathematical Content
7-6 Choosing a Factoring Model Extension: Factoring Polynomials with More Than One Variable Essential question: How can you factor polynomials with more than one variable? What is the connection between
More informationFactoring (pp. 1 of 4)
Factoring (pp. 1 of 4) Algebra Review Try these items from middle school math. A) What numbers are the factors of 4? B) Write down the prime factorization of 7. C) 6 Simplify 48 using the greatest common
More informationFACTORING OUT COMMON FACTORS
278 (6 2) Chapter 6 Factoring 6.1 FACTORING OUT COMMON FACTORS In this section Prime Factorization of Integers Greatest Common Factor Finding the Greatest Common Factor for Monomials Factoring Out the
More informationFORDHAM UNIVERSITY CISC 3593. Dept. of Computer and Info. Science Spring, 2011. Lab 2. The Full-Adder
FORDHAM UNIVERSITY CISC 3593 Fordham College Lincoln Center Computer Organization Dept. of Computer and Info. Science Spring, 2011 Lab 2 The Full-Adder 1 Introduction In this lab, the student will construct
More information6.5 Factoring Special Forms
440 CHAPTER 6. FACTORING 6.5 Factoring Special Forms In this section we revisit two special product forms that we learned in Chapter 5, the first of which was squaring a binomial. Squaring a binomial.
More informationFactoring Polynomials
UNIT 11 Factoring Polynomials You can use polynomials to describe framing for art. 396 Unit 11 factoring polynomials A polynomial is an expression that has variables that represent numbers. A number can
More informationENGI 241 Experiment 5 Basic Logic Gates
ENGI 24 Experiment 5 Basic Logic Gates OBJECTIVE This experiment will examine the operation of the AND, NAND, OR, and NOR logic gates and compare the expected outputs to the truth tables for these devices.
More informationFactoring - Factoring Special Products
6.5 Factoring - Factoring Special Products Objective: Identify and factor special products including a difference of squares, perfect squares, and sum and difference of cubes. When factoring there are
More informationLecture 12: More on Registers, Multiplexers, Decoders, Comparators and Wot- Nots
Lecture 12: More on Registers, Multiplexers, Decoders, Comparators and Wot- Nots Registers As you probably know (if you don t then you should consider changing your course), data processing is usually
More informationIntroduction. The Quine-McCluskey Method Handout 5 January 21, 2016. CSEE E6861y Prof. Steven Nowick
CSEE E6861y Prof. Steven Nowick The Quine-McCluskey Method Handout 5 January 21, 2016 Introduction The Quine-McCluskey method is an exact algorithm which finds a minimum-cost sum-of-products implementation
More informationMatrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws.
Matrix Algebra A. Doerr Before reading the text or the following notes glance at the following list of basic matrix algebra laws. Some Basic Matrix Laws Assume the orders of the matrices are such that
More informationCombinational Logic Design
Chapter 4 Combinational Logic Design The foundations for the design of digital logic circuits were established in the preceding chapters. The elements of Boolean algebra (two-element switching algebra
More informationName Intro to Algebra 2. Unit 1: Polynomials and Factoring
Name Intro to Algebra 2 Unit 1: Polynomials and Factoring Date Page Topic Homework 9/3 2 Polynomial Vocabulary No Homework 9/4 x In Class assignment None 9/5 3 Adding and Subtracting Polynomials Pg. 332
More informationFORDHAM UNIVERSITY CISC 3593. Dept. of Computer and Info. Science Spring, 2011. The Binary Adder
FORDHAM UNIVERITY CIC 3593 Fordham College Lincoln Center Computer Organization Dept. of Computer and Info. cience pring, 2011 1 Introduction The Binar Adder The binar adder circuit is an important building
More informationLinear and quadratic Taylor polynomials for functions of several variables.
ams/econ 11b supplementary notes ucsc Linear quadratic Taylor polynomials for functions of several variables. c 010, Yonatan Katznelson Finding the extreme (minimum or maximum) values of a function, is
More information15.1 Factoring Polynomials
LESSON 15.1 Factoring Polynomials Use the structure of an expression to identify ways to rewrite it. Also A.SSE.3? ESSENTIAL QUESTION How can you use the greatest common factor to factor polynomials? EXPLORE
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationIn algebra, factor by rewriting a polynomial as a product of lower-degree polynomials
Algebra 2 Notes SOL AII.1 Factoring Polynomials Mrs. Grieser Name: Date: Block: Factoring Review Factor: rewrite a number or expression as a product of primes; e.g. 6 = 2 3 In algebra, factor by rewriting
More informationGröbner Bases and their Applications
Gröbner Bases and their Applications Kaitlyn Moran July 30, 2008 1 Introduction We know from the Hilbert Basis Theorem that any ideal in a polynomial ring over a field is finitely generated [3]. However,
More information