1'S,2'S,9'S,10'S COMPLEMENT METHOD OF SUBTRACTION
Subject Name: Analog & Digital Electronics
Subject Code: ESC-301
Student Name: Anirban Mandal
Roll No: 13030824043
Year: 2025-26
Semester: 3rd
Department: AIML
College Name: TECHNO MAIN SALTLAKE
INTRODUCTION
This presentation aims to provide a comprehensive and in-depth overview of the essential complement methods employed in
subtraction operations. These techniques are profoundly relevant in the foundational principles of digital electronics and the core
mechanics of computer arithmetic. Our exploration will reveal how these ingenious methods fundamentally simplify subtraction
operations, transforming what can be a complex process of 'borrowing' into straightforward addition problems. This conversion is not
merely an academic curiosity; it represents a fundamental concept crucial for achieving highly efficient, reliable, and swift digital
computation within processing units.
The underlying rationale for using complement methods stems from the design of digital circuits. Building hardware that can perform
both addition and subtraction directly is more complex and resource-intensive than creating circuits optimized solely for addition. By
converting subtraction into addition, digital systems can leverage the same adder circuits, significantly simplifying hardware design,
reducing complexity, and improving performance. This efficiency is paramount in processor design, where every gate and operation
contributes to the overall speed and power consumption of the device.
What Are Complements in Subtraction?
Complements offer an efficient way to perform subtraction, particularly in digital computing. This method elegantly converts a
subtraction problem into an addition problem, which is simpler and faster for electronic circuits and manual calculations.
The core process involves finding the complement of the number being subtracted (subtrahend) and then adding this to the number
from which it's being subtracted (minuend). Depending on the specific complement type and number system, a final adjustment (like
discarding an overflow bit or adding a carry) may be required.
In binary systems, 1's complement involves inverting bits, while 2's complement adds 1 to the 1's complement. These are essential for
representing negative numbers and computer arithmetic. For decimal systems, 9's complement is found by subtracting each digit
from 9, and 10's complement adds 1 to the 9's complement, simplifying manual calculations by avoiding borrowing.
1's Complement Method (Binary)
The 1's complement method is fundamental for binary subtraction, particularly in older computing systems.
Find 1's complement by flipping every bit (0 ³1, 1³0).
Add this complement to the minuend.
If there is a carry, add it back to the result (end-around carry).
Example: Subtract 5 (0101) from 9 (1001)
1's complement of 5 (0101) = 1010
Add to 9 (1001 + 1010) = 10011 (5-bit result)
Add carry '1' to lower 4 bits: 0011 + 1 = 0100 (4 decimal)
2's Complement Method (Binary)
The 2's complement is widely used in modern computers for Example: Subtract 6 (0110) from 13 (1101)
representing signed numbers and performing arithmetic
operations efficiently.
1's complement of 6 = 1001; add 1 ³ 1010 (2's complement)
Add to 13: 1101 + 1010 = 10111
Find 2's complement by taking 1's complement + 1.
Ignore carry ³ 0111 (7 decimal)
Add 2's complement of subtrahend to minuend.
Ignore carry beyond fixed bit length.
If no carry, result is negative in 2's complement form.
9's & 10's Complement Methods (Decimal)
These methods simplify decimal subtraction, making it useful Example: 470 - 231
for mental calculations and specific digital applications.
9's complement of 231 = 768
9's complement: subtract each digit from 9. 10's complement = 768 + 1 = 769
10's complement: 9's complement + 1. Add to 470: 470 + 769 = 1239 (discard carry '1')
Subtract by adding 10's complement of subtrahend to Result = 239
minuend.
³ positive result.
If carry occurs, discard it
If no carry, take 10's complement of sum ³ negative result.
Why Use Complement Methods?
Complement methods, whether 1's and 2's for binary or 9's and 10's for decimal, offer significant advantages in various computational
contexts.
Simplification of Subtraction: They transform subtraction operations into addition, which is fundamentally simpler for electronic
circuits and makes manual calculations less error-prone.
Efficiency in Digital Systems: In computers, especially older designs, implementing subtraction as addition simplifies hardware
design, leading to more compact and efficient arithmetic logic units (ALUs).
Handling Signed Numbers: The 2's complement system in particular is crucial for representing both positive and negative
numbers and performing arithmetic operations on them seamlessly within digital systems.
Foundation for Error Detection: Complements are also foundational in certain error detection schemes within digital
communications and data storage.
Reference
1. Digital Logic and Computer Design 3 M. Morris Mano
2. Fundamentals of Digital Circuits 3 A. Anand Kumar
3. [Link]