Register Transfer and Micro-operations 1

Overview

 Register Transfer Language

 Register Transfer

 Bus and Memory Transfers

 Arithmetic Micro-operations

 Logic Micro-operations

 Shift Micro-operations

 Arithmetic Logic Shift Unit

CSE 211
Register Transfer and Micro-operations 2

MICROOPERATIONS

Computer system microoperations are of four types:

 Register transfer microoperations

 Arithmetic microoperations
 Logic microoperations
 Shift microoperations

CSE 211
Register Transfer and Micro-operations 3

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
CSE 211
Binary Adder

•The Add micro-operation requires registers that can hold the data and
the digital components that can perform the arithmetic addition.
•A Binary Adder is a digital circuit that performs the arithmetic sum
of two binary numbers provided with any length.
•A Binary Adder is constructed using full-adder circuits connected in
series, with the output carry from one full-adder connected to the
input carry of the next full-adder.
•The following block diagram shows the interconnections of four full-
adder circuits to provide a 4-bit binary adder.
Register Transfer and Micro-operations 5

Binary Adder

CSE 211
Register Transfer and Micro-operations 6

Binary Adder-Subtractor
A Binary Adder-Subtractor is a special type of circuit that is used to perform both
operations, i.e., Addition and Subtraction. The operation which is going to be used
depends on the values contained by the control signal. In Arithmetic Logical Unit, it
is one of the most important components.
Binary Adder-Subtractor
B3 A3 B2 A2 B1 A1 B0 A0

C3 C2 C1 C0
FA FA FA FA

C4 S3 S2 S1 S0

 Mode input M controls the operation

 M=0 ---- adder
 M=1 ---- subtractor

CSE 211
We assume that we have two 3 bit numbers, i.e., X=100 and Y=011, and feed them in
Full-Adder as an input.
A 0 = 0 A1 = 0 A2 = 1 and For M=1
B0 = 1 B 1 = 1 & B 2 = 0 B0⨁M=B0' and Cin=M1
So,
For M=0: S0 = A0+B0'+Cin
B0⨁M=B0 and Cin=M=0 , S0 = 0+0+1
So, from first Full-Adder S0=1 and C0=0
S0 = A0+B0+Cin , S0= 0+1+0 Similarly,
S0=1, C0=0 S1 = A1+B1'+C0
Similarly, S1 = 0+0+0
S1=A1+B1+C0, S1 = 0+1+0 S1=0 and C1=0
S1=1 and C1=0 Similarly,
Similarly, S2 = X2+Y2'+C1
S2 = A2+B2+C1, S2 = 1+0+0 S2 = 1+1+0
S2=1 and C2=0 S2=0 and C2=0
Thus, Thus,
X= 100 =4 X = 100 = 4
Y = 011 = 3 Y = 011 = 3
Sum = 0111 = 7 Difference = 001 = 1
Register Transfer and Micro-operations 8

Binary Incrementer

Binary Incrementer

A3 A2 A1 A0 1

x y x y x y x y
HA HA HA HA
C S C S C S C S

C4 S3 S2 S1 S0

CSE 211
Register Transfer and Micro-operations 9

Arithmetic Circuits
Cin
S1
S0

A0 X0 C0

S1 D0
S0
Y0
FAC1
B0 0
1 4x1
2
3
MUX
A1 X1 C1

S1 D1
S0
Y1
FA
B1 C2
0
1 4x1
2
3
MUX
A2 X2 C2

S1 D2
S0 FA
B2 Y2 C3
0
1 4x1
2
3
MUX
A3 X3 C3

S1 D3
S0 FA
B3 Y3 C4
0
1 4x1
2
3
MUX Cout
0 1

CSE 211