ECE314sp07_HW3

ECE314sp07_HW3 - ECE/CS 314 Spring 2007 Homework 3 Due...

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

1 ECE/CS 314 Spring 2007 Homework 3 Due Tuesday, March 6, 2007 before 10:00pm EST Homework Submission Policies 1. Show your work where appropriate. 2. Homework Assignments are done individually without calculators . 3. Homework must be typed and submitted in plain text or PDF format. No scanned PDF (or scanned ANYTHING) allowed. 4. All homework should be submitted through CMS. Under no circumstances should a submission be made by sending the completed assignments to a course staff by email, unless explicitly requested. (Make sure you are signed up for the class on CMS BEFORE the submission deadline.) 5. In general, late submissions will not be graded. However, if CMS is down prior to a deadline, please contact the course staff BEFORE the deadline and make a submission when the system is back up (it will not be penalized). 6. Questions may be directed to the ECE/CS 314 consultants.

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

View Full Document
2 Problem 1. (10 points) Consider the following Boolean expression F = X’YZ’ + W’X’Z’ + WY’Z + X’Y’Z’ + W’XZ’ (a) 3 pts. Construct the truth table for F (b) 3 pts. Draw the Karnaugh map, circle the prime implicants, and derive the minimized sum of product form for F. (c) 4 pts. Show that the first expression for F is equivalent to the minimized sum of product form for F using Boolean algebra. For each step of the derivation, mention which law of Boolean algebra you applied.
3 Problem 2. (10 points) (a) Draw the Karnaugh map, circle the prime implicants, and derive the minimized sum of product form for G=F’ (where F is the function from Problem 1). (b) Show that F=G’ using Boolean algebra. For each step of the derivation, mention which law of Boolean algebra you applied.

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

View Full Document
4 Problem 3. (10 points) Write a Verilog module that implements the function F from Problem 1. Your module may be either in the structural or dataflow style.
5 Problem 4 . (10 points) An 8-input , 1-bit multiplexer has 12 inputs, EN, S2, S1, S0, and D0, …, D7 and one output Y. The EN input acts as a an enable bit and the bits S2, S1, and S0 act as selection

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 09/01/2008 for the course ECE 3140 taught by Professor Mckee/long during the Spring '07 term at Cornell.

Page1 / 11

ECE314sp07_HW3 - ECE/CS 314 Spring 2007 Homework 3 Due...

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

View Full Document
Ask a homework question - tutors are online