Scribd Logo
Upload

Welcome to Scribd!

  • 5 views

    Lec - 01 240219 DLD MM

    Uploaded by

    f23mmg18

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd

    Lec - 01 240219 DLD MM

    Uploaded by

    f23mmg18
    5 views24 pages

    Original Title

    Lec_01 240219 DLD MM

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    5 views24 pages

    Lec - 01 240219 DLD MM

    Uploaded by

    f23mmg18

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    You are on page 1of 24

    Lecture

    Boolean Algebra and Logic Simplification


    Boolean Algebra
     Variable: A variable is a symbol usually an uppercase letter used
    to represent a logical quantity.
     A variable can have a 0 or 1 value.

     Complement: A complement is the inverse of a variable and is


    indicated by a bar over the variable.
     Complement of variable X is X*
     If X = 0 then X*= 1 and if X = 1 then X*= 0

     Literal: A Literal is a variable or the complement of a variable. X


    and X* are literals
    ABC

    Boolean Addition & Multiplication


     Boolean Addition performed by OR gate
     Sum Term describes Boolean Addition

     Boolean Multiplication performed by AND gate


     Product Term describes Boolean Multiplication
    Boolean Addition
     Sum of literals
    A B A B A B C
     Sum term = 1 if any literal = 1
     Sum term = 0 if all literals = 0
    Boolean Multiplication
     Product of literals
    A.B A.B A.B.C
     Product term = 1 if all literals = 1
     Product term = 0 if any one literal = 0
    Laws, Rules & Theorems of Boolean Algebra
     Commutative Law
    for addition and multiplication
     Associative Law
    for addition and multiplication
     Distributive Law
     Rules of Boolean Algebra
     Demorgan’s Theorems
    Commutative Law
     Commutative Law for Addition
    A+B=B+A
    A B
    A+B A+B

    B A

     Commutative Law for Multiplication


    A.B = B.A

    A B
    A.B A.B

    B A
    Associative Law
     Associative Law for Addition
    A + (B + C) = (A + B) + C

    A A
    A+(B+C)
    A+B
    B
    B
    (A+B)+C
    B+C C
    C
    Associative Law
     Associative Law for Multiplication
    A.(B.C) = (A.B).C

    A A
    A.(B.C)
    A.B
    B
    B
    (A.B).C
    B.C C
    C
    Distributive Law
    A.(B + C) = A.B + A.C

    A A
    A.(B+C)
    A.B
    B
    B
    A A.B+A.C
    B+C
    C A.C
    C
    Rules of Boolean Algebra
    1. A+0=A 7. A.A = A
    2. A+1=1 8. A. A = 0
    3. A.0 = 0 9. =A
    A
    4. A.1 = A 10. A + A.B = A
    5. A+A=A 11. A + A.B = A + B
    6. A+A = 1 12. (A+B).(A+C)
    = A+B.C
    Demorgan’s Theorems
     First Theorem

    A.B A  B
    A A
    A.B A B
    B B
     Second Theorem

    A  B A.B
    A A
    A B A.B
    B B
    Demorgan’s Theorems
     Any number of variables
    X.Y.Z  X  Y  Z
    X  Y  Z  X.Y.Z
     Combination of variables
    ( A  B.C).( A.C  B) ( A  B.C)  ( A.C  B)
     A.(B.C)  ( A.C).B  A.(B  C)  ( A  C).B
    A.B  A.C  A.B  B.C
    A.B  A.C  B.C
    Boolean Analysis of Logic Circuits
     Boolean Algebra provides concise way to represent operation of a
    logic circuit
     Complete function of a logic circuit can be determined by
    evaluating the Boolean expression using different input
    combinations
    Boolean Analysis of Logic Circuits
    A
    AB

    B
    AB  C
    C C

    ( AB  C)D
    D

     From the expression, the output is a 1 if


    variable D = 1 and ( AB  C) =1

    ( AB  C)=1 if AB=1 or C=0
    Boolean Analysis of Logic Circuits

    Inputs Output Inputs Output


    A B C D F A B C D F
    0 0 0 0 0 1 0 0 0 0
    0 0 0 1 1 1 0 0 1 1
    0 0 1 0 0 1 0 1 0 0
    0 0 1 1 0 1 0 1 1 0
    0 1 0 0 0 1 1 0 0 0
    0 1 0 1 1 1 1 0 1 1
    0 1 1 0 0 1 1 1 0 0
    0 1 1 1 0 1 1 1 1 1
    Simplification using Boolean
    Algebra
    Simplification using Boolean
    Algebra
     AB + A(B+C) + B(B+C)
    = AB + AB + AC + BB +BC
    = AB + AC + B + BC
    = AB + AC + B
    = B + AC
    Simplified Circuit
    A

    AB+A(B+C)+B(B+C)
    B

    C
    B B+AC

    A
    C
    Standard forms of Boolean Expressions

     Sum-of-Products form (Sum of Minterm)


     When two or more product terms are summed by Boolean
    addition, the result is a Sum-of-Product or SOP expression
     Product-of-Sums form (Product of Maxterm)
     When two or more sum terms are multiplied by Boolean
    multiplication, the result is a Product-of-Sum or POS
    expression
    Standard forms of Boolean Expressions
     Sum-of-Products form
    AB + ABC
    ABC + CDE + BCD
    AB  ABC  AC
     Product-of-Sums form
    ( A  B)( A  B  C)
    ( A  B  C)(C  D  E)(B  C  D)
    ( A  B)( A  B  C)( A  C)
    Implementation of SOP expression

    A
    D
    B+AC+AD
    B
    A
    C
    Implementation of POS expression

    A
    B (A+B)(B+C+D)(A+C)
    B
    C
    AD
    C
    Conversion of general expression to SOP form

    AB  B(CD  EF)  AB  BCD  BEF

    ( A  B)(B  C  D)  AB  AC  AD  B  BC  BD
    AC  AD  B
    ( A  B)  C ( A  B)C ( A  B)C A C  BC

    You might also like