F08prelim1sol

# F08prelim1sol - ENGRD 2300 Introduction to Digital Logic...

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

ENGRD 2300: Introduction to Digital Logic Design Fall 2008 NET ID: ___________ ENGRD 2300 – Fall 2008 Prelim 1 Solutions Problem 1. (20 points) Construct a CMOS circuit for the Boolean expression Z = (C· (A+B))’ Make sure that your CMOS circuit follows all the design rules for connecting PMOS and NMOS transistors! The best solution has only six transistors. (This solution received a two point bonus.) 1

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

View Full Document
ENGRD 2300: Introduction to Digital Logic Design Fall 2008 NET ID: ___________ Alternatively you could have decomposed this circuit into the CMOS equivalents of a NOR, NOT, and NAND gate. Other solutions are also possible, but they must follow all the CMOS design rules. 2
ENGRD 2300: Introduction to Digital Logic Design Fall 2008 NET ID: ___________ Problem 2. (20 points) In this problem you will construct a function that outputs a 1 whenever the four bit input, ABCD, is a palindrome . E.g., the function should output 1 for the input 1001 and a 0 for the input 0101. a) Construct a truth table for your function. A B C D P 0 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 0 1 1 0 0 1 0 0 0 0 1 0 1 0 0 1 1 0 1 0 1 1 1 0 1 0 0 0 0 1 0 0 1 1 1 0 1 0 0 1 0 1 1 0 1 1 0 0 0 1 1 0 1 0 1 1 1 0 0 1 1 1 1 1 b) Fill in the following K-map according to your truth table from part a). Be sure to label your k- map with the inputs! 00 01 11 10 00 1 0 0 0 A 01 0 0 0 1 11 0 0 1 0 10 0 1 0 0 D C B Continued on next page… 3

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

View Full Document
ENGRD 2300: Introduction to Digital Logic Design Fall 2008 NET ID: ___________ c)
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 9

F08prelim1sol - ENGRD 2300 Introduction to Digital Logic...

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

View Full Document
Ask a homework question - tutors are online