- Home/
- GATE ELECTRICAL/
- GATE EE/
- Article

# Number Systems Study Notes for EE/EC

By BYJU'S Exam Prep

Updated on: September 25th, 2023

Number systems serve as the foundation for representing numerical values in various formats, allowing us to process and manipulate data efficiently. Among the numerous number systems, the binary system holds paramount importance due to its direct relevance to digital computing.

In this article, you will find the **Study Notes on Number Systems** which will cover the topics such as **Binary Codes, Representation of Numbers, Various codes and conversions, representation of Integers, 1’s and 2’s Complements.**

**Download GATE Electrical Engineering Revision Sheet and Formulae PDF**

**Binary Codes**

- Binary codes are codes which are represented in a binary system with modification from original ones.
- In general,
*N*bits can represent up to 2distinct values.^{N} - Conversely, to represent a range of M values, the number of bits required is [log
_{2 }M].

- The
*base*or*radix*of a number system is the number of digits present. The decimal numeral system has a base or radix of 10, where the set of 10 symbols (digits) is {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}. The weights are in powers of ten. - In general, a bases-
*b*number (*a*_{n}*a*…_{n-1}*a*._{0}*f*_{1}*f*_{2}…*f*)_{m}has the value_{b}- (
*a*×_{n}*b*) + (^{n}*a*×_{n-1}*b*) +…+ (^{n-1}*a*×_{0}*b*) + (^{0}*f*×_{1}*b*) + (^{-1}*f*×_{2}*b*) +…+ (^{-2}*f*×_{m}*b*)^{-m}

- (
**Weighted Binary System:**Weighted binary codes are those which obey the positional weighting principles, each position of a number represents a specific weight.

e.g., 8421, 2421, 5211

**Sequential Code:**A code is said to be sequential when two subsequent codes, seen as numbers in the binary representation, differ by one. The 8421 and excess-3 codes are sequential, whereas 2421 and 5211 codes are not.**Non-weighted Codes:**Non-weighted codes are codes that are not positionally weighted. That is each position within the binary number is not assigned a fixed value.**Reflective Code:**A code is said to be reflective when the code for 9 is a complement for the code for 0 and so is for 8 and 1 codes, 7 and 2, 6 and 3, 5 and 4. Codes 2421, 5211 and excess-3 are reflective, whereas the 8421 code is not.

**BCD (Binary Coded Decimal)**

- It is a straight assignment of the binary equivalent. To encode a decimal number using the common BCD encoding. Each decimal digit is stored in a 4-bit number.

- BCD encoding for number 127 would be

1 2 7

(0001 0010 0111) → BCD equivalent of 127

whereas the pure binary number would be (01111111)_{2}

**BCD**

Add (148 + 157) = ?

When the sum of 2 digits is greater than or equal to 9, then we need to add 6 i.e., 0110.

**2421 Code**

This is a weighted code, its weights are 2, 4, 2 and 1. A decimal number is represented in 4-bit form and the total 4 bits weight is

2 + 4 + 2 + 1 = 9.

Hence, 2421 code represents the decimal numbers from 0 to 9.

**Excess-3 Code**

Excess-3 is a non-weighted code used to represent decimal numbers. The code derives its name from the fact that each binary code is the corresponding 8421 code plus 0011 (3).

e.g.,

**Download Formulas for GATE Electrical Engineering – Electrical Machines PDF**

**Gray Code**

This is a variable weighted code and is cyclic. This means that it is arranged so that every transition from one value to the next value involves only one-bit Change.

**Binary to Gray Code Conversion**

- Write down the number in binary codes.
- The Most Significant Bit (MSB) of the gray code will be same as the MSB of binary code.
- Perform XOR operation on MSB and next bit to the MSB in a binary number.
- Repeat step 3 till all bits of the binary number have been XO Red, the resultant code is the gray code equivalent to the binary code.

**Gray Code to Binary Conversion**

- Start with the MSB of gray coded number.
- Copy this bit as the MSB of the binary number.
- Now, perform Ex-OR operation of this bit with the next bit of the binary number.
- Repeat step 3 till all bits of gray coded number have been used in XOR operation. The resultant number is the binary equivalent of the gray number.

**Complements**

- Complements are used in a digital computer system for simplifying the subtraction operation and for logical manipulation.
- There are two types of complements for each base r system,

- The r′ s complement
- The (r′ – 1)′s complement

**The r’s Complement**

Given a positive number N with base r with an integer part of n digits. The r’s complement of N is defined as r^{n} – N for N ≠ 0 and 0 for N = 0.

e.g., 10’s complement of (25.639)_{10} is (10^{2} – 25.639)

100 – 25.639 = 74 – 361, here the number of digits in integer part is 2

means n = 2

**The (r – 1)′s Complement**

Given, a positive number N in base r with an integer part of n digits and a fraction part of m digits, the (r – 1)’s complement of N is defined as r^{n} – r^{–m} – N.

- 1’s complement of (52520)
_{10}is (10^{5}– 1 – 52520)

= 99999 – 52520 = 47479

Because number of integer part is 5, so r^{n}= 10^{5}and no fractional part is

Present’ so r^{–m}= 10^{–0}= 1 - 1’s complement of (0.3267)
_{10}is (10^{0}– 10^{–4}– 0.3267)

= 1 – 0.0001 – 0.3267

= 0.9999 – 0.3267 = 0.6732

No integer part, so 10^{n}= 10^{0}= 1 - 1’s complement of (101100)
_{2}is (2^{6}– 2^{0})_{10}– (101100)_{2 }= (64 – 1)_{10}– (101100)_{2}= (63)_{10}= (101100)_{2}= 111111 – 101100 = 010011 **Key Points**- 520 → Here, n = 3, but (052) → here n = 2.
- In the latter example, 0 is of no significance.

**Representation of Integers**

- The are three possible ways to represent a number

- Signed magnitude method
- 1’s complement method
- 2’s complement method

**Signed Magnitude Method**- The number is divided into two parts, one is sign bit and another part for magnitude, In the example we are using 5-bit register to represent –6 and +6.

**The range of Number**For n bit register, MSB will be a sign bit and (n – 1) bits will be magnitude.

**Key Points**- The drawback of signed magnitude method is that 0 will be having 2 different representation one will be 10000 i.e., –0 and the other one will be 00000 + 0.

**1’s Complement Method**

- Positive numbers are represented in the same way as in sign magnitude method. If the number is negative, then it is represented using 1’s complement method. For this, we first need to represent the number with a positive sign and then take 1’s complement of this number.
- e.g., Suppose we are using a 5-bit register. The representation of –6 will be as below.

**Key Points**- The only drawback of 1’s complement method is that there are two different representation for zero, one is –0 and other is +0.

**2’s Complement Method**

- Positive numbers are represented in the same way as in sign magnitude. For representing a negative number, we take 2’s complement of the corresponding positive number.

**Properties of 2’s Complement**

- 2’s complement representation allows the use of binary arithmetic operations on signed integers, yielding the current 2’s complement result.
**Positive Numbers**Positive 2’s complement numbers are represented as the simple binary.**Negative Numbers**Negative 2’s complement numbers are represented as the binary number that when added to a positive number of the same magnitude equals zero.

**Also Read: ****Study Notes on Minimization**

**Download Formulas for GATE Electrical Engineering – Signals and Systems PDF**

If you are preparing for GATE and ESE, avail Online Classroom Program to get unlimited access to all the live structured courses and mock tests from the following link: