CMOS_solution

# CMOS_solution - as gate inputs F=(A(B CD =(A B(CD =(A B(C D...

This preview shows pages 1–3. Sign up to view the full content.

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. A B C D D A B C F 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. B C D A B C D A

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
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
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: as gate inputs. F= (A +(B' + CD)')' = (A + B(CD)')' = (A + B (C' + D'))' C? D? B A A D? C? B F 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'))' B A C? B C? A F 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)...
View Full Document

## This note was uploaded on 04/15/2010 for the course CSE CSE140 taught by Professor Rosing during the Winter '10 term at UCSD.

### Page1 / 3

CMOS_solution - as gate inputs F=(A(B CD =(A B(CD =(A B(C D...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online