Scribd Logo
Загрузить

Добро пожаловать в Scribd!

  • Excellent Exam CMOS - Solution PDF

    Загружено:

    Neeraj Kalra
    241 просмотров3 страницы
    The document provides solutions to drawing minimum CMOS transistor networks that implement various Boolean equations. For each equation provided, a schematic drawing of the CMOS transistor network is shown. The equations range in complexity from a single literal to combinations of literals using operators such as AND, OR, and NOT.

    Исходное описание:

    Оригинальное название

    excellent exam CMOS_solution.pdf

    Авторское право

    © © All Rights Reserved

    Доступные форматы

    PDF, TXT или читайте онлайн в Scribd

    Этот документ был вам полезен?

    Это неприемлемый материал?

    Пожаловаться на этот документ
    The document provides solutions to drawing minimum CMOS transistor networks that implement various Boolean equations. For each equation provided, a schematic drawing of the CMOS transistor network is shown. The equations range in complexity from a single literal to combinations of literals using operators such as AND, OR, and NOT.

    Авторское право:

    © All Rights Reserved
    Скачайте в формате PDF, TXT или читайте онлайн в Scribd
    Отметить как неприемлемый контент
    241 просмотров3 страницы

    Excellent Exam CMOS - Solution PDF

    Загружено:

    Neeraj Kalra
    The document provides solutions to drawing minimum CMOS transistor networks that implement various Boolean equations. For each equation provided, a schematic drawing of the CMOS transistor network is shown. The equations range in complexity from a single literal to combinations of literals using operators such as AND, OR, and NOT.

    Авторское право:

    © All Rights Reserved
    Скачайте в формате PDF, TXT или читайте онлайн в Scribd
    Отметить как неприемлемый контент
    из 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

    A B

    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 C

    B
    D
    C

    A
    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

    C 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

    B C

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

    6. F=(AB)' since F= [AB(A+B)]' on simplification results in F=(AB)'

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

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

    Вам также может понравиться