Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
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.
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.
C
A
B
B C
A
5. F= [((CD) +B) A]'
7. F= ((C'+D')B)+A
8. F= (A+D+C)(B+E)