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

More documents

Recommendations

Info

Exponent: A bit more complicated The algorithm to be implemented in this block: P = 1; CNT = A-1; while (CNT >= 0) do P = P * X; CNT = CNT – 1; end while; Note 1: this isn’t VHDL or C, it just is pseudo-code to illustrate the algorithm. Note 2: We could write this in VHDL, but it would not be synthesizable. So, we have to design it using smaller processes (each one synthesizable) Rule that has never been mentioned before: A synthesizable process can only describe what happens in one clock cycle. This would take more than one clock cycle. So, it would not be synthesizable Lecture 10, Page 6
Consider this simple datapath: If we let this run for A clock cycles, we will produce our result -> This will work for any A Lecture 10, Page 7
Page 1 and 2: EECE 353: Digital Systems Design Le
Page 3 and 4: Real Systems All but the simplest s
Page 5: Exponent: A bit more complicated Wh
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 and 54: An alternative datapath: Tri-state
Page 55: Summary of this very long lecture W

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

Create successful ePaper yourself

Delete template?

Save as template?