Assignments

Assignments will be handed out in class from time to time.  Assignments will not be accepted late, as they are an integral part of the learning and design process of the course. 

Homework 1	1. Minimize F(a,b,c,d)= ∑(0,1,2,5,6,7,8,9,10,14) using Q-M algorithm. Download QM logic simplifier, get the result from it, and compare it with your answer. Screen capture! 2. Minimize the following function using the K-Map. F(A,B,C,D,E) = ∑ (0,1,3,4,5,7,8,9,10,12,13,21,24,25,26,28,29) 3. Read Chapter 2	Due by Sep. 27, 2011 by 10 am Solution
Project 1	Instructions, necessary files: verilog, vhdl	Oct. 4, 2011 by 10 am (extended to Oct. 11)
Presentation I	Linear Carry Select, Kogge-Stone, Carry Skip, Carry Save	Oct 13, 2011
Midterm		Oct. 27, 2011
Presentation II	Goldschmidt, Newton Raphson, Wallace Tree, Array	Nov. 1, 2011
Homework 2 and Project 2	CME433: Textbook Exercise (pp. 419-420): 4.12(1-6), Project 2 instruction EE800: Homework (First come first served) Amir: VLIW, Fateme: Superscalar, Hao: Dynamic branch prediction, Haibin: Register naming, Muolong: Dynamic scheduling, Zangen:Software pipelining, Qiong: Loop unrolling, Joel: EPIC	Nov. 17, 2011 Solution
Quiz 1	Textbook Ch4	Nov. 15, 2011
Quiz 2	Textbook Ch5	Nov. 22, 2011 Nov. 29, 2011
Homework 3 and Project 3	CME433: Textbook Exercise (pp. 551-552): 5.4(1-6), project (in-class) EE800: Textbook Exercise (pp. 550-551): 5.3(1-6), 5.4(1-6)	Nov. 25, 2011
Homework 4	Virtual memory (in-class)	Nov. 24, 2011