Scribd Logo
Upload

Welcome to Scribd!

  • 5 views

    DLD - Lecture - 06

    Uploaded by

    emanajmal187
    Digital login design presentation

    Copyright:

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

    DLD - Lecture - 06

    Uploaded by

    emanajmal187
    5 views21 pages
    Digital login design presentation

    Original Title

    - DLD_Lecture_06

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Digital login design presentation

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    5 views21 pages

    DLD - Lecture - 06

    Uploaded by

    emanajmal187
    Digital login design presentation

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    of 21

    Digital Logic & Design

    Lecture 06
    Boolean Algebra
     Variable
     Complement
     Literal
    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 =A(1+B) + A’B =A+B

    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
    Duality Principle
     Boolean equation remains valid if we take
    the dual of the expressions on both sides of the
    equals sign
     The dual of an expression is obtained by
    changing AND to OR and OR to AND
    throughout (and 1s to 0s and 0s to 1s if they
    appear in the expression)
    Duality Principle
     The duality principle ensures that "if we
    exchange every symbol by its dual in a formula,
    we get the dual result".
     (a) 0 . 1 = 0: is a true statement asserting that
    "false and true evaluates to false“
     (b) 1 + 0 = 1: is the dual of (a): it is a true
    statement asserting that "true or false evaluates
    true."
    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 ( A B  C ) =1
     ( A B  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

    You might also like