Filter
Top Products
S3C2410A ARM INSTRUCTION SET
3-61
5. Overflow in unsigned multiply accumulate with a 64-bit result
UMULL Rl,Rh,Rm,Rn ; 3 to 6 cycles
ADDS Rl,Rl,Ra1 ; Lower accumulate
ADC Rh,Rh,Ra2 ; Upper accumulate
BCS overflow ; 1 cycle and 2 registers
6. Overflow in signed multiply accumulate with a 64-bit result
SMULL Rl,Rh,Rm,Rn ; 3 to 6 cycles
ADDS Rl,Rl,Ra1 ; Lower accumulate
ADC Rh,Rh,Ra2 ; Upper accumulate
BVS overflow ; 1 cycle and 2 registers
NOTE
Overflow checking is not applicable to unsigned and signed multiplies with a 64-bit result, since overflow
does not occur in such calculations.
PSEUDO-RANDOM BINARY SEQUENCE GENERATOR
It is often necessary to generate (pseudo-) random numbers and the most efficient algorithms are based on shift
generators with exclusive-OR feedback rather like a cyclic redundancy check generator. Unfortunately the sequence
of a 32-bit generator needs more than one feedback tap to be maximal length (i.e. 2^32-1 cycles before repetition),
so this example uses a 33-bit register with taps at bits 33 and 20. The basic algorithm is newbit:=bit 33 eor bit 20,
shift left the 33-bit number and put in newbit at the bottom; this operation is performed for all the newbits needed (i.e.
32 bits). The entire operation can be done in 5 S cycles:
; Enter with seed in Ra (32 bits),
; Rb (1 bit in Rb lsb), uses Rc.
TST Rb,Rb,LSR#1 ; Top bit into carry
MOVS Rc,Ra,RRX ; 33 bit rotate right
ADC Rb,Rb,Rb ; Carry into lsb of Rb
EOR Rc,Rc,Ra,LSL#12 ; (involved!)
EOR Ra,Rc,Rc,LSR#20 ; (similarly involved!) new seed in Ra, Rb as before
MULTIPLICATION BY CONSTANT USING THE BARREL SHIFTER
Multiplication by 2^n (1,2,4,8,16,32..)
MOV Ra, Rb, LSL #n
Multiplication by 2^n+1 (3,5,9,17..)
ADD Ra,Ra,Ra,LSL #n
Multiplication by 2^n-1 (3,7,15..)
RSB Ra,Ra,Ra,LSL #n