Scribd Logo
Upload

Welcome to Scribd!

  • 21 views

    Assignment 6: Transistor/Gate/Logic Due Date: Wednesday 4/02/2020

    Uploaded by

    ZERO TO VARIABLE
    This document provides instructions for an assignment on transistor gates and logic circuits. It contains 4 problems to solve involving: 1) completing CMOS circuits by drawing the missing half, 2) drawing a CMOS gate for a Boolean function, 3) drawing truth tables, and 4) drawing circuits from Boolean expressions and truth tables, using inverters, AND gates, and OR gates. The assignment is due on Wednesday 4/02/2020 and students are instructed to show their work and not just final answers.

    Copyright:

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

    Assignment 6: Transistor/Gate/Logic Due Date: Wednesday 4/02/2020

    Uploaded by

    ZERO TO VARIABLE
    21 views5 pages
    This document provides instructions for an assignment on transistor gates and logic circuits. It contains 4 problems to solve involving: 1) completing CMOS circuits by drawing the missing half, 2) drawing a CMOS gate for a Boolean function, 3) drawing truth tables, and 4) drawing circuits from Boolean expressions and truth tables, using inverters, AND gates, and OR gates. The assignment is due on Wednesday 4/02/2020 and students are instructed to show their work and not just final answers.

    Original Title

    AA-Assignment 6

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides instructions for an assignment on transistor gates and logic circuits. It contains 4 problems to solve involving: 1) completing CMOS circuits by drawing the missing half, 2) drawing a CMOS gate for a Boolean function, 3) drawing truth tables, and 4) drawing circuits from Boolean expressions and truth tables, using inverters, AND gates, and OR gates. The assignment is due on Wednesday 4/02/2020 and students are instructed to show their work and not just final answers.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    21 views5 pages

    Assignment 6: Transistor/Gate/Logic Due Date: Wednesday 4/02/2020

    Uploaded by

    ZERO TO VARIABLE
    This document provides instructions for an assignment on transistor gates and logic circuits. It contains 4 problems to solve involving: 1) completing CMOS circuits by drawing the missing half, 2) drawing a CMOS gate for a Boolean function, 3) drawing truth tables, and 4) drawing circuits from Boolean expressions and truth tables, using inverters, AND gates, and OR gates. The assignment is due on Wednesday 4/02/2020 and students are instructed to show their work and not just final answers.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 5

    Assignment 6: Transistor/Gate/Logic

    Due date: Wednesday 4/02/2020


    Written Assignment (120 points in total)
    Show your solution steps of each problems. Please do not just show the final answer.

    1. CMOS Transistor Complements (15 points each, 45 points in total)


    Only half of the CMOS circuit is shown. Draw the other half using p-type or n-type transistors
    to complete the circuit. After your drawing, determine the Boolean function that the circuit
    represents(Y=?).Be sure to:
    • use the correct symbol for each transistor (with a little circle for p-type, without for n-type) •
    label the control input of each transistor
    • draw connection to ground or power supply as appropriate, and
    • draw right on top of the figure, where the missing portion is indicated by “?”

    a)

    b)
    c)
    2. From Boolean Formulas to CMOS (25 points)
    For this part, you are to draw a single CMOS gate that implements the given function, using
    transistors. That is, draw a single gate with complementary pull-up and pull-down networks
    (using p- type and n-type transistors, respectively). Be sure that the circuit you draw
    corresponds exactly to the expressions given, i.e., do not perform any simplification.

    Y = ( AB+C )( D+ E )
    3 Truth Tables (20 points)
    For this task, simply draw a truth table corresponding to the given circuit. If there are more
    than one outputs, draw them as separate columns in the same truth table.

    From the truth table, do you recognize what this circuit does?
    4 Sum of Products (15 points each, 30 points total)
    For this task, do the following in this order: (i) first draw a truth table, (ii) then give the sum-of-
    products Boolean expression for the output, and (iii) finally, draw a circuit diagram. You may
    only use inverters, AND gates and OR gates for your circuit. The AND and OR gates can have
    two or more than two inputs, as many as you need. You may assume that for each input, its
    complement is also available (e.g., both A and A are both available).

    a) Implement a function F whose inputs are A, B and C, such that the value of F is 1 if and
    only if an odd number of inputs (i.e., one or three inputs) is 1. Do not simplify the
    expression.

    b) Simplify the expression in a) and redraw the circuit.

    You might also like