Micro Operation

Arithmetic M icrooperations

MICROOPERATIONS

• It is an elementary operations performed with the data stored in

registers. Computer system microoperations are of four types:
- Register transfer microoperations
- Arithmetic microoperations
- Logic microoperations
- Shift microoperations

Transfer - move data from one set of registers to another

Arithmetic - perform arithmetic on data in registers

Logic - manipulate data or use bitwise logical operations

Shift - shift data in registers

 Bus and M emory Transfers

REGISTER TRANSFER MICROOPERATIONS

A←B Transfer content of reg. B into reg. A

AR ← DR(AD) Transfer content of AD portion of reg. DR into reg. AR
A ← constant Transfer a binary constant into reg. A
ABUS ← R1, Transfer content of R1 into bus A and, at the same
time,
R2 ← ABUS transfer content of bus A into R2
AR Address register
DR Data register
M[R] Memory word specified by reg. R
M Equivalent to M[AR]
DR ← M Memory read operation: transfers content of
memory word specified by AR into DR
M ← DR Memory write operation: transfers content of
DR into memory word specified by AR
 Arithmetic M icrooperations

ARITHMETIC MICROOPERATIONS
• The basic arithmetic microoperations are
– Addition
– Subtraction
– Increment
– Decrement

• The additional arithmetic microoperations are

– Add with carry
– Subtract with borrow
– Transfer/Load
– etc. …

Summary of Typical Arithmetic Micro-Operations

R3 ← R1 + R2 Contents of R1 plus R2 transferred to R3
R3 ← R1 - R2 Contents of R1 minus R2 transferred to R3
R2 ← R2’ Complement the contents of R2
R2 ← R2’+ 1 2's complement the contents of R2 (negate)
R3 ← R1 + R2’+ 1 subtraction
R1 ← R1 + 1 Increment
R1 ← R1 - 1 Decrement
 Arithmetic M icrooperations

BINARY ADDER / SUBTRACTOR / INCREMENTER

Binary Adder

Binary Adder-Subtractor

Binary Incrementer
 Arithmetic M icrooperations
ARITHMETIC CIRCUIT
Cin
S1
S0
A0 X0 C0
S1 D0
S0 FA
B0 0 4x1 Y0 C1
1 MUX
2
3
A1 X1 C1
S1 FA D1
S0
B1 0 4x1 Y1 C2
1 MUX
2
3
A2 X2 C2
S1 FA D2
S0
B2 0 4x1 Y2 C3
1 MUX
2
3
A3 X3 C3
S1 FA D3
S0
B3 0 4x1 Y3 C4
1 MUX
2
3 Cout
0 1

S1 S0 Cin Y Output Microoperation

0 0 0 B D=A+B Add
0 0 1 B D=A+B+1 Add with carry
0 1 0 B’ D = A + B’ Subtract with borrow
0 1 1 B’ D = A + B’+ 1 Subtract
1 0 0 0 D=A Transfer A
1 0 1 0 D=A+1 Increment A
1 1 0 1 D=A-1 Decrement A
1 1 1 1 D=A Transfer A
 Logic Microoperations

LOGIC MICROOPERATIONS
• Specify binary operations on the strings of bits in registers
– Logic microoperations are bit-wise operations, i.e., they work on the
individual bits of data
– useful for bit manipulations on binary data
– useful for making logical decisions based on the bit value
• There are, in principle, 16 different logic functions that can
be defined over two binary input variables
A B F0 F1 F2 … F13 F14 F15
0 0 0 0 0 … 1 1 1
0 1 0 0 0 … 1 1 1
1 0 0 0 1 … 0 1 1
1 1 0 1 0 … 1 0 1

• However, most systems only implement four of these

– AND (∧), OR (∨), XOR (⊕), Complement/NOT
• The others can be created from combination of these
 Logic Microoperations

LIST OF LOGIC MICROOPERATIONS

• List of Logic Microoperations
- 16 different logic operations with 2 binary vars.
n
- n binary vars → 2 2 functions

• Truth tables for 16 functions of 2 variables and

the
corresponding
x 001 16 logic micro-operations
Boolean M icro-
Nam
1 Function Operation
F ←0
e
y 0
0100
00 F0 = 0 s
1 Clear
0001 F1 = xy F ←A ∧B
AND
0010 F2 = xy' F ← A ∧ B’
0011 F3 = x F ←A
Transfer A
0100 F4 = x'y F ← A’∧ B
0101 F5 = y F ←B
Transfer B
0110 F6 = x ⊕ y F←A⊕B
Exclusive-OR
0111 F7 = x + y F←A∨B OR
1000 F8 = (x + y)' F ← (A ∨ B)’ NOR
1001 F9 = (x ⊕ y)' F ← (A ⊕ B)’ Exclusive-
NOR
1010 F10 = y' F ← B’
Complement B
1011 F11 = x + y' F ←A ∨B
 Logic Microoperations

HARDWARE IMPLEMENTATION OF LOGIC MICROOPERATIONS

Ai
0
Bi

1
4X1 Fi
MUX
2

3 Select

S1
S0

Function
S1 S0 table
Output μ-
0 0 F=A∧B AND
operation
0 1 F=A∨B OR
1 0 F=A⊕B XOR
1 1 F = A’ Complement
 Logic Microoperations

APPLICATIONS OF LOGIC MICROOPERATIONS

• Logic microoperations can be used to manipulate individual
bits or a portions of a word in a register

• They can be used to change bit values, delete a group of bits

or insert new bit value in the register

• Consider the data in a register A. In another register, B, is bit

data that will be used to modify the contents of A

– Selective-set A←A+B
– Selective-complement A←A⊕B
– Selective-clear A ← A • B’
– Mask (Delete) A←A•B
– Clear A←A⊕B
– Insert A ← (A • B) + C
– Compare A←A⊕B
– ...
 Logic Microoperations

