/
# R[d] # R[d]  # R[d] () # R[d] $r800000000000000000000010000104211111 # R[d] # R[d]  # R[d] () # R[d] $r800000000000000000000010000104211111

# R[d] # R[d] # R[d] () # R[d] $r800000000000000000000010000104211111 - PDF document

teresa
teresa . @teresa
Follow
343 views
Uploaded On 2020-11-23

# R[d] # R[d] # R[d] () # R[d] $r800000000000000000000010000104211111 - PPT Presentation

Rt Rt Rt 16IR150 0000001001 01010 00011 0000003126b2521b2016b1511b106b50 Rd Rd 00000000000000000000000001010000000000000000000000001010if shiftamt rs is unused 000000 ID: 821300

shift reg bits result reg shift result bits comp amount left register put 9sll 8addi hex 3srl 0x42 4srlv

Share:

Link:

Embed:

Download Presentation from below link

Download Pdf The PPT/PDF document "# R[d] # R[d] # R[d] () # R[d] $r800000..." is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.


Presentation Transcript

# R[d] # R[d] # R[d] () # R[d] $r800000
# R[d] # R[d] # R[d] () # R[d] $r800000000000000000000010000104211111111111111111111111111111111111111111111111110111101# R[t] # R[t] # R[t] 16::IR15-00000001001 01010 00011 00000031-26b25-21b20-16b15-11b10-6b5-0# R[d] # R[d] 00000000000000000000000001010000000000000000000000001010if shift_amt,

$rs is unused0000001001 01010 00011 00
$rs is unused0000001001 01010 00011 00001031-26b25-21b20-16b15-11b10-6b5-0&#x-- R;&#x[t] ;&#x-- R;&#x[t] ;# R[d] &#x-- R;&#x[t] ;&#x-- R;&#x[t] ;# R[d] 0000000000000000000000000101011100000000000000000000000000100000001001 01010 00011 00001131-26b25-21b20-16b15-11b10-6b5-0&#x-- R;&#x[t] ;&#x-- R;&

#x[t] ;# R[d] &#x-- R;&#x[t] ;&#x-- R;&#
#x[t] ;# R[d] &#x-- R;&#x[t] ;&#x-- R;&#x[t] ;# R[d] 000000000000000000000000010100110000000000000000000000000010000000000000000000000000010111110000000000000000000000000010$r3$r4$r5$r800000000000000000000010000104266example:addi $8,$0,0x42 # put two's comp. hex 42 into register 8addi $9,$0,

5 # put two's comp. 5 into registe
5 # put two's comp. 5 into register 9sll $2,$8,3 # shift bits of reg 8 left by 3, result in reg 2sllv $3,$8,$9 # shift bits of reg 8 left by amount in reg 9, # result in reg 3srl $4,$8,3 # shift bits of reg 8 right by 3, result in reg 4srlv $5,$8,$9 # sh

ift bits of reg 8 right by amount in reg
ift bits of reg 8 right by amount in reg 9, # result in reg 5$r3$r4$r5$r80000000000000000000001000010426600000000000000000000000001015addi $8,$0,0x42 # put two's comp. hex 42 into register 8addi $9,$0,5 # put two's comp. 5 into register 9sll $2,$8,3 # shift bits of reg

8 left by 3, result in reg 2sllv $3,$
8 left by 3, result in reg 2sllv $3,$8,$9 # shift bits of reg 8 left by amount in reg 9, # result in reg 3srl $4,$8,3 # shift bits of reg 8 right by 3, result in reg 4srlv $5,$8,$9 # shift bits of reg 8 right by amount in reg 9, # result in reg 500000000000000000

01000010000210528$r4$r5$r800000000000000
01000010000210528$r4$r5$r80000000000000000000001000010426600000000000000000000000001015addi $8,$0,0x42 # put two's comp. hex 42 into register 8addi $9,$0,5 # put two's comp. 5 into register 9sll $2,$8,3 # shift bits of reg 8 left by 3, result in reg 2sllv $3,$8,$9 # sh

ift bits of reg 8 left by amount in reg
ift bits of reg 8 left by amount in reg 9, # result in reg 3srl $4,$8,3 # shift bits of reg 8 right by 3, result in reg 4srlv $5,$8,$9 # shift bits of reg 8 right by amount in reg 9, # result in reg 5000000000000000000100001000021052800000000000000001000010000008402112$r

5$r8000000000000000000000100001042660000
5$r80000000000000000000001000010426600000000000000000000000001015addi $8,$0,0x42 # put two's comp. hex 42 into register 8addi $9,$0,5 # put two's comp. 5 into register 9sll $2,$8,3 # shift bits of reg 8 left by 3, result in reg 2sllv $3,$8,$9 # shift bits of reg 8 left

by amount in reg 9, # result in r
by amount in reg 9, # result in reg 3srl $4,$8,3 # shift bits of reg 8 right by 3, result in reg 4srlv $5,$8,$9 # shift bits of reg 8 right by amount in reg 9, # result in reg 5000000000000000000100001000021052800000000000000001000010000008402112000000000000000000000000

10008$r800000000000000000000010000104266
10008$r80000000000000000000001000010426600000000000000000000000001015addi $8,$0,0x42 # put two's comp. hex 42 into register 8addi $9,$0,5 # put two's comp. 5 into register 9sll $2,$8,3 # shift bits of reg 8 left by 3, result in reg 2sllv $3,$8,$9 # shift bits of reg 8

left by amount in reg 9, # result
left by amount in reg 9, # result in reg 3srl $4,$8,3 # shift bits of reg 8 right by 3, result in reg 4srlv $5,$8,$9 # shift bits of reg 8 right by amount in reg 9, # result in reg 500000000000000000010000100002105280000000000000000100001000000840211200000000000000000000

0000100080000000000000000000000000010200
000010008000000000000000000000000001020000000000000000000001000010426600000000000000000000000001015addi $8,$0,0x42 # put two's comp. hex 42 into register 8addi $9,$0,5 # put two's comp. 5 into register 9sll $2,$8,3 # shift bits of reg 8 left by 3, result in reg 2sllv $3,$8,

$9 # shift bits of reg 8 left by am
$9 # shift bits of reg 8 left by amount in reg 9, # result in reg 3srl $4,$8,3 # shift bits of reg 8 right by 3, result in reg 4srlv $5,$8,$9 # shift bits of reg 8 right by amount in reg 9, # result in reg 5addiuaddi andiorixoriShift (logical)Right variablesrlvRight

Related Contents


Next Show more