The document discusses arithmetic micro-operations performed on binary data in CPU registers. It describes basic operations like addition, subtraction, incrementing and decrementing. Tables and circuits are provided to illustrate 4-bit binary addition, subtraction, incrementing and decrementing using full adders and half adders.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
37 views11 pages
CS 202 Arithmetic Micro Operations
The document discusses arithmetic micro-operations performed on binary data in CPU registers. It describes basic operations like addition, subtraction, incrementing and decrementing. Tables and circuits are provided to illustrate 4-bit binary addition, subtraction, incrementing and decrementing using full adders and half adders.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11
Arithmetic Micro-Operations(CS-202)
BY:- BALDEV RAM MALI
LECTURER- COMPUTER SCIENCE & ENGINEERING, GOVT. POLYTECHNIC COLLEGE, JODHPUR ( RAJ. ) Arithmetic Micro-Operations • The Arithmetic Micro-operations are operations which performed on binary data stored in the CPU registers. • The basic Arithmetic Micro-operations are following: ➢ Addition ➢ Subtraction ➢ Increment ➢ Decrement Arithmetic Micro-Operations Table
Symbolic Notation 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.
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
4-bit Binary Adder • The binary adder is constructed with full- adder circuits connected in cascade, with the output carry from one full-adder connected to the input carry of the next full-adder. • Figure- 1 shows the interconnections of four full-adders (FA) to provide a 4-bit binary adder. Figure-1 : 4-bit Binary Adder 4-bit Binary Adder-Subtractor • The subtraction of binary numbers can be done by means of 2’s complements that is subtraction A – B can be done by taking the 2's complement of B and adding it to A. • The addition and subtraction operations can be combined into one common circuit by including an exclusive-OR gate with each full- adder. • A 4-bit adder-subtractor circuit is shown in Figure-2. 4-bit Binary Adder-Subtractor • The mode input M controls the operation. When M = 0 the circuit is an adder and when M = 1 the circuit becomes a subtractor. • Each exclusive-OR gate receives input M and one of the inputs of B. When M = 0, we have B X-OR 0 = B. The full-adders receive the value of B, the input carry is O, and the circuit performs A plus B . • When M = 1, we have B X-OR 1 = B' and C0 = 1. The B inputs are all complemented and a 1 is added through the input carry. The circuit performs the operation A plus the 2's complement of B that is A-B is performed. 4-bit Binary Incrementor
• The increment micro-operation adds one to a
number in a register. • The diagram of a 4-bit binary incrementer circuit is shown in following figure. One of the inputs to the least significant half-adder (HA) is connected to logic-1 and the other input is connected to the least significant bit of the number to be incremented. 4-bit Binary Decrementor
• The decrement micro-operation subtract one
from a number in a register. • For performing 4-bit binary decrement micro- operation, we can use circuit of 4-bit Binary Adder-Subtractor of Figure-2, with taking given 4-bit number in register A , one in register B and mode M=1.