Scribd Logo
Upload

Welcome to Scribd!

  • 11 views

    DLD - Lecture - 07

    Uploaded by

    emanajmal187
    Digital login design presentation

    Copyright:

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

    DLD - Lecture - 07

    Uploaded by

    emanajmal187
    11 views22 pages
    Digital login design presentation

    Original Title

    - DLD_Lecture_07

    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
    11 views22 pages

    DLD - Lecture - 07

    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 22

    Digital Logic & Design

    Lecture 07
    Analysis of Logic
    Circuits Example 1

    A A.B
    B B 3 A.B  A.B.C.D
    1 6

    A
    2 5
    A.B.C.D

    C
    C.D
    D 4
    Evaluating Boolean
    Expression
     The expression A.B  A.B.C.D
     Assume X  A.B and Y  A.B.C.D
     Expression X  Y
     Conditions for output = 1 X=0 & Y=0
     Since X  A.B X=0 when A=0 or B=1
     Since Y  A.B.C.D
    Y=0 when A=0, B=0, C=1 and D=1
    Evaluating Boolean
    Expression & Truth Table
    Input Output
     Conditions for o/p =1 A B C D F

     A=0, B=0, C=1 & D=1 0


    0
    0
    0
    0
    0
    0
    1
    0
    0
    0 0 1 0 0
    0 0 1 1 1
    0 1 0 0 0
    0 1 0 1 0
    0 1 1 0 0
    0 1 1 1 0
    1 0 0 0 0
    1 0 0 1 0
    1 0 1 0 0
    1 0 1 1 0
    1 1 0 0 0
    1 1 0 1 0
    1 1 1 0 0
    1 1 1 1 0
    Simplifying Boolean
    Expression
     Simplifying by applying Demorgan’s theorem

    A.B  A.B.C.D = ( A.B).( A.B.C.D)


    ( A  B).( A.B.C.D)
    ( A  B).( A.B.C.D)
    ( A.A.B.C.D)  A.B.B.C.D
    A.B.C.D
    Truth Table of Simplified
    expression
    Input Output
    A B C D F
    0 0 0 0 0
    0 0 0 1 0
    0 0 1 0 0
    0 0 1 1 1
    0 1 0 0 0
    0 1 0 1 0
    0 1 1 0 0
    0 1 1 1 0
    1 0 0 0 0
    1 0 0 1 0
    1 0 1 0 0
    1 0 1 1 0
    1 1 0 0 0
    1 1 0 1 0
    1 1 1 0 0
    1 1 1 1 0
    Simplified Logic Circuit

    A 3
    B 4 7
    C
    D
    Simplified Logic Circuit
     Simplified expression A.B.C.D is in SOP
    form
     Simplified circuit
    Second Example
     Evaluating Boolean Expression
     Representing results in a Truth Table
     Simplification of Boolean Expression
    results in POS form and requires 3
    variables instead of the original 4
     Representing results in a Truth Table
     Verifying two expressions through truth
    tables
    Analysis of Logic
    Circuits Example 2

    A A
    1 A.B.C
    B 4
    C ( A.B.C).(C  D)
    2 C 6

    D 5
    C D
    Evaluating Boolean
    Expression
     The expression ( A.B.C).(C  D)
     Assume X A.B.C and Y C  D
     Expression X.Y
     Conditions for output = 1 X=0 OR Y=0
     Since X A.B.C
    X=0 when A=1,B=0 or C=1
     Since Y C  D
    Y=0 when C=1 and D=0
    Evaluating Boolean
    Expression & Truth Table
    Input Output
     Conditions for o/p =1 A B C D F

     (A=1,B=0 OR C=1) 0
    0
    0
    0
    0
    0
    0
    1
    1
    1

    OR (C=1 AND D=0) 0 0 1 0 1


    0 0 1 1 1
    0 1 0 0 0
    0 1 0 1 0
    0 1 1 0 1
    0 1 1 1 1
    1 0 0 0 1
    1 0 0 1 1
    1 0 1 0 1
    1 0 1 1 1
    1 1 0 0 1
    1 1 0 1 1
    1 1 1 0 1
    1 1 1 1 1
    Rewriting the Truth Table
    Input Output
     Conditions for o/p =1
    A B C F
     (A=1,B=0 OR C=1)
    0 0 0 1
    OR (C=1 AND D=0)
    0 0 1 1

    0 1 0 0

    0 1 1 1

    1 0 0 1

    1 0 1 1

    1 1 0 1

    1 1 1 1
    Simplifying Boolean
    Expression
     Simplifying by applying Demorgan’s theorem

    ( A.B.C).(C  D) = ( A.B.C)  (C  D)
    ( A  B  C)  (C.D)
    ( A  B  C)  (C.D)
    A  B  C(1  D)
    A B C
    Truth Table of Simplified
    expression
    Input Output

    A B C F

    0 0 0 1

    0 0 1 1

    0 1 0 0

    0 1 1 1

    1 0 0 1

    1 0 1 1

    1 1 0 1

    1 1 1 1
    Simplified Logic Circuit

    A
    B 3 7
    C
    Simplified Logic Circuit
     Simplified expression A  B  C is in POS
    form representing a single Sum term
     Simplified circuit
    Standard forms of Boolean
    Expressions
     Sum-of-Products form
     Product-of-Sums form
    Standard forms of Boolean
    Expressions
     Sum-of-Products form
    AB + ABC
    ABC + CDE + BCD
    AB  AB C  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

    A B  B (C D  E F )  A B  B C D  B E F

    ( A  B )( B  C  D )  A B  A C  A D  B  B C  B D
     AC  AD  B
    ( A  B )  C  ( A  B )C  ( A  B )C  A C  B C

    You might also like