Skip to content

VLSIFacts

Let's Program the Transistors

  • Home
  • DHD
    • Digital Electronics
    • Fault Tolerant System Design
    • TLM
    • Verification
    • Verilog
    • VHDL
    • Xilinx
  • Embedded System
    • 8085 uP
    • 8086 uP
    • 8051 uC
  • VLSI Technology
    • Analog Electronics
    • Memory Devices
    • VLSI Circuits
  • Interview
    • Interview Experience
    • Training Experience
    • Question Bank
  • Notifications
  • QUIZ
  • Community
  • Job Board
  • Contact Us

Rules of Binary Arithmetic

Posted on March 8, 2023June 19, 2025 By vlsifacts No Comments on Rules of Binary Arithmetic

Binary arithmetic is essential in all digital computers and in many other types of digital systems. Now, since we know about different number systems and signed numbers, this is the right time to learn about binary arithmetic and the associated rules.

First, we would learn about the basic rules of binary arithmetic, and solve some examples for unsigned magnitude numbers. Later, we will solve more examples for signed binary numbers (very much important from the exam point of view).

Binary Addition

The basic rules of binary addition are as below:

  • 0 + 0 = 0 Sum of 0 with a carry of 0
  • 0 + 1 = 1 Sum of 1 with a carry of 0
  • 1 + 0 = 1 Sum of 1 with a carry of 0
  • 1 + 1 = 0 Sum of 0 with a carry of 1

Example: Perform the binary addition of 110 + 11.

Solution:

Example binary addition

Binary Subtraction

The basic rules of binary subtraction are as below:

  • 0 – 0 = 0
  • 1 – 1 = 0
  • 1 – 0 = 1
  • 10 – 1 = 1 0 – 1 with a borrow of 1

In binary, whenever a ‘1’ is subtracted from a ‘0’, then a ‘1′ is borrowed from the next column to the left.

Example: Perform the binary subtraction of 110 – 11.

Solution:

Example binary subtraction

Binary Multiplication

The basic rules of binary multiplication are as below:

  • 0 × 0 = 0
  • 0 × 1 = 0
  • 1 × 0 = 0
  • 1 × 1 = 1

Multiplication in the case of binary numbers is similar to decimal multiplications. The partial products are computed, and each successive partial product is shifted by one place left and then added to get the final multiplication result.

Example: Perform the binary subtraction of 110 × 11.

Solution:

Example binary multiplication

Binary Division

The process of division is exactly the same as decimal division. We can realize the same from the following example.

Example: Perform the binary division of 110 ÷ 11.

Solution:

Example binary division

The binary arithmetic, which we discussed till now, is for unsigned magnitude numbers that deal with only positive numbers. However, computers deal with signed numbers (both positive and negative numbers). 2’s complement form for representing signed numbers is the most widely used in computer and microprocessor-based systems. So, we would first cover the 2’s complement arithmetic. We will primarily discuss the addition operation. Subtraction operation can be seen as the addition of negative numbers (check the “Addition” article). Multiplication and Division can be thought of as repeated addition and repeated subtraction, respectively. However, if you want separate articles for 2’s complement multiplication and division, then please mention it in the comment section.

  • Addition of 2’s complement signed binary numbers
  • Overflow Concept

Also, read Arithmetic of 1’s complement signed binary numbers. But, I would again emphasize that computers use 2’s complement notations. Additionally, go through the rules of hexadecimal arithmetic.

Previous           Table of Content           Next

Spread the Word

  • Click to share on Facebook (Opens in new window) Facebook
  • Click to share on X (Opens in new window) X
  • Click to share on LinkedIn (Opens in new window) LinkedIn
  • Click to share on Pinterest (Opens in new window) Pinterest
  • Click to share on Tumblr (Opens in new window) Tumblr
  • Click to share on Pocket (Opens in new window) Pocket
  • Click to share on Reddit (Opens in new window) Reddit
  • Click to email a link to a friend (Opens in new window) Email
  • Click to print (Opens in new window) Print

Like this:

Like Loading...

Related posts:

  1. Introduction to Number System
  2. Representation of Number System
  3. Binary to Octal and Binary to Hexadecimal Conversion for Fractional Number
  4. Understanding Overflow through Examples
Digital Electronics Tags:1's complement addition, 2's complement addition, Binary Arithmetic, Number System

Post navigation

Previous Post: Unsigned Magnitude vs Signed Magnitude Representation
Next Post: Why does Global Chip Shortage Happen

Leave a Reply Cancel reply

Your email address will not be published. Required fields are marked *

Top Posts & Pages

  • ASCII Code
  • Different Coding Styles of Verilog Language
  • Truth Tables, Characteristic Equations and Excitation Tables of Different Flipflops
  • NAND and NOR gate using CMOS Technology
  • Difference between $display, $monitor, $write and $strobe in Verilog

Copyright © 2025 VLSIFacts.

Powered by PressBook WordPress theme

Subscribe to Our Newsletter

%d