EECE 353: Digital Systems Design Lecture 10: Datapath ... - Courses

More documents

Recommendations

Info

Area vs. Speed In this example, we saw two implementations: Big and Fast Small and Slow In general, you can trade off area for speed. Ideally, if you double the number of functional units, then you can reduce the number of cycles by half. Rarely can you achieve this. Which is the right implementation? Depends on how fast you need the circuit to produce results. Larger circuits cost more (more chip area, more power, higher prob. of defects), so if you don’t need the speed, a small implementation is probably better. There is no general rule: as an engineer, it is up to you to choose a good implementation based on the specs you are designing to Lecture 10, Page 54
Summary of this very long lecture We saw a lot of examples of datapath and control circuits Do you need to regurgitate all the details of any of these examples on a test? No, but you might be asked to design a simple system that contains both a datapath and controller. But, if you understand these examples, you’ll be in a good position to do the design, and more importantly, in the real world once you graduate (or go on co-op). Lecture 10, Page 55
Page 1 and 2:
EECE 353: Digital Systems Design Le
Page 3 and 4: Real Systems All but the simplest s
Page 5 and 6: Exponent: A bit more complicated Wh
Page 7 and 8: Consider this simple datapath: If w
Page 9 and 10: We have to let this run for A cycle
Page 11 and 12: Here is a simple controller that do
Page 13 and 14: library ieee; use ieee.std_logic_11
Page 15 and 16: process(clk) begin if (clk’event
Page 17 and 18: Lecture 10, Page 17
Page 19 and 20: Top level diagram of what we will b
Page 21 and 22: State Machine: Lecture 10, Page 21
Page 23 and 24: Serial Multiplier Suppose we want t
Page 25 and 26: Top level diagram of what we will b
Page 27 and 28: State Machine: Lecture 10, Page 27
Page 29 and 30: This datapath looks something like
Page 31 and 32: Fully-Parallel Sorting First consid
Page 33 and 34: Suppose we want to sort k numbers:
Page 35 and 36: Lecture 10, Page 35
Page 37 and 38: Assume that the values to be sorted
Page 39 and 40: State S2: Load Register A with Ri a
Page 41 and 42: State S4: Load value of Rj into B 1
Page 43 and 44: State S5: A and B are compared, and
Page 45 and 46: State 6: Swap Ri and Rj (part 1) 0
Page 47 and 48: State S7: Swap Ri and Rj (part 2) 1
Page 49 and 50: State S8: Load A from Ri 1 0 Lectur
Page 51 and 52: State S8: S9 S1 S2 S8 S3 S7 S4 S5 L
Page 53: An alternative datapath: Tri-state
show all

EECE 353: Digital Systems Design Lecture 10: Datapath ... - Courses

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?