SELECTIVE SET

• In a selective set operation, the bit pattern in B is used to set

certain bits in A i.e. set to 1 ,the bits in register A where
there are corresponding 1’s in the register B.
• It does not affect bit position that have 0’s in register B

1 1 0 0 At
1010 B
1 1 1 0 At+1 (A ← A + B)

• If a bit in B is set to 1, that same position in A gets set to 1,

otherwise that bit in A keeps its previous value
 Logic Microoperations

SELECTIVE COMPLEMENT

• In a selective complement operation, the bit pattern in B is

used to complement certain bits in A

1 1 0 0 At
1010 B
0 1 1 0 At+1 (A ← A ⊕ B)

• If a bit in B is set to 1, that same position in A gets

complemented from its original value, otherwise it is
unchanged
 Logic Microoperations

SELECTIVE CLEAR

• In a selective clear operation, the bit pattern in B is used to

clear certain bits in A

1 1 0 0 At
1010 B
0 1 0 0 At+1 (A ← A ⋅ B’)

• If a bit in B is set to 1, that same position in A gets set to 0,

otherwise it is unchanged
• i.e. this operation clears to 0 the bits in A only where there
are corresponding 1’s in B.
 Logic Microoperations

MASK OPERATION

• In a mask operation, the bit pattern in B is used to clear

certain bits in A

• It is similar to selective clear operation except that the bits of

A are cleared only where there are corresponding 0’s in B

1 1 0 0 At
1010 B
1 0 0 0 At+1 (A ← A ⋅ B)

• If a bit in B is set to 0, that same position in A gets set to 0,

otherwise it is unchanged
 Logic Microoperations

CLEAR OPERATION

• In a clear operation, if the bits in the same position in A and

B are the same, they are cleared in A, otherwise they are set
in A

• Compare the word in A & B register and produces all 0’s

result if two number are equal.

1 1 0 0 At
1010 B
0 1 1 0 At+1 (A ← A ⊕ B)
 Logic Microoperations

INSERT OPERATION
• An insert operation is used to introduce a specific bit pattern
into A register, leaving the other bit positions unchanged
• This is done as
– A mask operation to clear the desired bit positions, followed by
– An OR operation to introduce the new bits into the desired
positions
– Example
» Suppose you wanted to introduce 1010 into the low order
four bits of A: 1101 1000 1011 0001 A (Original)
1101 1000 1011 1010 A
(Desired)

» 1101 1000 1011 0001 A (Original)

1111 1111 1111 0000 Mask
1101 1000 1011 0000 A (Intermediate)
0000 0000 0000 1010 Added bits
1101 1000 1011 1010 A (Desired)
 Micro-Operation Types
• Shift Operations
– Logical Shift shl A
shr A

– Arithmetic Shift ashl A

ashr A

– Circular Shift cil A

cir A
 Shift M icrooperations

LOGICAL SHIFT
• In a logical shift the serial input to the shift is a 0.
• A right logical shift operation:

• 11011001
0
0 1 1 0 1 1 0 1
0
• A left logical shift operation:
0
1 1 0 1 1 0 0 1 0

• In a Register Transfer Language, the following notation is used

– shl for a logical shift left
– shr for a logical shift right
– Examples:
» R2 ← shr R2
» R3 ← shl R3
 Shift M icrooperations

CIRCULAR SHIFT
• In a circular shift the serial input is the bit that is shifted out of
the other end of the register.

• A right circular shift operation:

• A left circular shift operation:

• In a RTL, the following notation is used

– cil for a circular shift left
– cir for a circular shift right
– Examples:
» R2 ← cir R2
» R3 ← cil R3
 Logical versus Arithmetic Shift

• A logical shift fills the newly created bit position with

zero:

• An arithmetic shift fills the newly created bit

position with a copy of the number’s sign bit:
 Shift M icrooperations

ARITHMETIC SHIFT
• An left arithmetic shift operation must be checked for the
overflow
0
sign
bit

Before the shift, if the leftmost two

V bits differ, the shift will result in an
overflow

• In a RTL, the following notation is used

– ashl for an arithmetic shift left
– ashr for an arithmetic shift right
– Examples:
» R2 ← ashr R2
» R3 ← ashl R3
 Shift M icrooperations

HARDWARE IMPLEMENTATION OF SHIFT MICROOPERATIONS

0 for shift right (down)

Serial Select 1 for shift left (up)
input (IR)

S
MUX H0
0
1
A0

A1 S
MUX H1
0
A2 1

A3
S
MUX H2
0
1

S
MUX H3
0
1

Serial
input (IL)
 Shift M icrooperations

ARITHMETIC LOGIC SHIFT UNIT

S3
S2 Ci
S1
S0

Arithmetic D i
Circuit
Select

Ci+1
0 4x1 Fi
1 MUX
2
3
Logic Ei
Bi Circuit
Ai
Ai-1 shr
Ai+1 shl

S3 S2 S1 S0 Cin Operation Function

0 0 0 0 0 F=A Transfer A
0 0 0 0 1 F=A+1 Increment A
0 0 0 1 0 F=A+B Addition
0 0 0 1 1 F = A + B + 1 Add with carry
0 0 1 0 0 F = A + B’ Subtract with
borrow
0 0 1 0 1 F = A + B’+ 1 Subtraction
0 0 1 1 0 F=A-1 Decrement A
0 0 1 1 1 F=A TransferA
0 1 0 0 X F=A∧B AND
0 1 0 1 X F=A∨B OR
0 1 1 0 X F=A⊕B XOR
0 1 1 1 X F = A’ Complement A
1 0 X X X F = shr A Shift right A
into F
1 1 X X X F = shl A Shift left A into
F