CS计算机代考程序代写 AI CSU22022, 10th Lecture, Dr. M. Manzke, Page: 1

CSU22022, 10th Lecture, Dr. M. Manzke, Page: 1

Timing

CSU22022, 10th Lecture, Dr. M. Manzke, Page: 2

Control Unit Design

Two contrasting approaches to
control unit design have evolved:

Hard-wired
Micro-coded

CSU22022, 10th Lecture, Dr. M. Manzke, Page: 3

Example

We will consider a shift-and-add multiply circuit
as an example of each design approach.
If A and B are n-bit unsigned integers.

To compute their product P:

P = A  B
Product = Multiplier  Multiplicand

CSU22022, 10th Lecture, Dr. M. Manzke, Page: 4

Bit Products

We can generate the bit products:

Pi i=0, n-1
 0 if ai=0 

Pi = aiB =  = ai  B
 B if ai=1 

j

PPj =  Pi2i = Pj2j + PPj-1
i=0

P = PPn-1

CSU22022, 10th Lecture, Dr. M. Manzke, Page: 5

Hand Multiplication

 P0
 P121

 P222

 P323

 P424

CSU22022, 10th Lecture, Dr. M. Manzke, Page: 6

Hardware Multiplication

a. Overflow temporarily occurred

CSU22022, 10th Lecture, Dr. M. Manzke, Page: 7

Binary Multiplier Diagram

CSU22022, 10th Lecture, Dr. M. Manzke, Page: 8

Binary Multiplier

The figure on the previous slide shows:
Datapath
Status signals Z and Q0
External Input
G = Go
Output

CSU22022, 10th Lecture, Dr. M. Manzke, Page: 9

Binary Multiplier ASM