Scribd Logo
Upload

Welcome to Scribd!

  • Book 1

    Uploaded by

    Ha Zim
    5 views3 pages
    This document contains a truth table that defines the logic for a CMOS NAND gate. The truth table has 8 inputs - A, B, C, D, E - and one output, F. It shows that the output F will be 0 when A and B are both 1, or when C is 1 and D or E is 1. In all other cases, the output F will be 1.

    Original Description:

    SADZS

    Original Title

    Book1

    Copyright

    © © All Rights Reserved

    Available Formats

    XLSX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains a truth table that defines the logic for a CMOS NAND gate. The truth table has 8 inputs - A, B, C, D, E - and one output, F. It shows that the output F will be 0 when A and B are both 1, or when C is 1 and D or E is 1. In all other cases, the output F will be 1.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    5 views3 pages

    Book 1

    Uploaded by

    Ha Zim
    This document contains a truth table that defines the logic for a CMOS NAND gate. The truth table has 8 inputs - A, B, C, D, E - and one output, F. It shows that the output F will be 0 when A and B are both 1, or when C is 1 and D or E is 1. In all other cases, the output F will be 1.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 3

    D

    P1

    P2

    P1

    N2

    GND

    N2

    VDD
    D
    VDD

    P1
    P+ Diffusion

    N+ Diffusion
    N1

    GND
    GND

    B
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    1
    1
    1
    1
    1
    1
    1
    1
    1
    1
    1
    1
    1
    1
    1
    1

    C
    0
    0
    0
    0
    0
    0
    0
    0
    1
    1
    1
    1
    1
    1
    1
    1
    0
    0
    0
    0
    0
    0
    0
    0
    1
    1
    1
    1
    1
    1
    1
    1

    D
    0
    0
    0
    0
    1
    1
    1
    1
    0
    0
    0
    0
    1
    1
    1
    1
    0
    0
    0
    0
    1
    1
    1
    1
    0
    0
    0
    0
    1
    1
    1
    1

    0
    0
    1
    1
    0
    0
    1
    1
    0
    0
    1
    1
    0
    0
    1
    1
    0
    0
    1
    1
    0
    0
    1
    1
    0
    0
    1
    1
    0
    0
    1
    1

    A.B
    0
    1
    0
    1
    0
    1
    0
    1
    0
    1
    0
    1
    0
    1
    0
    1
    0
    1
    0
    1
    0
    1
    0
    1
    0
    1
    0
    1
    0
    1
    0
    1

    C(D+E)
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    1
    1
    1
    1
    1
    1
    1
    1
    1
    1
    1
    1

    F=A.B+C.(D+E)
    0
    0
    0
    0
    0
    1
    1
    1
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    1
    1
    1
    0
    0
    0
    0
    0
    1
    1
    1

    1
    1
    1
    1
    1
    0
    0
    0
    1
    1
    1
    1
    1
    0
    0
    0
    1
    1
    1
    1
    1
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0

    You might also like