Question

MIPS ASSEMBLY LANGUAGE

Write MIPS code to convert binary to decimal: (01110001)₂ to (113)₁₀

.data  

binary_digit:       .word       0 1 1 1 0 0 0 1       # is 113 in decimal

.globl main

main:
# Load arguments to argument registers

# Call convert()
  
  # Print return value
# (it's in $v0, make sure to copy it before overwriting to print)
      
# Properly end program
  

convert:

# This label is where conversion of the current array will begin

# Arguments to "functions" in MIPS are passed in on $a# registers
#   in this case, $a0 = &array[0], $a1 = array.size()
  
# zero the loop counter
# zero the return register, i.e. running total

# beginning of loop
# If counter >= size, we've iterated every digit and it's time to return the running total
# Get bit at current index
      
# Calculate power to raise the current bit to
  
# Multiply current bit by 2^power using shift operation
# (Calculate 2^power using multiply loop)
# (Remember, sll $reg $reg 1   ===   $reg = $reg * 2)
  
# Add current_bit * 2^power to running total
# Increment index
# Start loop again
# end of loop

# Jump back to Return Address

Answer 1

Code to convert binary to decimal :-

                .data

msg1:                 .asciiz             "Enter a number in binary: "

msg2:                 .asciiz             "The resulting decimal number is: "

newline:              .space            "\n"

buffer                 .space              32

                       .text

main:

        li $v0, 4

       la $a0, msg1

      syscall

       li $v0, 8

la $a0,buffer                               #load space into address

      li $a1,33                                          #allot the byte space for string

       move $t2, $a0                          #save string to t2

         syscall

        li $s1,32                                 #set outer loop counter

        li $s2,30                                   #set inner loop counter

biToDecLoop:

         li $t0, '0'

         li $t1, '1'

         lb $t3, ($t2)

         beg $t3, $t0, binaryZero

         beg $t3, $t1, binaryOne

binaryZero:

         subi $s2, $s2, 1             #decrement inner loop counter

          j biToDecNext

binaryOne:

        add $t3, $t3, 1

        mul $t3, $t3, 2

       subi   $s2, $s2, 1                 #decrement inner loop counter

               bne $s2, $zero , binaryOne                     #loop executes until inner counter reaches zero

               move $t4, $t3                                

              add $t5, $t5, $t4        #t5 is the total that will be the resuting int

              li $t0, 32

             li $t1, 33

             beq   $s1, $t0, addTwo

             beg $s1, $t1, addOne

              j biToDecNext

addTwo:                                            #checking if there is a 1 in the second to last index of string

            add $t5, $t5 , 2                      #Add 2 to total($t5)

            j biToDecNext

addOne:                                            #checking if there is a 1 last index of string

          add $t5, $t5 1                          #add 1 to total ($t5)

            j biToDecNext

biToDecNext:

            add $t2, $t2, 1                       #get next character in string

                      subi $s1, $s1, 1                     #decrement outer loop counter

                      bne $s1, $zero, biToDecLoop                        #loop executes until counter reaches zero

end:

            li $v0, 4                   #output msg2

            la $a0, newline   

           syscall

          li $v0,4                    #output msg2

           la $a0,msg2

          syscall

#exiting the program

          li v0, 10

         syscall