CSCI 255 — Chapter 5 comments
The PowerPoint
Notes on the PowerPoint
- Slides 4–6: Full adder
- Slides 8–9: Ripple-carry adder: O(n) time &
O(n) space
- Slides 10–14: Carry-lookahead adder
- Slides 15–19: Prefix adder: O(log n) time &
O(n log n) space
- Slides 20–21: Adder performance with typical numbers
- Slides 22–29: Typical ALU operations
- Slides 30–33: Shifters
- Slides 34–36: Multiply and divide
- Divide and conquer — using a 16-bit gate multiplier for 32 bits
- Easy algorithm
- α = αhi<<16 + αlo
- β = βhi<<16 + βlo
- α×β =
((αhi×βhi)<<32) +
((αhi×βlo +
αlo×βhi)<<16) +
(αlo×βlo)
- Karasuba
algorithm — O(nlog2 3)
- A = αhi×βhi
- B = αlo×βlo
- C = (αhi + αlo)
×
(βhi + βlo)
- C - A - B = α × β
- Schönhage–Strassen multiplication used in GPM
- Binary shift-and-restore division in C
- Non restoring division
Slides 58–62: Counters and shifters
Slides 63–68: Memory structure
Slides 69–71: RAM vs ROM
Slides 72–77: DRAM vs SRAM
Slides 78–87: ROM
Slide 88: Register files
Slide 89: SystemVerilog memory
Slide 90: PLAs vs FPGAs
Slide 91–92: PLA
Slide 93–100: FPGA
IP core