Scribd Logo
Upload

Welcome to Scribd!

  • CMOS Solution PDF

    Uploaded by

    Neeraj Kalra
    39 views3 pages
    The document provides examples of drawing minimum CMOS transistor networks that implement Boolean equations. It gives the equations and corresponding transistor network drawings for 8 examples. For each example it shows the transistor level implementation of the Boolean equation by drawing the appropriate connections between the available literals and their complements.

    Original Description:

    Original Title

    CMOS_solution.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document provides examples of drawing minimum CMOS transistor networks that implement Boolean equations. It gives the equations and corresponding transistor network drawings for 8 examples. For each example it shows the transistor level implementation of the Boolean equation by drawing the appropriate connections between the available literals and their complements.

    Copyright:

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

    CMOS Solution PDF

    Uploaded by

    Neeraj Kalra
    The document provides examples of drawing minimum CMOS transistor networks that implement Boolean equations. It gives the equations and corresponding transistor network drawings for 8 examples. For each example it shows the transistor level implementation of the Boolean equation by drawing the appropriate connections between the available literals and their complements.

    Copyright:

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

    CMOS Logic Design Solution

    1. Please draw the minimum CMOS transistor network that implements the functionality of Boolean equation
    F= ((A+B) C + D)'. You can assume both the original and complemented versions of each literal are available
    as gate inputs.

    B
    C
    A

    D
    F

    D
    C

    2. Please draw the minimum CMOS transistor network that implements the functionality of Boolean equation
    F= (A (B C + D))'. You can assume both the original and complemented versions of each literal are available as
    gate inputs.

    D
    A
    B

    B
    D
    C

    3. Please draw the minimum CMOS transistor network that implements the functionality of Boolean equation
    F= (A +(B' + CD)')'. You can assume both the original and complemented versions of each literal are available
    as gate inputs.
    F= (A +(B' + CD)')' = (A + B(CD)')' = (A + B (C' + D'))'
    C
    B
    D

    A
    F
    D

    A
    B

    4. Please draw the minimum CMOS transistor network that implements the functionality of Boolean equation
    F= (A' + B'C). You can assume both the original and complemented versions of each literal are available as
    gate inputs.
    F = (A' + B'C) = ((A' + B'C)')'= (A (B'C)')' = (A (B + C'))'
    C
    A
    B
    F
    C

    5. F= [((CD) +B) A]'

    6. F=(AB)' since F= [AB(A+B)]'

    7. F= ((C'+D')B)+A

    8. F= (A+D+C)(B+E)

    on simplification results in F=(AB)'

    You might also like