MODULE COMPUTER ORGANIZATION AND ARCHITECTURE

CHAPTER 8: MICRO-OPERATIONS

Objectives:
a.) Discuss the basic classifications of Arithmetic Micro-operations.
b.) Identify the interconnections of four full-adder circuits to
provide a 4-bit binary adder.
c.) Describe the block diagram of a 4-bit combinational circuit
incrementer.

Lesson 1: Arithmetic Micro-operations

Arithmetic Micro-operations
In general, the Arithmetic Micro-operations deals with the operations performed on numeric
data stored in the registers.
The basic Arithmetic Micro-operations are classified in the following categories:
1. Addition
2. Subtraction
3. Increment
4. Decrement
5. Shift
Some additional Arithmetic Micro-operations are classified as:
1. Add with carry
2. Subtract with borrow
3. Transfer/Load, etc.
The following table shows the symbolic representation of various Arithmetic Micro-operations.

Symbolic Representation Description

R3 ← R1 + R2 The contents of R1 plus R2 are transferred to R3.

R3 ← R1 - R2 The contents of R1 minus R2 are transferred to R3.

Page 1
 MODULE COMPUTER ORGANIZATION AND ARCHITECTURE

R2 ← R2' Complement the contents of R2 (1's complement)

R2 ← R2' + 1 2's complement the contents of R2 (negate)

R3 ← R1 + R2' + 1 R1 plus the 2's complement of R2 (subtraction)

R1 ← R1 + 1 Increment the contents of R1 by one

R1 ← R1 - 1 Decrement the contents of R1 by one

Note: The increment and decrement micro-operations are symbolized by '+ 1' and '? 1'
respectively. Arithmetic operations like multiply and divide are not included in the basic set of
micro-operations.
Lesson 2: Binary Adder
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.

o The augend bits (A) and the addend bits (B) are designated by subscript numbers from
right to left, with subscript '0' denoting the low-order bit.
o The carry inputs starts from C0 to C3 connected in a chain through the full-adders. C4 is
the resultant output carry generated by the last full-adder circuit.
o The output carry from each full-adder is connected to the input carry of the next-high-
order full-adder.

Page 2
 MODULE COMPUTER ORGANIZATION AND ARCHITECTURE

o The sum outputs (S0 to S3) generates the required arithmetic sum of augend and addend
bits.
o The n data bits for the A and B inputs come from different source registers. For instance,
data bits for A input comes from source register R1 and data bits for B input comes from
source register R2.
o The arithmetic sum of the data inputs of A and B can be transferred to a third register or
to one of the source registers (R1 or R2).

For more knowledge about binary adder, please check the link provided;
https://www.youtube.com/watch?v=eOBMtnQrS-o

Lesson 3: Binary Adder-Subtractor

Binary Adder-Subtractor
The Subtraction micro-operation can be done easily by taking the 2's compliment of
addend bits and adding it to the augend bits.
Note: The 2's compliment can be obtained by taking the 1's compliment and adding one to the
least significant pair of bits. The 1's compliment can be implemented with inverters, and one can
be added to the sum through the input carry.
The Arithmetic micro-operations like addition and subtraction can be combined into one
common circuit by including an exclusive-OR gate with each full adder.
The block diagram for a 4-bit adder-subtractor circuit can be represented as:

Page 3
 MODULE COMPUTER ORGANIZATION AND ARCHITECTURE

o When the mode input (M) is at a low logic, i.e. '0', the circuit act as an adder and when
the mode input is at a high logic, i.e. '1', the circuit act as a subtractor.
o The exclusive-OR gate connected in series receives input M and one of the inputs B.
o When M is at a low logic, we have B⊕ 0 = B.
The full-adders receive the value of B, the input carry is 0, and the circuit performs A plus
B.
o When M is at a high logic, we have B⊕ 1 = B' and C0 = 1.
The B inputs are complemented, and a 1 is added through the input carry. The circuit
performs the operation A plus the 2's complement of B.

Lesson 4: Binary Incrementer

Binary Incrementer

The increment micro-operation adds one binary value to the value of binary variables
stored in a register. For instance, a 4-bit register has a binary value 0110, when incremented by
one the value becomes 0111.
The increment micro-operation is best implemented by a 4-bit combinational circuit
incrementer. A 4-bit combinational circuit incrementer can be represented by the following block
diagram.

o A logic-1 is applied to one of the inputs of least significant half-adder, and the other input
is connected to the least significant bit of the number to be incremented.
o The output carry from one half-adder is connected to one of the inputs of the next-higher-
order half-adder.
o The binary incrementer circuit receives the four bits from A0 through A3, adds one to it,
and generates the incremented output in S0 through S3.
o The output carry C4 will be 1 only after incrementing binary 1111.

Page 4
 MODULE COMPUTER ORGANIZATION AND ARCHITECTURE

Note: The 4-bit binary incrementer circuit can be extended to an n-bit binary incrementer by
extending the circuit to include n half-adders. The least significant bit must have one input
connected to logic-1. The other inputs receive the number to be incremented or the carry from
the previous stage.

For more knowledge about being a Binary Adder-Subtractor , please check the link
provided; https://www.youtube.com/watch?v=JSa6BtQRjkI

REFERENCES

https://www.javatpoint.com/coa-arithmetic-micro-operations
https://www.javatpoint.com/coa-binary-adder
https://www.javatpoint.com/coa-binary-adder-subtractor
https://www.javatpoint.com/coa-binary-incrementer

Page 5