TitleLogic Functions over Galois.
|
|
- Alexander Evans
- 5 years ago
- Views:
Transcription
1 TitleLogic Functions over Galois Field G Author(s) Nakao, Zensho Citation 琉球大学工学部紀要 (9): Issue Date 985- URL Rights
2 Bull. Faculty of E?igineering, Univ. of the Ryukyus, No.9, Logic Functions over Galois Field GF(4) Zensho NAKAO* Abstract The elements of Galois field GF(4) are represented by four numerals {,,, }; it is shown that all quaternary logic functions can be expressed in a sort of standard form as polynomial functions over GF(4); the two field operators of GF(4) are proposed as basic logic gates and are used as basic building blocks in the representation of the logic functions.. Introduction In recent papers, Hachimine and Zukeran [HZ] proposed a set of four-valued logic functions and demonstrated the completeness of the system; they also designed several quaternary logic circuits [HZ]. The objective of this note is to show that how Galois field GF(4) (i.e., a finite field of four elements) can be used effectively to represent quaternary logic functions such as the ones studied in [HZ, HZ] in standard polynominal forms as was done in [Nl, NZK].. Preliminaries The set A = {, } of two symbols, can be made into a Boolean algebra by furnishing it with two binary operations V, A and one unary operation ~ which are defined by the following (truth) tables: V A X X Table. Boolean operators On A, introduce two binary operations +, (or juxtaposition) by the (truth) tables: + Table. Field operators Received: October, 984 Department of Electronics Engineering and Computer Science
3 48 Logic Functions over Galois Field GF(4) : NAKAO The algebraic operations now transform the structure on A into that of Galois field GF(). In fact, the Boolean algebraic structure (A; V, A, ~) and the field structure (GF(); +, ) are related by the following transformation formulas: () x A y =xy x V y- x + y + xy x=x + l xy = x A y x + y = (x A V (jc A y) Since GF() is a field, the operations in Table define subtraction and division implicitly (name ly, the charts are used backward), which are the operations impossible in the Boolean algebra A. Also, it is known in field theory that we can ajways enlarge GF() to the extension field GF(n) (n is a natural number) which possesses exactly n elements by adjoining a zero of some irreducible polynomial over GF(). In this note we let n = and use GF(4) in studying A4 = {,,, } with a quaternary logic structure. We can obtain GF(4) as the splitting field of the irreducible polynomial p(x) = x + x + over GF() by adjoining a solution a of p(x) = in an extension field of GF(). Since GF(4) is a two dimensional vector field over GF() with the base {, a}, where a = a +, GF(4) has four elements,, a, a +. For ease of reference and computation, we introduce two numerals and, and let a = and a + = ; we obtain the following addition and multiplication tables which are in fact the truth tables for the binary operations: + Table. Field operators Recall that (GF(4); +) is Klein's Viergruppe (hence, not cyclic), and that (GF(4) - {}; ) is a cyclic group of order ; both are Abelian (i.e., the tables are symmetric with respect to the main diagonal). It is to be noted that there are quaternary logic functions on A4 which cannot be expressed as standard Boolean functions, i.e., (A4; V, A, ~) is not a complete system. In the rest of the section, we quote the necessary results from Galois theory: () (* + y) = x + y V x, y G GF(4) () x+x = Vx GF(4) Any function from a finite field into itself is known to be a polymomial function (use Lagrange's interpolation formula, for example); the following results give us the necessary formulas for our specific purpose [T]:
4 Bull, faculty of Engineering, Univ. of the Ryukyus, Nq9, (4) Iff:GF(4) GF(4): > GF(4) is a function, then f can be expressed in a polynomial form over f(x) = a + ajx + ax + ax, where a = f(), a, = x^x), ( <. i <. ). xfc w ifl) (5) If f: GF(4) x GF(4) >GF(4) is a mapping, then f can be realized as a polynomial mapping over GF(4) in two variables: f(x,y)= ajjxv, i,k where a = f(,), ai = ^^x^x, ), aoi = ^(, y), Note that in formulas (4) and (5) above, all calculations must be done in Galois field GF(4), and also that (5) can be generalized to mappings f:gf(4)n >GF(4) of n (> ) variables. With this rigid structure, we will be able to express all quaternary logic func tions as polynomial functions on GF(4) or GF(4) (or GF(4)n, if necessary) of total degree at most 6.. Translation of A4 to GF(4) It is proved that (MIN, MAX,x{>),,) forms a complete system of quaternary logic functions in [HZ]; we are going to express all those quaternary logic functions explicitly as polynomials over GF(4), which is a consequence of the evident fact that (GF(4); +, ) is another complete system of quaternary logic functions. The BASIC programs used are included in the Appendix. a. MIN[x, y] Operation tables for the binary operators MIN[x, y] and MAX[x, y] are given below: min MAX Table 4. MIN and MAX operators
5 5 Logic Functions over Galois Field GF(4) : NAKAO By using formulas for a^ in (5), we can obtain the following results: ao = aoj = a = a = a = a = ao = al = a = a =, a = a = a = a =, a = a = Thus we get a polynomial expression for MINfx, y]: (7) MIN[x, y] = xy + xy + xy + xy + xy + xy + xy By using () and collecting like terms, we can change MlN[x, y] into a less formidable poly nomial in elementary symmetric functions (x + y) and (xy): (8) MIN[x,y] = xy {(x + y) + (x + y)+xy[l+(x + y)]} b. MAX[x, y] Computing similarly as in MIN[x, y], we can derive the following results: (9) ao ~ a " ao = ao = a ~ an = a =, a = a = aoi = aio = a =, a = a = aj = a = Therefore, a polynomial expression for MAX[x, y] is: () MAX[x, y] = x + y + xy + xy + xy + xy + xy + xy + xy Rewriting the result above as a polynomial in (x + y) and (xy), we get: () MAX[x, y] = (x + y) + xy [(x + y) + (x + y) + xy + xy(x + y)] c. x {') The unary operator x{*} is defined by: () A truth table for the operator is given below: = otherwise X X< '> Table 5. Truth table for x{') Repeated applications of the formulas for a{ in (4) yield: O) aft= a = fl -, -n do ^» *i -l, a-, a = Hence, we obtain a polynomial function for x{(}:
6 Bull. Faculty of Engineering, Unit), of the Ryukyus, No.9,985 5 Putting pieces obtained together, we demonstrated that the algebraic structure (GF(4); +, ) provides an effective method for deriving standard forms of the quaternary logic functions. 4. Other translations For completeness of presentation, we include the polynomial formulas for the binary operator NOR[x, y]; the unary operators (k)x and xw which are discussed in [HZ]. Their definitions follow: (5) NOR[x,y] =+MAX[x,y] (6) (k>x=x + k(mod4), k =,,, (7) x(k) = ifx = k k =,,, = otherwise Polynomial representations for the operators are given in the following: NR[x,y] =+MAX[x,y] = + (x + y) + xy [(x + y) + (x + y) + xy + xy(x + y)] (9) (k>x = (x+k) + xk[+(x+k) + xk], k=,,, () x<k> = [l+(x + k)], k =,,, 5. Conclusions We found that all quaternary logic functions of one or two variables can be realized as poly nomial functions over Galois field GF(4) in one or two variables of total degree at most 6. An obvious advantage for having polynomial expressions is that we can formally manipulate the elements of A4, i.e., GF(4) with four arithmetic operations of GF(4) itself as we normally do with the real (or complex) number field. If we can design (x + y) and (xy) as basic logic circuit elements*, then we can easily construct other circuits such as MIN, MAX, x{'}, NOR, ^>x and xw. For illustration, take MIN, MAX and x{o,} We introduce two logic gate symbols for the operators (x + y) and (xy): (x + y)= Figure. Circuit symbols for (x + y) and (xy) Then the following diagrams present one possible design for each function: *The logic circuit elements were designed by Mr. Chotei Zukeran, Department of Electrical Engine ering, Ryukyu University; and are included as Figures in the Appendix.
7 5 Logic Functions over Galois Field GF(4) : NAKAO MIN[x,y] Figure. MIN[x, y] gate MAX[x,y] Figure. MAX[x, y] gate r{,} Figure 4. Logic gate for x{'} Some properties of quanternary logic functions over GF(4) will be discussed further in the forth coming paper [N].
8 Bull. Faculty of Engineering, Univ. of the Ryukyus, Na9,985,5 References [HZ] Hachimine, G and Zukeran, C: A proposal for a complete set of four valued logic func tions and its circuit construction, Trans. IECE (Japanese), 98, pp. 9-. [HZ] : Construction of quaternary logic functions, Trans IECE (Japanese), 98, pp. -8. [Nl] Nakao, Z: A field-theoretic view of logic functions, Bull. Faculty of Engineering, Univ. of the Ryukyus, No. 8,984, pp [N] : Vector-valued representation of quaternary logic functions over Galois field GF(4) (Pre-print). [NZK] Nakao, Z, Zukeran, C and Kyan, S: Quaternary logic functions over Galois field GF(4) (Pre-print). [T] Takahashi, I: Combinatorics and its applications (Japanese), Iwanami 979, pp
9 54 Logic Functions over Galois Field GF(4) : NAKAO Appendix a. BASIC programs PR#: REM Printer off HOME 4 DIMM(,),A(,),B(),F() 6 FOR I = TO 8 FOR J = TO READ M(I, J): REM Define multiplication NEXT J 4 NEXT I 6 DATA,,,,,,,,,,,,,,, 8 FOR I = TO FOR J = TO READ A(I, J): REM Define addition 4 NEXT J 6 NEXT I 8 DATA,,,,,,,,,,,,,,, 4 HOME 4 PRINT "Type in: f(), f(l), f(), f()" 44 PRINT 46 FOR X = TO 48 INPUT F(X): REM Define the logic function 5 NEXT X 5 PRINT 54 PRINT "Hit any key to continue"; 56 GET A$ 58 HOME 6 PR#: REM Printer on 6 PRINT : REM Display the function table 64 PRINT "x"; " >"; "f(x)" 66 PRINT 68 FOR X = TO 7 PRINT X; " >"; F(x) 7 NEXT X 74 PR#: REM Printer off 76 PRINT 78 REM The coefficients are determined 8 B() = F() 8 B(l) = 84 FORX=TO 86 I = M(X,X) 88 J = M(I, F(X))
10 Butt. Faculty.of Engineering, Univ. of the Ryukyus, Na9, NEXT X 94 B() = 96 FOR X = TO 98 J=M(X, F(X)) B()=A(B(),J) NEXTX 4 B()= 6 FORX = TO 8 J = F(X) B() = A(B(), J) NEXTX 4 REM Output the result in polynomial form 6 PR# : REM Printer on 8 PRINT "f(x)="; B(); "+"; B(l); "x+"; B(); "xx+"; B(); "xxx" PRINT PR# : REM Printer off 4 PRINT "Continue=anykey;Stop=Q"; 6 GET A$ 8 IF A$ = "Q" THEN GOTO 4 END PR#: REM Printer off HOME 4 DIM M(, ), A(, ), B(, ), F(, ) 6 FOR = TO 8 FORJ = TO READ M(I, J): REM Define multiplication NEXT J 4 NEXT I 6 DATA,,,,,,,,,,,,,,-, 8 FOR I = TO FOR J = TO READ A(I, J): REM Define addition 4 NEXT J 6 NEXT I 8 DATA,,,,,,,,,,,,,,, 4 HOME 4 PRINT "Type in: f(, ), f(, ), f(, ), f(,), f(l, ), f(l, ), f(l, ), f(l, ), f(,), 44 PRINT f(, ), f(,), f(,), f(,), f(,), f(,), f(,)"
11 56 Logic Functions over Galois Field GF('l) : NAKAO 46 FOR I = TO 48 FOR J = TO 5 INPUT F(I, J): REM Define the logic function 5 NEXT J 54 NEXT I 56 PRINT 58 PRINT "Hit any key to continue"; 6 GET AS 6 HOME 64 PR# : REM Printer on 66 PRINT : REM Display the function table 68 PRINT "(x, y)";" >"; "f(x, y)" 7 PRINT 7 FOR I = TO 74 FOR J = TO 76 print "(";i;v;j;")";" >";F(i,j) 78 NEXT J 8 NEXT I 8 PR# : REM Printer off 84 PRINT 86 REM The coefficients are determined 88 B(,O) = F(,O) 9 B(,) = : B(,) = O 9 FORX = TO 94 I = M(X,X) 96 J = MO, F(X,' )): K = M(I, F(, X)) 98 B(l, ) = A(B(, ), J): B(,) = A (B(,), K) NEXT X B(,) = : B(,)= 4 FORX = TO 6 J = M(X, F(X, )): K = M (X, F(, X)) 8 B(, ) = A(B(, ), J): B(,) = A(B(,), K) NEXTX B(,)=: B(,)= 4 FORX = TO 6 J = F(X,): K = F(,X) 8 B(, ) = A(B(, ), J): B(,) = A(B(,), K) NEXTX B(l,l) = 4 FORX = TO 6 FORY = TO 8 I = M(X,X): I = M(Y,Y)
12 Bull. Faculty of Engineering, Univ. of the Ryukyus, No.9, J=M(I,I): J = M(J,F(X,Y)) B(l, ) = A(B(,),J) 4 NEXTY 6 NEXT X 8 B(l,) = : B(,l) = 4 FORX=TO 4 FORY = TO 44 = M(X, X): = Y: Kl = X: K = M(Y, Y) 46 Jl = M(I,): J = M(J, F(X, Y)) 48 LI = M(K, K): L = M(L, F(X, Y)) 5 B(l,)= A(B(,),J);B(, ) = A(B(, ), L) 5 NEXTY 54 NEXTX 56 B(l,) = : B(, ) = 58 FORX=TO 6 FORY = TO 6 I=M(X,X): K = M(Y, Y) 64 Jl = M(I, F(X, Y)): J = M(K, F(X, Y)) 66 B(l, ) = A(B(,), Jl): B(,) = A(B(, ), J) 68 NEXTY 7 NEXTX 7 B(,) = 74 FORX = TO 76 FORY = TO 78 = M(X, Y): = M(I, F(X, Y)) 8 B(, ) = A(B(, ), ) 8 NEXTY 84 NEXTX 86 B(,) = : B(,) = 88 FORX = TO 9 FORY = TO 9 II = M(X, F(X, Y)): = M(Y, F(X, Y)) 94 B(,) = A(B(, ), II): B(,) = A(B(,), ) 96 NEXTY 98 NEXTX B(, ) = FOR X = TO 4 FOR Y = TO 6 B(,)=A(B(,),F(X,Y)) 8 NEXT Y NEXTX REM Output the result in polynomial form 4 PR#: REM Printer on
13 58 Logic Functions over Galois Field GF(4) : NAKAO 6 PRINT "f(x, y) ="; B(, ): "+"; B(l, ): *x+"; B(, ); "y+"; B(,); "xx+"; B(l, ); "xy+"; B(,); "yy*-";b(,); "xxx+"; B(,); "xxy+"; B(l,); "xyy+"; B(,); "yyy+"; B(,); "xxxy+"; B(,); "xxyy+"; B(l,); "xyyy+"; B(, ); "xxxyy+"; B(, ); "xxyyy+"; B(, ); "xxx" 8 PRINT PR#: REM Printer off PRINT "Continue=any key;stop=q"; 4 GET A$ 6 IF A$ = "Q" THEN 8 GOTO 4 END b. Logic gates + 5V +5V x+y Figure A.. (x+y) gate
14 Dull. Faculty of Engineering, Univ. of the Ryukyus. No.9, V xy Figure A.. (xy) gate
Galois fields/1. (M3) There is an element 1 (not equal to 0) such that a 1 = a for all a.
Galois fields 1 Fields A field is an algebraic structure in which the operations of addition, subtraction, multiplication, and division (except by zero) can be performed, and satisfy the usual rules. More
More informationLATTICE AND BOOLEAN ALGEBRA
2 LATTICE AND BOOLEAN ALGEBRA This chapter presents, lattice and Boolean algebra, which are basis of switching theory. Also presented are some algebraic systems such as groups, rings, and fields. 2.1 ALGEBRA
More informationMath 192r, Problem Set #3: Solutions
Math 192r Problem Set #3: Solutions 1. Let F n be the nth Fibonacci number as Wilf indexes them (with F 0 F 1 1 F 2 2 etc.). Give a simple homogeneous linear recurrence relation satisfied by the sequence
More informationDiscrete Mathematics. CS204: Spring, Jong C. Park Computer Science Department KAIST
Discrete Mathematics CS204: Spring, 2008 Jong C. Park Computer Science Department KAIST Today s Topics Combinatorial Circuits Properties of Combinatorial Circuits Boolean Algebras Boolean Functions and
More informationBoolean Algebra & Logic Gates. By : Ali Mustafa
Boolean Algebra & Logic Gates By : Ali Mustafa Digital Logic Gates There are three fundamental logical operations, from which all other functions, no matter how complex, can be derived. These Basic functions
More informationA field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties:
Byte multiplication 1 Field arithmetic A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties: F is an abelian group under addition, meaning - F is closed under
More informationConstruction of latin squares of prime order
Construction of latin squares of prime order Theorem. If p is prime, then there exist p 1 MOLS of order p. Construction: The elements in the latin square will be the elements of Z p, the integers modulo
More informationAlgebra I. Book 2. Powered by...
Algebra I Book 2 Powered by... ALGEBRA I Units 4-7 by The Algebra I Development Team ALGEBRA I UNIT 4 POWERS AND POLYNOMIALS......... 1 4.0 Review................ 2 4.1 Properties of Exponents..........
More informationBoolean Algebra and Logic Gates
Boolean Algebra and Logic Gates ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall, 2017 ldvan@cs.nctu.edu.tw http://www.cs.nctu.edu.tw/~ldvan/ Outlines Basic
More 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 informationDigital electronics form a class of circuitry where the ability of the electronics to process data is the primary focus.
Chapter 2 Digital Electronics Objectives 1. Understand the operation of basic digital electronic devices. 2. Understand how to describe circuits which can process digital data. 3. Understand how to design
More informationSOLVED PROBLEMS ON TAYLOR AND MACLAURIN SERIES
SOLVED PROBLEMS ON TAYLOR AND MACLAURIN SERIES TAYLOR AND MACLAURIN SERIES Taylor Series of a function f at x = a is ( f k )( a) ( x a) k k! It is a Power Series centered at a. Maclaurin Series of a function
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 informationGalois Fields and Hardware Design
Galois Fields and Hardware Design Construction of Galois Fields, Basic Properties, Uniqueness, Containment, Closure, Polynomial Functions over Galois Fields Priyank Kalla Associate Professor Electrical
More informationArithmetic Operations. The real numbers have the following properties: In particular, putting a 1 in the Distributive Law, we get
MCA AP Calculus AB Summer Assignment The following packet is a review of many of the skills needed as we begin the study of Calculus. There two major sections to this review. Pages 2-9 are review examples
More informationQuasi-reducible Polynomials
Quasi-reducible Polynomials Jacques Willekens 06-Dec-2008 Abstract In this article, we investigate polynomials that are irreducible over Q, but are reducible modulo any prime number. 1 Introduction Let
More informationCS 121 Digital Logic Design. Chapter 2. Teacher Assistant. Hanin Abdulrahman
CS 121 Digital Logic Design Chapter 2 Teacher Assistant Hanin Abdulrahman 1 2 Outline 2.2 Basic Definitions 2.3 Axiomatic Definition of Boolean Algebra. 2.4 Basic Theorems and Properties 2.5 Boolean Functions
More informationChapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples
Chapter 3 Rings Rings are additive abelian groups with a second operation called multiplication. The connection between the two operations is provided by the distributive law. Assuming the results of Chapter
More informationXOR - XNOR Gates. The graphic symbol and truth table of XOR gate is shown in the figure.
XOR - XNOR Gates Lesson Objectives: In addition to AND, OR, NOT, NAND and NOR gates, exclusive-or (XOR) and exclusive-nor (XNOR) gates are also used in the design of digital circuits. These have special
More informationDigital Logic Design. Malik Najmus Siraj
Digital Logic Design Malik Najmus Siraj siraj@case.edu.pkedu LECTURE 4 Today s Agenda Recap 2 s complement Binary Logic Boolean algebra Recap Computer Arithmetic Signed numbers Radix and diminished radix
More informationZ = F(X) Combinational circuit. A combinational circuit can be specified either by a truth table. Truth Table
Lesson Objectives In this lesson, you will learn about What are combinational circuits Design procedure of combinational circuits Examples of combinational circuit design Combinational Circuits Logic circuit
More informationThe Derivative. Appendix B. B.1 The Derivative of f. Mappings from IR to IR
Appendix B The Derivative B.1 The Derivative of f In this chapter, we give a short summary of the derivative. Specifically, we want to compare/contrast how the derivative appears for functions whose domain
More informationBOOLEAN ALGEBRA INTRODUCTION SUBSETS
BOOLEAN ALGEBRA M. Ragheb 1/294/2018 INTRODUCTION Modern algebra is centered around the concept of an algebraic system: A, consisting of a set of elements: ai, i=1, 2,, which are combined by a set of operations
More informationSymmetric polynomials and symmetric mean inequalities
Symmetric polynomials and symmetric mean inequalities Karl Mahlburg Department of Mathematics Louisiana State University Baton Rouge, LA 70803, U.S.A. mahlburg@math.lsu.edu Clifford Smyth Department of
More informationChapter 4 Finite Fields
Chapter 4 Finite Fields Introduction will now introduce finite fields of increasing importance in cryptography AES, Elliptic Curve, IDEA, Public Key concern operations on numbers what constitutes a number
More informationChapter 4: Classical Propositional Semantics
Chapter 4: Classical Propositional Semantics Language : L {,,, }. Classical Semantics assumptions: TWO VALUES: there are only two logical values: truth (T) and false (F), and EXTENSIONALITY: the logical
More information2009 Spring CS211 Digital Systems & Lab CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS
CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS What will we learn? 2 Logic functions and circuits Boolean Algebra Logic gates and Synthesis CAD tools and VHDL Read Section 2.9 and 2.0 Terminology 3 Digital
More informationFinite Fields. [Parts from Chapter 16. Also applications of FTGT]
Finite Fields [Parts from Chapter 16. Also applications of FTGT] Lemma [Ch 16, 4.6] Assume F is a finite field. Then the multiplicative group F := F \ {0} is cyclic. Proof Recall from basic group theory
More informationChapter 2 Boolean Algebra and Logic Gates
Chapter 2 Boolean Algebra and Logic Gates The most common postulates used to formulate various algebraic structures are: 1. Closure. N={1,2,3,4 }, for any a,b N we obtain a unique c N by the operation
More informationChapter 2: Boolean Algebra and Logic Gates
Chapter 2: Boolean Algebra and Logic Gates Mathematical methods that simplify binary logics or circuits rely primarily on Boolean algebra. Boolean algebra: a set of elements, a set of operators, and a
More informationSection VI.33. Finite Fields
VI.33 Finite Fields 1 Section VI.33. Finite Fields Note. In this section, finite fields are completely classified. For every prime p and n N, there is exactly one (up to isomorphism) field of order p n,
More informationChapter 2: Switching Algebra and Logic Circuits
Chapter 2: Switching Algebra and Logic Circuits Formal Foundation of Digital Design In 1854 George Boole published An investigation into the Laws of Thoughts Algebraic system with two values 0 and 1 Used
More informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More information370 Y. B. Jun generate an LI-ideal by both an LI-ideal and an element. We dene a prime LI-ideal, and give an equivalent condition for a proper LI-idea
J. Korean Math. Soc. 36 (1999), No. 2, pp. 369{380 ON LI-IDEALS AND PRIME LI-IDEALS OF LATTICE IMPLICATION ALGEBRAS Young Bae Jun Abstract. As a continuation of the paper [3], in this paper we investigate
More information2x (x 2 + y 2 + 1) 2 2y. (x 2 + y 2 + 1) 4. 4xy. (1, 1)(x 1) + (1, 1)(y + 1) (1, 1)(x 1)(y + 1) 81 x y y + 7.
Homework 8 Solutions, November 007. (1 We calculate some derivatives: f x = f y = x (x + y + 1 y (x + y + 1 x = (x + y + 1 4x (x + y + 1 4 y = (x + y + 1 4y (x + y + 1 4 x y = 4xy (x + y + 1 4 Substituting
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 information100 CHAPTER 4. SYSTEMS AND ADAPTIVE STEP SIZE METHODS APPENDIX
100 CHAPTER 4. SYSTEMS AND ADAPTIVE STEP SIZE METHODS APPENDIX.1 Norms If we have an approximate solution at a given point and we want to calculate the absolute error, then we simply take the magnitude
More informationMathematical Foundations of Cryptography
Mathematical Foundations of Cryptography Cryptography is based on mathematics In this chapter we study finite fields, the basis of the Advanced Encryption Standard (AES) and elliptical curve cryptography
More information3 Applications of partial differentiation
Advanced Calculus Chapter 3 Applications of partial differentiation 37 3 Applications of partial differentiation 3.1 Stationary points Higher derivatives Let U R 2 and f : U R. The partial derivatives
More informationModular Multiplication in GF (p k ) using Lagrange Representation
Modular Multiplication in GF (p k ) using Lagrange Representation Jean-Claude Bajard, Laurent Imbert, and Christophe Nègre Laboratoire d Informatique, de Robotique et de Microélectronique de Montpellier
More informationChapter 4 Mathematics of Cryptography
Chapter 4 Mathematics of Cryptography Part II: Algebraic Structures Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 4.1 Chapter 4 Objectives To review the concept
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 informationBinary addition example worked out
Binary addition example worked out Some terms are given here Exercise: what are these numbers equivalent to in decimal? The initial carry in is implicitly 0 1 1 1 0 (Carries) 1 0 1 1 (Augend) + 1 1 1 0
More informationHandout #6 INTRODUCTION TO ALGEBRAIC STRUCTURES: Prof. Moseley AN ALGEBRAIC FIELD
Handout #6 INTRODUCTION TO ALGEBRAIC STRUCTURES: Prof. Moseley Chap. 2 AN ALGEBRAIC FIELD To introduce the notion of an abstract algebraic structure we consider (algebraic) fields. (These should not to
More informationB. Cyclic Codes. Primitive polynomials are the generator polynomials of cyclic codes.
B. Cyclic Codes A cyclic code is a linear block code with the further property that a shift of a codeword results in another codeword. These are based on polynomials whose elements are coefficients from
More informationChapter 6: Rational Expr., Eq., and Functions Lecture notes Math 1010
Section 6.1: Rational Expressions and Functions Definition of a rational expression Let u and v be polynomials. The algebraic expression u v is a rational expression. The domain of this rational expression
More informationISSUED BY KENDRIYA VIDYALAYA - DOWNLOADED FROM Chapter - 2. (Polynomials)
Chapter - 2 (Polynomials) Key Concepts Constants : A symbol having a fixed numerical value is called a constant. Example : 7, 3, -2, 3/7, etc. are all constants. Variables : A symbol which may be assigned
More informationALGEBRA QUALIFYING EXAM SPRING 2012
ALGEBRA QUALIFYING EXAM SPRING 2012 Work all of the problems. Justify the statements in your solutions by reference to specific results, as appropriate. Partial credit is awarded for partial solutions.
More informationBOOLEAN ALGEBRA TRUTH TABLE
BOOLEAN ALGEBRA TRUTH TABLE Truth table is a table which represents all the possible values of logical variables / statements along with all the possible results of the given combinations of values. Eg:
More information2. Associative Law: A binary operator * on a set S is said to be associated whenever (A*B)*C = A*(B*C) for all A,B,C S.
BOOLEAN ALGEBRA 2.1 Introduction Binary logic deals with variables that have two discrete values: 1 for TRUE and 0 for FALSE. A simple switching circuit containing active elements such as a diode and transistor
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 informationMission 1 Simplify and Multiply Rational Expressions
Algebra Honors Unit 6 Rational Functions Name Quest Review Questions Mission 1 Simplify and Multiply Rational Expressions 1) Compare the two functions represented below. Determine which of the following
More informationBuilding a Computer Adder
Logic Gates are used to translate Boolean logic into circuits. In the abstract it is clear that we can build AND gates that perform the AND function and OR gates that perform the OR function and so on.
More informationDefinition: Let f(x) be a function of one variable with continuous derivatives of all orders at a the point x 0, then the series.
2.4 Local properties o unctions o several variables In this section we will learn how to address three kinds o problems which are o great importance in the ield o applied mathematics: how to obtain the
More information50 Algebraic Extensions
50 Algebraic Extensions Let E/K be a field extension and let a E be algebraic over K. Then there is a nonzero polynomial f in K[x] such that f(a) = 0. Hence the subset A = {f K[x]: f(a) = 0} of K[x] does
More informationSect Introduction to Rational Expressions
127 Sect 7.1 - Introduction to Rational Expressions Concept #1 Definition of a Rational Expression. Recall that a rational number is any number that can be written as the ratio of two integers where the
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 informationError Correction Review
Error Correction Review A single overall parity-check equation detects single errors. Hamming codes used m equations to correct one error in 2 m 1 bits. We can use nonbinary equations if we create symbols
More informationPractice problems for first midterm, Spring 98
Practice problems for first midterm, Spring 98 midterm to be held Wednesday, February 25, 1998, in class Dave Bayer, Modern Algebra All rings are assumed to be commutative with identity, as in our text.
More informationa * (b * c) = (a * b) * c Now, we introduce a useful algebraic system called a group.
2S CHAPTER' ritroducto Cr The purpose of this chapter is to provide the reader with an elementary knowledge of algebra that will aid in the understanding of the material in the following chapters. The
More informationSome Remarks on Minimal Clones
ALGORITHMIC COMPLEXITY and UNIVERSAL ALGEBRA 2007. 7. 16. 7. 20. Szeged, Hungary Some Remarks on Minimal Clones Hajime MACHIDA (Tokyo) Joint Work with Michael PINSKER (Wien) ALGORITHMIC COMPLEXITY and
More informationNOTES ON FINITE FIELDS
NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining
More informationSOLVING SOLVABLE QUINTICS. D. S. Dummit
D. S. Dummit Abstract. Let f(x) = x 5 + px 3 + qx + rx + s be an irreducible polynomial of degree 5 with rational coefficients. An explicit resolvent sextic is constructed which has a rational root if
More informationIntro to Rings, Fields, Polynomials: Hardware Modeling by Modulo Arithmetic
Intro to Rings, Fields, Polynomials: Hardware Modeling by Modulo Arithmetic Priyank Kalla Associate Professor Electrical and Computer Engineering, University of Utah kalla@ece.utah.edu http://www.ece.utah.edu/~kalla
More informationPart I: Propositional Calculus
Logic Part I: Propositional Calculus Statements Undefined Terms True, T, #t, 1 False, F, #f, 0 Statement, Proposition Statement/Proposition -- Informal Definition Statement = anything that can meaningfully
More informationUNCORRECTED SAMPLE PAGES. Extension 1. The binomial expansion and. Digital resources for this chapter
15 Pascal s In Chapter 10 we discussed the factoring of a polynomial into irreducible factors, so that it could be written in a form such as P(x) = (x 4) 2 (x + 1) 3 (x 2 + x + 1). In this chapter we will
More information55 Separable Extensions
55 Separable Extensions In 54, we established the foundations of Galois theory, but we have no handy criterion for determining whether a given field extension is Galois or not. Even in the quite simple
More informationWelcome to Math Video Lessons. Stanley Ocken. Department of Mathematics The City College of New York Fall 2013
Welcome to Math 19500 Video Lessons Prof. Department of Mathematics The City College of New York Fall 2013 An important feature of the following Beamer slide presentations is that you, the reader, move
More informationGALOIS GROUPS OF CUBICS AND QUARTICS (NOT IN CHARACTERISTIC 2)
GALOIS GROUPS OF CUBICS AND QUARTICS (NOT IN CHARACTERISTIC 2) KEITH CONRAD We will describe a procedure for figuring out the Galois groups of separable irreducible polynomials in degrees 3 and 4 over
More informationExample: f(x) = 2x² + 1 Solution: Math 2 VM Part 5 Quadratic Functions April 25, 2017
Math 2 Variable Manipulation Part 5 Quadratic Functions MATH 1 REVIEW THE CONCEPT OF FUNCTIONS The concept of a function is both a different way of thinking about equations and a different way of notating
More informationUNDERSTANDING RULER AND COMPASS CONSTRUCTIONS WITH FIELD THEORY
UNDERSTANDING RULER AND COMPASS CONSTRUCTIONS WITH FIELD THEORY ISAAC M. DAVIS Abstract. By associating a subfield of R to a set of points P 0 R 2, geometric properties of ruler and compass constructions
More informationJ. D. Botha* Department of Mathematics University of South Africa P.O. Box 392 Pretoria 0003, South Africa
NORIT]- ~ Products of Diagonalizable Matrices J. D. Botha* Department of Mathematics University of South Africa P.O. Box 392 Pretoria 0003, South Africa Submitted by Richard A. Brualdi ABSTRACT Let 0:
More informationSemester Review Packet
MATH 110: College Algebra Instructor: Reyes Semester Review Packet Remarks: This semester we have made a very detailed study of four classes of functions: Polynomial functions Linear Quadratic Higher degree
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationInterpolation and Approximation
Interpolation and Approximation The Basic Problem: Approximate a continuous function f(x), by a polynomial p(x), over [a, b]. f(x) may only be known in tabular form. f(x) may be expensive to compute. Definition:
More informationCyclic codes: overview
Cyclic codes: overview EE 387, Notes 14, Handout #22 A linear block code is cyclic if the cyclic shift of a codeword is a codeword. Cyclic codes have many advantages. Elegant algebraic descriptions: c(x)
More informationFields. Victoria Noquez. March 19, 2009
Fields Victoria Noquez March 19, 2009 5.1 Basics Definition 1. A field K is a commutative non-zero ring (0 1) such that any x K, x 0, has a unique inverse x 1 such that xx 1 = x 1 x = 1. Definition 2.
More information17 Galois Fields Introduction Primitive Elements Roots of Polynomials... 8
Contents 17 Galois Fields 2 17.1 Introduction............................... 2 17.2 Irreducible Polynomials, Construction of GF(q m )... 3 17.3 Primitive Elements... 6 17.4 Roots of Polynomials..........................
More informationCOMPUTER ARITHMETIC. 13/05/2010 cryptography - math background pp. 1 / 162
COMPUTER ARITHMETIC 13/05/2010 cryptography - math background pp. 1 / 162 RECALL OF COMPUTER ARITHMETIC computers implement some types of arithmetic for instance, addition, subtratction, multiplication
More informationXI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.
2017-18 XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL HALF ADDER 1. The circuit that performs addition within the Arithmetic and Logic Unit of the CPU are called adders. 2. A unit that adds two
More informationSCHOOL OF MATHEMATICS MATHEMATICS FOR PART I ENGINEERING. Self-paced Course
SCHOOL OF MATHEMATICS MATHEMATICS FOR PART I ENGINEERING Self-paced Course MODULE ALGEBRA Module Topics Simplifying expressions and algebraic functions Rearranging formulae Indices 4 Rationalising a denominator
More informationContents. 2 Partial Derivatives. 2.1 Limits and Continuity. Calculus III (part 2): Partial Derivatives (by Evan Dummit, 2017, v. 2.
Calculus III (part 2): Partial Derivatives (by Evan Dummit, 2017, v 260) Contents 2 Partial Derivatives 1 21 Limits and Continuity 1 22 Partial Derivatives 5 23 Directional Derivatives and the Gradient
More informationReduction of Sixth-Order Ordinary Differential Equations to Laguerre Form by Fiber Preserving Transformations
Reduction of Sixth-Order Ordinary Differential Equations to Laguerre Form by Fiber Preserving Transformations Supaporn Suksern Abstract This paper is devoted to the study on linearization of sixth-order
More informationSimplifying Rational Expressions and Functions
Department of Mathematics Grossmont College October 15, 2012 Recall: The Number Types Definition The set of whole numbers, ={0, 1, 2, 3, 4,...} is the set of natural numbers unioned with zero, written
More informationSection Properties of Rational Expressions
88 Section. - Properties of Rational Expressions Recall that a rational number is any number that can be written as the ratio of two integers where the integer in the denominator cannot be. Rational Numbers:
More informationCHAPTER 2 POLYNOMIALS KEY POINTS
CHAPTER POLYNOMIALS KEY POINTS 1. Polynomials of degrees 1, and 3 are called linear, quadratic and cubic polynomials respectively.. A quadratic polynomial in x with real coefficient is of the form a x
More informationExperiment 7: Magnitude comparators
Module: Logic Design Lab Name:... University no:.. Group no: Lab Partner Name: Experiment 7: Magnitude comparators Mr. Mohamed El-Saied Objective: Realization of -bit comparator using logic gates. Realization
More informationChapter 2 Prerequisite Skills BLM Evaluate Functions 1. Given P(x) = x 4 3x 2 + 5x 11, evaluate.
Chapter Prerequisite Skills BLM 1.. Evaluate Functions 1. Given P(x) = x 4 x + 5x 11, evaluate. a) P( ) b) P() c) P( 1) 1 d) P 4 Simplify Expressions. Expand and simplify. a) (x x x + 4)(x 1) + b) (x +
More informationGroups. 3.1 Definition of a Group. Introduction. Definition 3.1 Group
C H A P T E R t h r e E Groups Introduction Some of the standard topics in elementary group theory are treated in this chapter: subgroups, cyclic groups, isomorphisms, and homomorphisms. In the development
More informationreview To find the coefficient of all the terms in 15ab + 60bc 17ca: Coefficient of ab = 15 Coefficient of bc = 60 Coefficient of ca = -17
1. Revision Recall basic terms of algebraic expressions like Variable, Constant, Term, Coefficient, Polynomial etc. The coefficients of the terms in 4x 2 5xy + 6y 2 are Coefficient of 4x 2 is 4 Coefficient
More informationOWELL WEEKLY JOURNAL
Y \»< - } Y Y Y & #»»» q ] q»»»>) & - - - } ) x ( - { Y» & ( x - (» & )< - Y X - & Q Q» 3 - x Q Y 6 \Y > Y Y X 3 3-9 33 x - - / - -»- --
More informationCprE 281: Digital Logic
CprE 281: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Boolean Algebra CprE 281: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev
More informationBinary Logic and Gates. Our objective is to learn how to design digital circuits.
Binary Logic and Gates Introduction Our objective is to learn how to design digital circuits. These circuits use binary systems. Signals in such binary systems may represent only one of 2 possible values
More informationChapter 2 Boolean Algebra and Logic Gates
Chapter 2 Boolean Algebra and Logic Gates Huntington Postulates 1. (a) Closure w.r.t. +. (b) Closure w.r.t.. 2. (a) Identity element 0 w.r.t. +. x + 0 = 0 + x = x. (b) Identity element 1 w.r.t.. x 1 =
More informationBoolean Algebra CHAPTER 15
CHAPTER 15 Boolean Algebra 15.1 INTRODUCTION Both sets and propositions satisfy similar laws, which are listed in Tables 1-1 and 4-1 (in Chapters 1 and 4, respectively). These laws are used to define an
More information1 Flat, Smooth, Unramified, and Étale Morphisms
1 Flat, Smooth, Unramified, and Étale Morphisms 1.1 Flat morphisms Definition 1.1. An A-module M is flat if the (right-exact) functor A M is exact. It is faithfully flat if a complex of A-modules P N Q
More informationMathematical Olympiad Training Polynomials
Mathematical Olympiad Training Polynomials Definition A polynomial over a ring R(Z, Q, R, C) in x is an expression of the form p(x) = a n x n + a n 1 x n 1 + + a 1 x + a 0, a i R, for 0 i n. If a n 0,
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 informationOn the classification of certain curves up to projective tranformations
On the classification of certain curves up to projective tranformations Mehdi Nadjafikhah Abstract The purpose of this paper is to classify the curves in the form y 3 = c 3 x 3 +c 2 x 2 + c 1x + c 0, with
More informationContents. Chapter 2 Digital Circuits Page 1 of 30
Chapter 2 Digital Circuits Page 1 of 30 Contents Contents... 1 2 Digital Circuits... 2 2.1 Binary Numbers... 2 2.2 Binary Switch... 4 2.3 Basic Logic Operators and Logic Expressions... 5 2.4 Truth Tables...
More information