Mips Alu

MIPS ALU
Building from the adder to ALU

ALU Arithmetic Logic Unit, does the major calculations in the computer, including
Add And Or Sub
In MIPS, the ALU takes two 32-bit inputs and produces one 32-bit output, plus some additional signals Add is only one of the functions, and in this lecture, we are going to see how an full ALU is designed
ALU
Review
1-bit full adder
32-bit adder
Building 32-bit ALU with 1-bit ALU

Build 32-bit ALU with 1-bit ALU. Deal with the easy ones first and and or
And and Or operations

And
a b And result
Or
a b Or result
Putting them together

Sometimes the instruction is add, sometimes it is or, sometimes is and, how to put them together? In MIPS instructions, there are many fields: op, funct, rs, rt, rd, shamt
Putting them together

Just do everything (add, and, or) and then select one AS the output with a selector.
Subtraction?
How to implement subtraction?
Subtraction
Using twos complement representation, we can implement subtraction through addition The reason is that a negative number -b in 2s complement is actually 2n-b. So if you do a+2n-b and take only the lower n bits, it becomes a-b because 2n is a one bit at bit n (bit indices are 0,1,2,, n-1, n). What do we need to add to the ALU we have in order to be able to perform subtraction?
11
1-Bit ALU That can Do Subtraction

To do a-b, three things: 1. Invert every bit of b. 2. Add 1. 3. Add with a. So, if it is a subtraction, invert the second operand, set the CarryIn of the last one-bit full adder to be 1, then select the adder output.
12
Subtraction
Notice that every time we want the ALU to subtract, we set both CarryIn and Binvert to 1. For add or logical operations, we want both control lines to be 0. We can therefore simplify control of the ALU by combining the CarryIn and Binvert to a single control line called Bnegate.
Supporting Branch Instructions

We need to be able to test if two numbers are the same
14
Supporting Set Less Than

Set less than instruction produces 1 if rs < rt, and 0 otherwise
It needs to set all but the least significant bit to 0 The least significant bit is set according to the comparison
Which can be done using subtraction
That is, do a subtraction, check the sign bit (bit 31).

15
Complication
If we only use the sign bit of the adder, sometimes we will be wrong
For the following example (using 4 bits only), we have
Then we have 7ten 6ten, which is clearly wrong

16
Overflow
The problem is that sometimes we have overflow.
If we have only 4 bits, a number greater than 7 or a number less than -8 will cause an overflow because it cannot be represented in 4 bits. In the previous example, -7-6=-13, overflowed.
Dealing with overflow

Overflow happens when the two numbers are of the same sign.
If they are of different signs, the addition result will be less than the larger one (the absolute value) and should be still within the range, assuming the two original numbers are within the range.
Overflow Detection
One way to detect overflow is to check whether the sign bit is consistent with the sign of the inputs when the two inputs are of the same sign if you added two positive numbers and got a negative number, something is wrong, and vice versa.
19

For two positive numbers, after the addition,
The carryout of ALU31 must be 0, because in 2s complement, positive numbers go from 0001 to 011..1. The largest number is 0111 and adding two 0111 will lead to 11110, the carry out is still 0. if no overflow, the sign bit (bit 31) should be 0, because the result is a positive number. If overflowed, the sign bit (bit 31) will be 1, caused by a carryin to ALU31.

For two negative numbers, after the addition,
The carryout of ALU31 must be 1, because in 2s complement, negative numbers go from 1000 to 111..1. Even if you are just adding two 1000, you will have 100000, the carry out is 1. if no overflow, the sign bit (bit 31) should be 1, because the result is a negative number. If overflowed, the sign bit (bit 31) will be 0, caused by having no carryin to ALU31.
Overflow Detection
So, we can detect the overflow by checking if the CarryIn and CarryOut of the most significant bit are different
22
Overflow
The sign bit is correct if there is no overflow If there is overflow, the sign bit will be wrong and needs to be inverted
23
32-bit ALU that Supports Set Less Than
24
Final 32-Bit ALU
Final 32-Bit ALU

ALU control lines are 1-bit Ainvert line, 1-bit Bnegate line, and 2-bit operation lines
26
ALU Symbol
27

Mips Alu

Uploaded by

Copyright:

Available Formats

Mips Alu

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Mips Alu

Uploaded by

Copyright:

Available Formats

MIPS ALU

Building from the adder to ALU

Building 32-bit ALU with 1-bit ALU

And and Or operations

Putting them together

Putting them together

1-Bit ALU That can Do Subtraction

Supporting Branch Instructions

Supporting Set Less Than

That is, do a subtraction, check the sign bit (bit 31).

Then we have 7ten 6ten, which is clearly wrong

Dealing with overflow

Dealing with overflow

Dealing with overflow

32-bit ALU that Supports Set Less Than

Final 32-Bit ALU

Final 32-Bit ALU

You might also like