Scribd Logo
Upload

Welcome to Scribd!

  • 12 views

    003 Boolean Algebra

    Uploaded by

    iitiansrd2025
    The document discusses Boolean algebra and logic gates. It defines Boolean algebra and its constants/variables. It describes logic gates like OR, AND, NOT and their truth tables. It also discusses NAND, NOR gates and how any logic circuit can be represented using these basic logic gates.

    Copyright:

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

    003 Boolean Algebra

    Uploaded by

    iitiansrd2025
    12 views29 pages
    The document discusses Boolean algebra and logic gates. It defines Boolean algebra and its constants/variables. It describes logic gates like OR, AND, NOT and their truth tables. It also discusses NAND, NOR gates and how any logic circuit can be represented using these basic logic gates.

    Original Title

    003 BOOLEAN ALGEBRA

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses Boolean algebra and logic gates. It defines Boolean algebra and its constants/variables. It describes logic gates like OR, AND, NOT and their truth tables. It also discusses NAND, NOR gates and how any logic circuit can be represented using these basic logic gates.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    12 views29 pages

    003 Boolean Algebra

    Uploaded by

    iitiansrd2025
    The document discusses Boolean algebra and logic gates. It defines Boolean algebra and its constants/variables. It describes logic gates like OR, AND, NOT and their truth tables. It also discusses NAND, NOR gates and how any logic circuit can be represented using these basic logic gates.

    Copyright:

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

    DIGITAL SYSTEMS:

    BOOLEAN ALGEBRA AND LOGIC GATES


    DEFINITION:

    Boolean Algebra is the algebra of


    truth values and operations
    performing on them which is used
    in Digital Circuits for performing
    logical operations.
    BOOLEAN CONSTANTS AND VARIABLES

     Logical statements can have either two values yes or


    no, true or false, 0 or 1.
     Boolean 0 and 1 do not represent actual numbers
    but instead represent the state, or logic level.

    Logic 0 Logic 1
    False True
    Off On
    Low High
    No Yes
    Open switch Closed switch
    TRUTH T ABLE

     A truth table is a means for describing how a logic


    circuit’s output depends on the logic levels present at
    the circuit’s inputs.

    Inputs Output
    A B x
    1 1 1 A
    ? x
    0 1 0
    B
    1 0 0
    0 0 0
    THREE BASIC LOGIC OPERATORS

     OR
     AND

     NOT
    OR OPERATION

     Boolean expression for the OR operation:


    x =A + B
     The above expression is read as “x equals A OR B”
    AND OPERATION

     Boolean expression for the AND operation:


    x =A.B
     The above expression is read as “x equals A AND
    B”
    NOT OPERATION
     The NOT operation is an unary operation, taking only one
    input variable.
     Boolean expression for the NOT operation:
    x= A
     The above expression is read as “x equals the inverse of
    A”
     Also known as inversion or complementation.
     Can also be expressed as: A’

    A
    LOGIC GATE

    A logic gate is a device that acts as a building block for


    digital circuits. They perform basic logical functions that
    are fundamental to digital circuits.
    LOGIC GATES

     OR
     AND
     NOT
     NAND
     NOR
    OR GATE

     An OR gate is a gate that has two or more inputs


    and whose output is equal to the OR combination of
    the inputs.
    AND GATE

     An AND gate is a gate that has two or more inputs


    and whose output is equal to the AND product of the
    inputs.
    NOT Gate

    The symbol and Truth Table for NOT gate is given below:

    A
    ALGEBRAIC REPRESENTATION OF LOGIC CIRCUITS

     Any logic circuits can be built from the three basic


    building blocks: OR, AND, NOT
     Example 1: x = A B + C
     Example 2: x = (A+B)C
     Example 3: x = (A+B)
    EXAMPLES 1,2
    EXAMPLES 3
    EVALUATING LOGIC-CIRCUIT OUTPUTS

     x = ABC(A+D)

     Determine the output x given A=0, B=1, C=1, D=1.


    EXAMPLES
    DRAW THE LOGIC GATE:

     AB+C’D
     A(B+C’) + B’D’
     A’ [ (B+C)’ + AB]

    Draw the Truth Table:


     AB+(BC)’
     A(B’+C’) + BC’
     X’[ (Y+Z)’ + XY]
    DERIVE THE BOOLEAN EXPRESSION
    NAND GATE

     Boolean expression for the NAND operation:


    x = AB
    NOR GATE

     Boolean expression for the NOR operation:


    x = A+ B
    BOOLEAN THEOREMS AND LAWS

     x* 0 =0 Fallacy
     x+1=1 Tautology
     x*x=x Indempotence Law
     x+x=x Indempotence Law
     x*x’=0 Complementarity Law
     x+x’=1 Complementarity Law
     x” = x Involution Law
     x+0=x
     x* 1 =x
    BOOLEAN THEOREMS AND LAWS

     x+y = y+x / / Commutative Law


     x*y = y*x
     x+(y+z) = (x+y)+z=x+y+z / / Associative Law
     x(yz)=(xy)z=xyz
     x(y+z)=xy+xz / / Distributive Law
     (w+x)(y+z)=wy+xy+wz+xz
     x+xy=x / / Absorption Law

    Prove it by Truth Table


    DE’MORGAN’S THEOREM

     (x+y)’=x’y’
     Implications and alternative symbol for NOR function
     (xy)’=x’+y’
     Implications and alternative symbol for NAND function
     Process of Demorganization:
    (i) Complement entire function
    (ii) Change all AND to OR and all OR to AND
    (iii) Complement each of the individual variables
    DEMORGAN’S THEOREM
    DEMORGAN’S THEOREM
    UNIVERSALITY OF NAND GATES
    UNIVERSALITY OF NOR GATES

    You might also like