1 / 34

Boolean Algebra and Logic Circuits . Duality

Discrete mathematics. Boolean Algebra and Logic Circuits . Duality. N.V. Bilous. Faculty of computer sciences Software department, KNURE. KNURE, Software department, Ph. 7021-446, e-mail: belous@kture.Kharkov.ua. Topic 1 Boolean Algebra and Logic Circuits. ХНУРЭ,кафедра ПО ЭВМ,

hkim
Download Presentation

Boolean Algebra and Logic Circuits . Duality

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Discrete mathematics BooleanAlgebraandLogicCircuits. Duality N.V. Bilous Faculty of computer sciences Software department, KNURE KNURE, Software department, Ph. 7021-446, e-mail: belous@kture.Kharkov.ua

  2. Topic 1Boolean Algebra and Logic Circuits ХНУРЭ,кафедра ПО ЭВМ, Тел. 7021-446, e-mail: belous@kture.Kharkov.ua

  3. Boolean Variables and Functions Let B = {0, 1}. The variable x is called aBoolean variable or a logic variable if it assumes values only from B. Values 0 and 1 Boolean variables is called Boolean constants.

  4. Boolean Variables and Functions A function y=f(x1,x2,...,xn) is called a Boolean function or a logic function if it assumes values from B and each of its variables also assumes values from B. A Boolean function is called a Boolean function of degree n if its formula contains n different variables.

  5. The conjunction Figure 1 – The conjunction (series connection) L(x1, x2)= x1x2 where L=1 if x1=1 and x2=1, L=0 otherwise. The “  ” symbol is called the conjunction or ANDoperator, and the circuit in Figure 1 is said to implement the conjunction.

  6. The disjunction L(x1, x2) = x1x2 where L=1 if x1=1 or x2=1 or if x1=x2=1, L=0 if x1=x2=1. The  symbol is called the disjunction or OR operator, and the circuit in Figure 2 is said to implement the disjunction. Figure 2 – The disjunction (parallel connection)

  7. The negation L(x) = x where L=1 if x=0 L=0 if x=1. The value of this function is the inverse of the value of the input variable. Instead of using the word inverse, it is more common to use the term negation or complement.

  8. Methods of Boolean function representation I. Truth table The values of a Boolean function are often displayed in the form of a table called the truth table. The rows amount in a truth table is equal to the amount of different interpretations of the function (2n).

  9. The Boolean Functions for 1 variables 0 0 – the constant of zero; 1 = x  – the repetition of the argument; 2 =  – the negation of the argument; 3 1 – the constant of unity. x 0 1 2 3 0 0 0 1 1 1 0 1 0 1 y=f(x)

  10. The Boolean Functions of Degree 2 z=f(x,y)

  11. The Boolean Functions of Degree 2

  12. The Boolean Functions of Degree 2

  13. Methods of Boolean function representation II. Numbers of Boolean functions and interpretations Every function has a sequence number as a natural number a binary code of which is a column of function values in a truth table. A least significant bit is consider a lowermost row (value of function on interpretation (1,1,.,1)), and senior — most overhead (value of function on interpretation (0,0,.,0)).

  14. Methods of Boolean function representation Every interpretation of Boolean function has the number – value of binary code which is interpretation. Interpretation, which is written in the overhead row of truth table, has a number 0, after interpretation has number 1 and etc. In a lowermost row interpretation is located with a number 2n–1, where n is an amount of variables which depends a Boolean function.

  15. Example Find the sequence number for function f(x,y),which hasnext values: f(0,0)=1, f(0,1)=1, f(1,0)=0, f(1,1)=1. Binary code for the value of this function – 1101. 11012 = 123 +122 +021 +120 = =8+4+0+1=1310 Thus, f13(x,y)= (1101)2

  16. Example Build the truth table for functionf198(x,y) 1 1 0 0 0 1 1 0

  17. Methods of Boolean function representation III. Boolean function representation with using formulas A formula is expression which propose some function as superposition of another functions. Superposition is a method of new functions construction by the substitution of one function values in place of argument values of another function

  18. Example Consider the formula of boolean algebra for functionf(x,y,z) This formula has functions: g(x1) – negation, s(x1,x2) – conjunction, l(x1,x2) – disjunction. Present this formula as superposition of the indicated functions as follows: f (x,y,z) = l(s(x,g(y)),z)

  19. Precedence ofoperations Negation. Conjunction. Disjunction. Implication. Equivalence. Example Cleanall possible brackets Add some brackets taking into account precedence of operations

  20. Equivalent function Two different Boolean expressions that represent the same function are called equivalent. For instance, all the Boolean expressions xy1, xy0, and xy are equivalent.

  21. Boolean Identities 1) Commutative laws xy = yx xy = yx 2)Associative laws x(yz)= (xy)z x(yz)=(xy)z 3) Distributive laws x(yz) = (xy)(xz) x(yz) = (xy)(xz)

  22. Boolean Identities 4) Idempotent laws xx = xx = 5) The excluded middle law 6) The contradiction law 7) The absorption laws (elimination laws) x(xy) = x(xy) = x x 1 0 x x

  23. Boolean Identities 8) Identity laws x0 = x1 = 9) Domination laws x1 = x0 = 10) Law of the double negation 11) De Morgan`s laws x x 1 0 x

  24. Topic 2Duality ХНУРЭ,кафедра ПО ЭВМ, Тел. 7021-446, e-mail: belous@kture.Kharkov.ua

  25. Dual Boolean function Functionf*(x1,…,xn)is calleddualto functionf(x1,…,xn), if

  26. Selfdual Boolean function A Boolean function is called selfdual if

  27. Selfdual Boolean function It is easy to define if a given Boolean function is selfdual or not by its truth table. For this we divide a truth table by half, using the symmetrical line.If any arc connects equal values, then the function is not selfdual. If every arc connects different values, then the function is selfdual.

  28. Selfdual Boolean function Example. Define if the function f14(x,y)is selfdual. Solution. Given function is not selfdual.

  29. Selfdual Boolean function Example. Define, if functionf(x,y,z)is selfdual. Solution.f(x,y,z) — selfdual. 0 1 1 1 0 0 0 1

  30. Duality principle The functionfis given by superpositionof function f0,…,fn, wherenN. Functionf*, dual tof, can be obtained, changingfunctionsf0,…,fnin the formula ffor dualtof0*,…,fn*.

  31. Duality principle Example. Find dual functions. Solution.

  32. Rule of obtaining dual formula To obtain dual formula of Boolean algebra it is needed to change all conjunctionsfor disjunctions, disjunctionsfor conjunctions, 0 for 1, 1 for 0 in it, and usebracketswhere it is neededto keep previous order of fulfilling operations.

  33. Rule of obtaining dual formula Example. Find function dual to function Solution. Let’s use previousrule of obtaining dual formula.

  34. Rule of obtaining dual formula If functions are equal then dual to them functions are equal too. Letf1andf2are some functions expressing by such formulas.If f1 = f2, then f1* = f2*

More Related