Scribd Logo
Upload

Welcome to Scribd!

  • 49 views

    CPE 232 Computer Organization MIPS Arithmetic - Part I

    Uploaded by

    makayabo
    MIPS Number Representations Converting 32-bit values into 32-bit values copy the most significant bit (the sign bit) into the "empty" bits 0010 -> 0000 0010 1010 -> 1111 1010 sign extend versus zero extend (lb vs. Lbu) must support the Arithmetic / Logic operations of the ISA add, addi, addiu, addu sub, subu, neg mult, multu, div,

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd

    CPE 232 Computer Organization MIPS Arithmetic - Part I

    Uploaded by

    makayabo
    49 views18 pages
    MIPS Number Representations Converting 32-bit values into 32-bit values copy the most significant bit (the sign bit) into the "empty" bits 0010 -> 0000 0010 1010 -> 1111 1010 sign extend versus zero extend (lb vs. Lbu) must support the Arithmetic / Logic operations of the ISA add, addi, addiu, addu sub, subu, neg mult, multu, div,

    Original Title

    03mipsalu I

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    MIPS Number Representations Converting 32-bit values into 32-bit values copy the most significant bit (the sign bit) into the "empty" bits 0010 -> 0000 0010 1010 -> 1111 1010 sign extend versus zero extend (lb vs. Lbu) must support the Arithmetic / Logic operations of the ISA add, addi, addiu, addu sub, subu, neg mult, multu, div,

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    49 views18 pages

    CPE 232 Computer Organization MIPS Arithmetic - Part I

    Uploaded by

    makayabo
    MIPS Number Representations Converting 32-bit values into 32-bit values copy the most significant bit (the sign bit) into the "empty" bits 0010 -> 0000 0010 1010 -> 1111 1010 sign extend versus zero extend (lb vs. Lbu) must support the Arithmetic / Logic operations of the ISA add, addi, addiu, addu sub, subu, neg mult, multu, div,

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    You are on page 1of 18

    CPE 232 Computer Organization MIPS Arithmetic Part I

    Dr. Gheith Abandah [Adapted from the slides of Professor Mary Irwin (www.cse.psu.edu/~mji) which in turn Adapted from Computer Organization and Design, Patterson & Hennessy, 2005, UCB]

    CPE 232 MIPS Arithmetic

    MIPS Number Representations

    32-bit signed numbers (2s complement):


    0000 0000 0000 0000 0000 0000 0000 0000two = 0ten 0000 0000 0000 0000 0000 0000 0000 0001two = + 1ten ... 0111 0111 1000 1000 ... 1111 1111 0000 0000 1111 1111 0000 0000 1111 1111 0000 0000 1111 1111 0000 0000 1111 1111 0000 0000 1111 1111 0000 0000 1110two 1111two 0000two 0001two = = = = + +

    maxint

    2,147,483,646ten 2,147,483,647ten 2,147,483,648ten 2,147,483,647ten

    MSB

    1111 1111 1111 1111 1111 1111 1111 1110two = 2ten 1111 1111 1111 1111 1111 1111 1111 1111two = 1ten

    minint

    LSB

    Converting <32-bit values into 32-bit values

    copy the most significant bit (the sign bit) into the empty bits 0010 -> 0000 0010 1010 -> 1111 1010 sign extend versus zero extend (lb vs. lbu)
    2

    CPE 232 MIPS Arithmetic

    MIPS Arithmetic Logic Unit (ALU)

    Must support the Arithmetic/Logic operations of the ISA


    add, addi, addiu, addu
    sub, subu, neg mult, multu, div, divu sqrt
    B 32 A 32

    zero ovf

    1
    1

    ALU 32 4 m (operation)

    result

    and, andi, nor, or, ori, xor, xori beq, bne, slt, slti, sltiu, sltu

    With special handling for


    sign extend addi, addiu andi, ori, xori, slti, sltiu zero extend lbu, addiu, sltiu no overflow detected addu, addiu, subu, multu, divu, sltiu, sltu
    3

    CPE 232 MIPS Arithmetic

    Review: 2s Complement Binary Representation


    -23 =

    Negate

    -(23 - 1) =

    1011 and add a 1 1010 complement all the bits

    Note: negate and invert are different!

    23 - 1 =

    2sc binary 1000 1001 1010 1011 1100 1101 1110 1111 0000 0001 0010 0011 0100 0101 0110 0111

    decimal -8 -7 -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6 7
    4

    CPE 232 MIPS Arithmetic

    Binary Addition

    CPE 232 MIPS Arithmetic

    Review: A Full Adder


    carry_in
    A 0 0 B 0 0 1 1 0 0 1 carry_in 0 1 0 1 0 1 0 carry_out 0 0 0 1 0 1 1 S 0 1 1 0 1 0 0

    A B

    1-bit Full Adder carry_out

    0 1 1 1

    S = A B carry_in

    (odd parity function)

    carry_out = A&B | A&carry_in | B&carry_in (majority function)


    How can we use it to build a 32-bit adder?

    How can we modify it easily to build an adder/subtractor?


    6

    CPE 232 MIPS Arithmetic

    A 32-bit Ripple Carry Adder/Subtractor

    Remember 2s complement is just

    add/sub A0 B0 A1

    c0=carry_in 1-bit FA c1 1-bit FA c2 1-bit FA c3 ... S0

    complement all the bits


    B0 if control = 0, !B0 if control = 1

    control (0=add,1=sub) B0

    B1 A2

    S1

    S2

    add a 1 in the least significant bit 0111 + 1001 1 1 0001

    B2

    A 0111 B - 0110 0001

    c31 A31 B31 1-bit FA S31

    c32=carry_out
    7

    CPE 232 MIPS Arithmetic

    Overflow Detection

    Overflow: the result is too large to represent in 32 bits Overflow occurs when

    adding two positives yields a negative or, adding two negatives gives a positive or, subtract a negative from a positive gives a negative or, subtract a positive from a negative gives a positive

    On your own: Prove you can detect overflow by:

    Carry into MSB xor Carry out of MSB, ex for 4 bit signed numbers
    1 0 1 1 0 0 1 1 1 1 1 1 0 7 3 6 + 1 0 1 1 0 1 0 1 0 1 1 0 1 1 4 5 7

    0 1

    CPE 232 MIPS Arithmetic

    Tailoring the ALU to the MIPS ISA

    Need to support the logic operations (and,nor,or,xor)


    Bit wise operations (no carry operation involved) Need a logic gate for each function, mux to choose the output Use subtraction to determine if (a b) < 0 (implies a < b) Copy the sign bit into the low order bit of the result, set remaining result bits to 0

    Need to support the set-on-less-than instruction (slt)


    Need to support test for equality (bne, beq)


    Again use subtraction: (a - b) = 0 implies a = b Additional logic to nor all result bits together

    Immediates are sign extended outside the ALU with wiring (i.e., no logic needed)
    9

    CPE 232 MIPS Arithmetic

    MIPS ALU

    Least-significant bits
    Function and or add sub slt Bnegate 0 0 0 1 1 Operation 00 01 10 10 11

    CPE 232 MIPS Arithmetic

    10

    MIPS ALU

    Most-significant bit

    Function and or add sub slt

    Bnegate 0 0 0 1 1

    Operation 00 01 10 10 11
    11

    CPE 232 MIPS Arithmetic

    MIPS ALU

    CPE 232 MIPS Arithmetic

    12

    Improving Addition Performance

    The ripple-carry adder is slow

    CPE 232 MIPS Arithmetic

    13

    Carry-Lookahead Adder

    Need fast way to find the carry

    Carry-Lookahead Circuit

    CPE 232 MIPS Arithmetic

    14

    Carry-Lookahead Adder

    Carry generate and carry propagate ai 0 0 1 1 bi 0 1 0 1 gi 0 0 0 1 pi 0 1 1 1

    gi = ai . bi pi = ai + bi

    CPE 232 MIPS Arithmetic

    15

    Carry-Lookahead Adder
    Carry Equations:
    c1 = g0 + p0c0

    c2 = g1 + p1c1 = g1 + p1g0 + p1p0c0

    c3 = g2 + p2c2 = g2 + p2g1 + p2p1g0 + p2p1p0c0

    c4 = g3 + p3c3 = g3 + p3g2 + p3p2g1 + p3p2p1g0 + p3p2p1p0c0


    16

    CPE 232 MIPS Arithmetic

    4-bit Carry-Lookahead Adder

    c0 c4 g0 p0 c3 c2 c1 a0 b0

    s0

    CPE 232 MIPS Arithmetic

    17

    Larger Carry-Lookahead Adders

    P = p0p1p2p3

    G = g3 + g2p3 + g1p2p3 + g0p1p2p3

    CPE 232 MIPS Arithmetic

    18

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy