ESE534 Computer Organization HW1: Logic - University of Pennsylvania - Prof. A. Dehon, Assignments of Computer Architecture and Organization

Download ESE534 Computer Organization HW1: Logic - University of Pennsylvania - Prof. A. Dehon and more Assignments Computer Architecture and Organization in PDF only on Docsity! ESE534 Spring 2010 University of Pennsylvania Department of Electrical and System Engineering Computer Organization ESE534, Spring 2010 HW1: Logic Wednesday, January 13 Due: Monday, January 25, 12:00pm (except A.3, C.2 as noted) For all assignments in this class: Writeups must be done in electronic form and sub- mitted through blackboard. Use CAD or drawing tools where appropriate. Handwritten assignments and hand-drawn figures are not acceptable. You may do sections (A and B) or (B and C). C is primarily intended as a more challenging (interesting) alternative for students who have already had considerable experience with digital logic. You may use hierarchial schematics. Use of a schematic drawing program for circuits is encouraged. A: Basic Logic 1. Implement A > B out of 2-input nand gates; assume A and B are 4b unsigned numbers. (Hint: design the bit slice and show how the bit slices compose for 4b numbers.) 2. Using your comparison function from A.1, show logic for a spatial sorting function to sort 4, 4b inputs into ascending order. 3. Show the logic (RTL logic – i.e. logic equations and registers) for a simple vending machine. [Defer this to Monday, February 1 – return with HW2.] Inputs: n, d, and q, (nickle, dime, quarter) Output: v (vend), nc (nickle change) Function: Collect ≥30 cents, then vend and give change in nickles. • Don’t worry about running out of nickles to provide as change. • Include a diagram of your state-transition graph in your writeup. • Hint: It is probably easier not to use adders and datapath logic for this problem. Course Web Page: <http://www.seas.upenn.edu/~ese534/> 1