Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 10 views

    Boolean Algebra

    Uploaded by

    mb99978601
    The document discusses Boolean algebra and its applications in digital logic and circuit design. It defines Boolean variables, literals, addition, multiplication and their relationships to OR and AND gates. Laws and theorems of Boolean algebra are presented, including identity, involution, commutative, associative, distributive, and DeMorgan's theorems. Boolean algebra provides a way to represent the operation of logic circuits through expressions that can be evaluated for different input combinations.

    Copyright:

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

    Boolean Algebra

    Uploaded by

    mb99978601
    10 views14 pages
    The document discusses Boolean algebra and its applications in digital logic and circuit design. It defines Boolean variables, literals, addition, multiplication and their relationships to OR and AND gates. Laws and theorems of Boolean algebra are presented, including identity, involution, commutative, associative, distributive, and DeMorgan's theorems. Boolean algebra provides a way to represent the operation of logic circuits through expressions that can be evaluated for different input combinations.

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses Boolean algebra and its applications in digital logic and circuit design. It defines Boolean variables, literals, addition, multiplication and their relationships to OR and AND gates. Laws and theorems of Boolean algebra are presented, including identity, involution, commutative, associative, distributive, and DeMorgan's theorems. Boolean algebra provides a way to represent the operation of logic circuits through expressions that can be evaluated for different input combinations.

    Copyright:

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

    Boolean Algebra

    Uploaded by

    mb99978601
    The document discusses Boolean algebra and its applications in digital logic and circuit design. It defines Boolean variables, literals, addition, multiplication and their relationships to OR and AND gates. Laws and theorems of Boolean algebra are presented, including identity, involution, commutative, associative, distributive, and DeMorgan's theorems. Boolean algebra provides a way to represent the operation of logic circuits through expressions that can be evaluated for different input combinations.

    Copyright:

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

    Digital Logic & Design

    Boolean Algebra

    Mah Noor Fatima (CS Lecturer)

    GCUF Sahiwal
    Boolean Algebra

     Variable
     Complement
     Literal
    Boolean Addition &
    Multiplication

     BooleanAddition 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
     Identity Law
    1. A+0=A 2. A . 1 = A
     Indempotent Law
    1. A+A=A 2. A . A = A
     Dominance Law
    1. A+1=1 2. A . 0 = 0
     Involution Law
    A=A
     Negation Law
    1. A+ A
    =1 2. A . A
    =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
     AssociativeLaw 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
    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

    You might also like