Scribd Logo
Upload

Welcome to Scribd!

  • 440 views

    2 Universal Gates

    Uploaded by

    roopashree obalesh
    NAND and NOR gates are considered universal gates because any other type of logic gate can be created using only NAND or only NOR gates. This is proven by examples showing how to construct NOT, AND, OR, XOR, and other common logic gates solely from NAND or NOR gates. Specifically, NAND gates can be combined to form NOT, AND, OR, XOR, and other gates, while NOR gates can similarly form all other gate types through various combinations and inversions.

    Copyright:

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

    2 Universal Gates

    Uploaded by

    roopashree obalesh
    440 views15 pages
    NAND and NOR gates are considered universal gates because any other type of logic gate can be created using only NAND or only NOR gates. This is proven by examples showing how to construct NOT, AND, OR, XOR, and other common logic gates solely from NAND or NOR gates. Specifically, NAND gates can be combined to form NOT, AND, OR, XOR, and other gates, while NOR gates can similarly form all other gate types through various combinations and inversions.

    Original Title

    2 Universal Gates.pptx

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    NAND and NOR gates are considered universal gates because any other type of logic gate can be created using only NAND or only NOR gates. This is proven by examples showing how to construct NOT, AND, OR, XOR, and other common logic gates solely from NAND or NOR gates. Specifically, NAND gates can be combined to form NOT, AND, OR, XOR, and other gates, while NOR gates can similarly form all other gate types through various combinations and inversions.

    Copyright:

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

    2 Universal Gates

    Uploaded by

    roopashree obalesh
    NAND and NOR gates are considered universal gates because any other type of logic gate can be created using only NAND or only NOR gates. This is proven by examples showing how to construct NOT, AND, OR, XOR, and other common logic gates solely from NAND or NOR gates. Specifically, NAND gates can be combined to form NOT, AND, OR, XOR, and other gates, while NOR gates can similarly form all other gate types through various combinations and inversions.

    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 15

    As a universal gates

    NAND and NOR


    What are a Universal Gate
    And why NAND and NOR are
    known as universal gates?
     A gate which can be use to create any Logic gate is
    called Universal Gate

    NAND and NOR are called Universal Gates because


    all the other gates can be created by using these gates
    Proof for NAND gates
    Any Boolean function
    can be implemented using AND, OR and NOT
    gates

    Inthe same way AND, OR and NOT gates can be


    implemented using NAND gates only,
    Implementation of NOT using NAND
    A NOT gate is made by joining the inputs of a NAND
    gate together.

    Desired NOT Gate NAND Construction


    Input Output

    0 1

    1 0
    Implementation of AND using NAND

     A NAND gate is an inverted AND gate.

     An AND gate is made by following a NAND gate with a


    NOT gate
    Input A Input B Output Q

    0 0 0

    0 1 0

    1 0 0
    NAND Construction
    1 1 1
    Implementation of OR gate using NAND
    • If the truth table for a NAND gate is examined or by applying 
    De Morgan's Laws, it can be seen that if any of the inputs are 0,
    then the output will be 1. To be an OR gate,

    Input A Input B Output Q

    0 0 0

    0 1 1

    1 0 1

    NAND Construction 1 1 1
    Implementation of XOR gate using
    NAND
    An XOR gate is constructed similarly to an OR gate,
    except with an additional NAND gate inserted such
    that if both inputs are high, the inputs to the final
    NAND gate will also be high,

    Input A Input B Output Q

    0 0 0

    0 1 1

    1 0 1

    NAND Construction 1 1 0
    Implementation of NOR gate using
    NAND
     A NOR gate is simply an inverted OR gate. Output is high
    when neither input A nor input B is high:

    Input A Input B Output Q

    0 0 1

    0 1 0

    1 0 0

    1 1 0

    NAND Construction
    Implementation of XNOR gate using NAND

    • An XNOR gate is simply an XOR gate with an inverted


    output:

    Input A Input B Output Q

    0 0 1

    NAND Construction 0 1 0

    1 0 0

    1 1 1
    Proof for NOR gates
     Like NAND gates, NOR gates are so-called "universal gates"
    that can be combined to form any other kind of logic gate. A
    NOR gate is logically an inverted OR gate

    Implementation of NOT gate using


    NAND
     NOT made by joining the inputs Input Output

     of a NOR gate. 0 1

    1 0
    Implementation of OR gate using NOR
    • The OR gate is simply a NOR gate followed by another NOR
    gate

    Input A Input B Output Q

    0 0 0 Desired Gate
    0 1 1

    1 0 1

    1 1 1
    Implementation of AND gate using
    NOR
    • an AND gate is made by inverting the inputs to a NOR
    gate.

    Input A Input B Output Q

    0 0 0

    0 1 0

    1 0 0

    NOR Construction 1 1 1
    Implementation of NAND gate using
    NOR

    NOR Construction
    Implementation of XOR gate using
    NOR
     An XOR gate is made by connecting the output of 3 NOR
    gates (connected as an AND gate) and the output of a NOR
    gate to the respective inputs of a NOR gate.

    Input A Input B Output Q

    0 0 0

    0 1 1

    1 0 1

    NOR Construction 1 1 0
    Implementation of XNOR gate using NOR
     An XNOR gate can be constructed from four NOR gates
    implementing the expression "(A NOR N) NOR (B NOR N)
    where N = A NOR B". This construction has a propagation
    delay three times that of a single NOR gate, and uses more
    gates.

    Input A Input B Output Q

    0 0 1

    0 1 0

    1 0 0

    NOR Construction 1 1 1

    You might also like