Scribd Logo
Upload

Welcome to Scribd!

  • 55 views

    Boolean Algebra

    Uploaded by

    Madhu Singh
    This document discusses digital logic systems and Boolean algebra. It covers Boolean logic, truth tables, basic logic gates like OR, AND and NOT. It also discusses more complex logic gates like NAND and NOR. It defines Boolean theorems and laws including De Morgan's theorems. It shows how to represent logic circuits using Boolean expressions and how to derive the output for a given input using truth tables.

    Copyright:

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

    Boolean Algebra

    Uploaded by

    Madhu Singh
    55 views29 pages
    This document discusses digital logic systems and Boolean algebra. It covers Boolean logic, truth tables, basic logic gates like OR, AND and NOT. It also discusses more complex logic gates like NAND and NOR. It defines Boolean theorems and laws including De Morgan's theorems. It shows how to represent logic circuits using Boolean expressions and how to derive the output for a given input using truth tables.

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses digital logic systems and Boolean algebra. It covers Boolean logic, truth tables, basic logic gates like OR, AND and NOT. It also discusses more complex logic gates like NAND and NOR. It defines Boolean theorems and laws including De Morgan's theorems. It shows how to represent logic circuits using Boolean expressions and how to derive the output for a given input using truth tables.

    Copyright:

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

    Boolean Algebra

    Uploaded by

    Madhu Singh
    This document discusses digital logic systems and Boolean algebra. It covers Boolean logic, truth tables, basic logic gates like OR, AND and NOT. It also discusses more complex logic gates like NAND and NOR. It defines Boolean theorems and laws including De Morgan's theorems. It shows how to represent logic circuits using Boolean expressions and how to derive the output for a given input using truth tables.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    You are on page 1of 29

    Digital Systems:

    Boolean Algebra
    and
    Logic Gates
    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
    Tables
     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
     AN
    D
     NO
    T
    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
    GATES
     OR
     AND
     NOT
     NAN
    D
     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
    Describing Logic Circuits
    Algebraically
     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.


     Can also determine output level from a diagram
    Example
    s
    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 = A B
    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
     x*y = y*x Law
     x+(y+z) = (x+y)+z=x+y+z
     x(yz)=(xy)z=xyz / / Associative Law
     x(y+z)=xy+xz
     (w+x)(y+z)=wy+xy+wz+xz / / Distributive Law
     x+xy=x
    / / Absorption Law
    Prove it by Truth Table
    De’Morgan’s
    Theorems
    (Break the line change the sign)
     (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 Theorum
    Demorgan’s Theorum
    De Morgan’s Law : Theorem 2

    The LHS of this theorem represents a NOR gate with inputs A and
    B, whereas the RHS represents an AND gate with inverted inputs.

    This AND gate is called as Bubbled AND.


    Table showing verification of the De Morgan's second theorem −
    Language of Bits
    Logic circuit
    Construct a truth tables for following circuits of logic gates

    Construct the logic circuit of following


    1. C + BC:
    2. AB+BC(B+C)
    FOR MORE LAWS VISIT

    You might also like