62
Boolean Algebra Applicati ons 1 BOOLEAN ALGEBRA BOOLEAN ALGEBRA APPLICATIONS APPLICATIONS RELIABILITY OF CIRCUITS RELIABILITY OF CIRCUITS

Boolean Algebra Applications (Reliability of Circuits)

  • Upload
    emad

  • View
    231

  • Download
    4

Embed Size (px)

DESCRIPTION

Boolean Algebra Applications

Citation preview

  • BOOLEAN ALGEBRA APPLICATIONSRELIABILITY OF CIRCUITS

    Boolean Algebra Applications

  • Boolean Algebra Applications*

    Boolean Algebra Applications

  • Boolean Algebra Applications*

    Boolean Algebra Applications

  • Boolean Algebra Applications*

    Boolean Algebra Applications

  • Boolean Algebra Applications*

    Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Sum can be converted into arithmetic sumwhen we obtain a non-overlapping expression

    Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications*

    Boolean Algebra Applications

  • Boolean Algebra Applications*

    Boolean Algebra Applications

  • Non-overlapping expression using K-map

    Boolean Algebra Applications

  • Boolean Algebra Applications

  • F & M METHODL. Fratta & V. Montanari

    Discuss Boolean algebra approach for determining terminal reliability

    Boolean Algebra Applications

  • AlgorithmDetermine all pathsWrite down the corresponding Boolean expressionDetermine non-overlapping simplificationTransform into mathematical expressionSubstitute reliability values

    Boolean Algebra Applications

  • AlgorithmStep 1:Let S be the set of all simple paths between the terminal nodes. Construct a Boolean sum of products f, where each product corresponds to a path S and whose factors are exactly the non-complemented variables corresponding to the arcs in the path

    Boolean Algebra Applications

  • AlgorithmLet P = 0

    Step 2:If f has no terms, stopStep 3:Select any term A of fStep 4:Let A be the arithmetic monomial which is equivalent to A

    Boolean Algebra Applications

  • Boolean Algebra Applications*Algorithm

    Let P = P + A _Step 5: Let A f f and reduce f to a sum of products. Go to step 2.

    Boolean Algebra Applications

  • Example:

    Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • K- Map Method

    Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Example:

    Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • X1X2

    Boolean Algebra Applications

  • X3X4

    Boolean Algebra Applications

  • X1X4X5

    Boolean Algebra Applications

  • X2X3X5

    Boolean Algebra Applications

  • Non-overlapping exp. using K-Map

    Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications

  • Boolean Algebra Applications*Questions ?

    Boolean Algebra Applications

    Boolean Algebra ApplicationsBoolean Algebra Applications*Boolean Algebra ApplicationsBoolean Algebra Applications*Boolean Algebra ApplicationsBoolean Algebra Applications*Boolean Algebra ApplicationsBoolean Algebra Applications*Boolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra Applications*Boolean Algebra ApplicationsBoolean Algebra Applications*Boolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra ApplicationsBoolean Algebra Applications