Scribd Logo
Upload

Welcome to Scribd!

  • Self Learning DM 2

    Uploaded by

    Sharon Cedila
    21 views8 pages
    The document discusses simplifying combinatorial logic circuits using consensus and Karnaugh maps. It provides three examples of combinatorial circuits and their simplified boolean expressions: 1) Circuit simplified to E = z + x'y + xy'z + yz 2) Circuit simplified to E = x'z + x'y + xy'z 3) Circuit simplified to E = x'yz + x'yz' + xy'z' + xy'z It then provides the boolean expression and truth table for a sample logic network with inputs X1, X2, X3 and output E. The boolean expression is simplified to E = X1' and the truth table has 8 rows

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses simplifying combinatorial logic circuits using consensus and Karnaugh maps. It provides three examples of combinatorial circuits and their simplified boolean expressions: 1) Circuit simplified to E = z + x'y + xy'z + yz 2) Circuit simplified to E = x'z + x'y + xy'z 3) Circuit simplified to E = x'yz + x'yz' + xy'z' + xy'z It then provides the boolean expression and truth table for a sample logic network with inputs X1, X2, X3 and output E. The boolean expression is simplified to E = X1' and the truth table has 8 rows

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    21 views8 pages

    Self Learning DM 2

    Uploaded by

    Sharon Cedila
    The document discusses simplifying combinatorial logic circuits using consensus and Karnaugh maps. It provides three examples of combinatorial circuits and their simplified boolean expressions: 1) Circuit simplified to E = z + x'y + xy'z + yz 2) Circuit simplified to E = x'z + x'y + xy'z 3) Circuit simplified to E = x'yz + x'yz' + xy'z' + xy'z It then provides the boolean expression and truth table for a sample logic network with inputs X1, X2, X3 and output E. The boolean expression is simplified to E = X1' and the truth table has 8 rows

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 8

    SELF LEARNING_THE LOGIC OF COMPOUND STATEMENTS

    1. Draw combinatorial circuit, then simplify using Consensus and Karnaugh Map
    a. E = xyz + xyz’ + xy’z + xy’z’ + x’y’z + x’yz’
    Consensus :
    E = xyz + xyz’ + xy’z + xy’z’ + x’y’z + x’yz’
    E = xyz + xyz’ + xy’z + xy’z’ + x’y’z + x’yz’ + xy
    E = xy ( z + z’ + 1 ) + xy’z + xy’z’ + x’y’z + x’yz’
    E = xy + xy’z + xy’z’ + x’y’z + x’yz’
    E = xy + xy’z + xy’z’ + x’y’z + x’yz’ + xy’
    E = xy + xy’ ( z + z’ + 1 ) + x’y’z + x’yz’
    E = xy + xy’ + x’y’z + x’yz’
    E = xy + xy’ + x’y’z + x’yz’ + x
    E = x ( y + y’ + 1) + x’y’z + x’yz’ + x’
    E = x + x’y’z + x’yz’

    Karnaugh Map :

    yz yz’ y’z y’z’


    x 1 1 1 1
    x’ 1 1
    b. E = x’z + x’y + xy’z + yz

    E = x’z + x’y + xy’z + yz same with


    E = x’z + x’y + xy’z + yz
    E = x’z ( y + y’ ) + x’y ( z + z’ ) + xy’z + yz ( x + x’ )
    E = x’yz + x’y’z + x’yz + x’yz’ + xy’z + xyz + x’yz
    E = x’yz + x’y’z + x’yz + x’yz’ + xy’z + xyz + x’yz + x’z
    E = x’z ( y + y’ + 1 ) + x’yz + x’yz’ + xy’z + xyz + x’yz
    E = x’z + x’yz + x’yz’ + xy’z + xyz + x’yz
    E = x’z + x’yz + x’yz’ + xy’z + xyz + x’yz + x’y
    E = x’z + x’y ( z + z’ + 1 ) + xy’z + xyz + x’yz
    E = x’z + x’y + xy’z + xyz + x’yz
    E = x’z + x’y + xy’z + xyz + x’yz + xz
    E = x’z + x’y + xz ( y’ + y + 1 ) + x’yz
    E = x’z + x’y + xz ( y’ + y + 1 ) + x’yz
    E = x’z + x’y + xz + x’yz
    E = x’z + x’y + xz + x’yz + z
    E = z ( x’ + x + 1) + x’y + x’yz
    E = z + x’y + x’yz

    Karnaugh Map :

    yz yz’ y’z y’z’


    x 1 1
    x’ 1 1 1

    c. E = x’yz + x’yz’ + xy’z’ + xy’z


    Consensus :
    E = x’yz + x’yz’ + xy’z’ + xy’z
    E = x’yz + x’yz’ + xy’z’ + xy’z + x’y
    E = x’y ( z + z’ + 1 ) + xy’z’ + xy’z
    E = x’y + xy’z’ + xy’z
    E = x’y + xy’z’ + xy’z + xy’
    E = x’y + xy’ ( z’ + z + 1 )
    E = x’y + xy’

    Karnaugh Map :

    yz yz’ y’z y’z’


    x 1 1
    x’ 1 1

    2. Boolean expression and a truth function for each of the logic networks are:
    The boolean expression of this circuit is :
    E = ( X2 + X3’ )( X1X2 )’
    E = ( X2 + X3’ )( X1’X2’ )
    E = X1’ + X1’X2’X3’
    E = X1’ ( X2 + X2 ‘ ) + X1’X2’X3’
    E = X1’X2 + X1’X2’ + X1’X2’X3’
    E = X1’X2 ( X3 + X3’ ) + X1’X2’ ( X3 + X3’ ) + X1’X2’X3’
    E = X1’X2 X3 + X1’X2 X3’ + X1’X2’X3 + X1’X2’X3’ + X1’X2’X3’
    E = X1’X2 X3 + X1’X2 X3’ + X1’X2’X3 + X1’X2’X3’ + X1’X2’X3’ + X1’X2
    E = X1’X2 ( X3 + X3’ + 1 ) + X1’X2’X3 + X1’X2’X3’ + X1’X2’X3’
    E = X1’X2 + X1’X2’X3 + X1’X2’X3’ + X1’X2’X3’
    E = X1’X2 + X1’X2’X3 + X1’X2’X3’ ( 1 + 1 )
    E = X1’X2 + X1’X2’X3 + X1’X2’X3’
    E = X1’X2 + X1’X2’X3 + X1’X2’X3’ + X1’X2’
    E = X1’X2 + X1’X2’ ( X3 + X3’ + 1 )
    E = X1’X2 + X1’X2’
    E = X1’( X2 + X2’ )
    E = X1’

    The truth table of the boolean expression is :

    X2X3 X2X3’ X2’X3 X2’X3’


    X1
    X1’ 1 1 1 1
    X1 X2 X3 X3’ X1X2 ( X1X2 )’ X2 + X3’ ( X2 + X3’ )( X1X2 )’
    1 1 1 0 1 0 1 0 ( or )
    1 1 0 1 1 0 1 0
    1 0 1 0 0 1 0 0
    1 0 0 1 0 1 1 1
    0 1 1 0 0 1 1 1
    0 1 0 1 0 1 1 1
    0 0 1 0 0 1 0 0
    0 0 0 1 0 1 1 1
    ( or )

    X1 X2 X3 X3’ X1X2 ( X1X2 )’ X2 + X3’ ( X2 + X3’ )( X1X2 )’


    T T T F T F T F
    T T F T T F T F
    T F T F F T F F
    T F F T F T T T
    F T T F F T T T
    F T F T F T T T
    F F T F F T F F
    F F F T F T T T

    You might also like