UNIT 5

TOPIC 1- Number System

A Digital system is an interconnection of digital modules and it is a system that manipulates discrete
elements of information that is represented internally in the binary form. Now a day’s digital systems
are used in wide variety of industrial and consumer products such as automated industrial machinery,
pocket calculators, microprocessors, digital computers, digital watches, TV games and signal processing
and so on.

Number System-Binary, Octal, Decimal, Hexadecimal - Conversion from one system to

another number system.
Number :
The way of quantifying anything , represented through various combination of symbols is called number.
Digit :
The various symbols representing a single number in any number system is called digit. E.g. Decimal
number system (Arabic numerals): Digits: 0,1,2,3,4,5,6,7,8,9.
Radix / Base (r) :
The maximum number of different digits of any number system. E.g Decimal NS, r =10
Number system:
The properly structured number formation is called Number system. In number system there are different
symbols and each symbol has an absolute value and also has place value.
In general a number in a system having base or radix ‘ r ’ can be written as
Number various combination digits according to position
Nr = [ Integer part . Fractional part ]
↑ Radix point
= dn dn-1...d1d0 . d-1d-2...d-m
The value,
N10 = dnx rn + dn-1x rn-1 +...+ d1x r1 + d0x r0 + d-1x r-1 + d-2x r-2 +...+ d-mx r-m
* The right most digit of any number is called Least Significant Digit
* The lef most digit of any number is called Most Significant Digit

TYPES OF NUMBER SYSTEM:-

There are four types of number systems. They are
1. Decimal number system
2. Binary number system
3. Octal number system
4. Hexadecimal number system
DECIMAL NUMBER SYSTEM:- •
The decimal number system contain ten unique symbols 0,1,2,3,4,5,6,7,8 and 9.

• In decimal system 10 symbols are involved, so the base or radix is 10.

• It is a positional weighted system.

BINARY NUMBER SYSTEM:-

• The binary number system is a positional weighted system.

• The base or radix of this number system is 2.

• It has two independent symbols, The symbols used are 0 and 1.

• A binary digit is called a bit

OCTAL NUMBER SYSTEM:-

• It is also a positional weighted system.

• Its base or radix is 8.

• It has 8 independent symbols 0,1,2,3,4,5,6 and 7.

• Its base 8 = 23 , every 3- bit group of binary can be represented by an octal digit.
HEXADECIMAL NUMBER SYSTEM:-

• The hexadecimal number system is a positional weighted system.

• The base or radix of this number system is 16.

• The symbols used are 0,1,2,3,4,5,6,7,8,9,A,B,C,D,E and F

• The base 16 = 24 , every 4 – bit group of binary can be represented by an hexadecimal digit.

CONVERSION FROM ONE NUMBER SYSTEM TO ANOTHER :-

1. BINARY NUMBER SYSTEM:-
(a) Binary to decimal conversion:- In this method, each binary digit of the number is multiplied by its
positional weight and the product terms are added to obtain decimal number.
(b) Binary to Octal conversion:- For conversion binary to octal the binary numbers are divided into
groups of 3 bits each, starting at the binary point and proceeding towards left and right.

(c) Binary to Hexadecimal conversion:- For conversion binary to hexadecimal number the binary
numbers starting from the binary point, groups are made of 4 bits each, on either side of the binary
point.

2. DECIMAL NUMBER SYSTEM:-

(a) Decimal to binary conversion:- In the conversion the integer number are converted to the desired
base using successive division by the base or radix.
For example: (i) Convert (52)10 into binary.
(b) Decimal to octal conversion:- To convert the given decimal integer number to octal, successively
divide the given number by 8 till the quotient is 0.

(c) Decimal to hexadecimal conversion:-

3. OCTAL NUMBER SYSTEM:-

(a) Octal to binary conversion:- To convert a given a octal number to binary, replace each octal digit by
its 3- bit binary equivalent.

(b) Octal to decimal conversion:- For conversion octal to decimal number, multiply each digit in the
octal number by the weight of its position and add all the product terms
(c) Octal to hexadecimal conversion:- For conversion of octal to Hexadecimal, first convert the given
octal number to binary and then binary number to hexadecimal

(4) HEXADECIMAL NUMBER SYSTEM :- (a)Hexadecimal to binary conversion:- For conversion of

hexadecimal to binary, replace hexadecimal digit by its 4 bit binary group

(b)Hexadecimal to decimal conversion:- For conversion of hexadecimal to decimal, multiply each digit in
the hexadecimal number by its position weight and add all those product terms.

((c) Hexadecimal to Octal conversion:- For conversion of hexadecimal to octal, first convert the given
hexadecimal number to binary and then binary number to octal

Arithmetic Operation-Addition, Subtraction, Multiplication, Division, 1’s & 2’s

complement of Binary numbers& Subtraction using complements method
1. BINARY ADDITION:-
The binary addition rules are as follows carry carry

0+0=0; 0+1=1; 1+0=1; 1+1=10, SUM, 1+1+1 = 1 1 SUM

2. BINARY SUBTRACTION:-
The binary subtraction rules are as follows
0-0=0; 1-1=0; 1-0=1; 0-1=11, with a borrow of 1

3. BINARY MULTIPLICATION:-
The binary multiplication rules are as follows
0x0=0; 1x1=1; 1x0=0; 0x1=0

4. BINARY DIVISION:-
The binary division is very simple and similar to decimal number system.
So we have only 2 rules 0 ÷ 1 = 0 1÷1=1
1’s COMPLEMENT REPRESENTATION :-
The 1’s complement of a binary number is obtained by changing each 0 to 1 and each 1 to 0.

2’s COMPLEMENT REPRESENTATION :-

The 2’s complement of a binary number is a binary number which is obtained by adding 1 to the 1’s
complement of a number.
2’s complement = 1’s complement + 1

SIGNED NUMBER :-
In sign – magnitude form, additional bit called the sign bit is placed in front of the number. If the sign
bit is 0, the number is positive. If it is a 1, the number is negative.
SUBSTRACTION USING COMPLEMENT METHOD :
1’s COMPLEMENT:-
In 1’s complement subtraction, add the 1’s complement of subtrahend to the minuend. If there is a
carry out, then the carry is added to the LSB. This is called end around carry. If the MSB is 0, the result is
positive. If the MSB is 1, the result is negative and is in its 1‘s complement form. Then take its 1’s
complement to get the magnitude in binary.

2’s COMPLEMENT:-
In 2’s complement subtraction, add the 2’s complement of subtrahend to the minuend. If there is a
carry out, ignore it. If the MSB is 0, the result is positive. If the MSB is 1, the result is negative and is in
its 2‘s complement form. Then take its 2’s complement to get the magnitude in binary.
 TOPIC 2 – Logic Gates
Logic gates: AND, OR, NOT, NAND, NOR, Exclusive-OR, Exclusive-NOR--Symbol,
Function, expression, truth table & timing diagram
LOGIC GATES:-
• Logic gates are the fundamental building blocks of digital systems.
• There are 3 basic types of gates AND, OR and NOT.
• Logic gates are electronic circuits because they are made up of a number of electronic devices and
components.
• Inputs and outputs of logic gates can occur only in 2 levels( logic 1, logic 0). These two levels are
termed HIGH and LOW, or TRUE and FALSE, or ON and OFF
• The table which lists all the possible combinations of input variables and the corresponding output of
any logic circuit/device, called a truth table.

DIFFERENT TYPES OF LOGIC GATES

NOT GATE (INVERTER):-

• A NOT gate, also called and inverter, has only one input and one output.
• It is a device whose output is always the complement of its input.
• The output of a NOT gate is the logic 1 state when its input is in logic 0 state and the logic 0 state
when its inputs is in logic 1 state.

AND GATE:-
• An AND gate has two or more inputs but only one output.
• The output is logic 1 state only when each one of its inputs is at logic 1 state.
• The output is logic 0 state even if one of its inputs is at logic 0 state.

OR GATE:-
• An OR gate may have two or more inputs but only one output.
• The output is logic 1 state, even if one of its input is 1
• The output is logic 0 state, only when each one of its inputs is in logic state.
NAND GATE:-
• NAND gate is a combination of an AND gate and a NOT gate.
• The output is logic 0 when each of the input is logic 1 and for any other combination of inputs, the
output is logic 1.
IC No.:- 7400 two input NAND gate

NOR GATE:-
• NOR gate is a combination of an OR gate and a NOT gate.
• The output is logic 1, only when each one of its input is logic 0 and for any other combination of inputs
the output is a logic 0 level.
IC No.:- 7402 two input NOR gate

EXCLUSIVE – OR (X-OR) GATE

• An X-OR gate is a two input, one output logic circuit.
• The output is logic 1 when one and only one of its two inputs is logic 1. When both the inputs is logic 0
or when both the inputs is logic 1, the output is logic 0.

EXCLUSIVE – NOR (X-NOR) GATE

• An X-NOR gate is the combination of an X-OR gate and NOT gate
• An X-NOR gate is a two input, one output logic circuit.
The output is logic 1 only when both the inputs are logic 0 or when both the inputs is 1.
• The output is logic 0 when one of the inputs is logic 0 and other is 1
Universal Gates & its Realisation
UNIVERSAL GATES:-
There are 3 basic gates AND, OR and NOT, there are two universal gates NAND and NOR.
Both NAND and NOR gates can perform all logic functions i.e. AND, OR, NOT, EXOR and EXNOR.
Topic 3-Boolean algebra, Boolean expressions, Demorgan’s Theorems.
BOOLEAN ALGEBRA INTRODUCTION:-
• Switching circuits are also called logic circuits, gates circuits and digital circuits.
• Boolean algebra is a system of mathematical logic. It is an algebraic system consisting of the set of
elements (0,1), two binary operators called OR and AND and unary operator called NOT.
• It is the basic mathematical tool in the analysis and synthesis of switching circuits.
• It is a way to express logic functions algebraically.

AXIOMS AND LAWS OF BOOLEAN ALGEBRA:-

Axioms or postulates of Boolean algebra are set of logical expressions that are accepted without proof
and upon which we can build a set of useful theorems.
Axiom 1: 0 . 0 = 0 Axiom 5: 0 + 0 = 0 Axiom 9: 1̄ = 0
Axiom 2: 0 . 1 = 0 Axiom 6: 0 + 1 = 1 Axiom 10: 0̄ = 1
Axiom 3: 1 . 0 = 0 Axiom 7: 1 + 0 = 1
Axiom 4: 1 . 1 = 1 Axiom 8: 1 + 1 = 1
1. Complementation Laws:-
The term complement simply means to invert, i.e. to changes 0s to 1s and 1s to 0s.
The five laws of complementation are as follows:
Law 1: 0̄ = 1
Law 2: 1̄ = 0
Law 3: if A = 0, then 𝐴̅ = 1
Law 4: if A = 1,then 𝐴¯ = 0
Law 5: 𝐴" = 0 (double complementation law)
2. OR Laws:-
 The four OR laws are as follows
Law 1: A + 0 = A (Null law)
Law 2: A + 1 = 1(Identity law)
Law 3: A + A = A
Law 4: A +𝐴̅ = 1
3. AND Laws:-
The four AND laws are as follows
Law 1: A . 0 = 0 (Null law)
Law 2: A . 1 = A (Identity law)
Law 3: A . A = A
Law 4: A .𝐴̅ = 0
4. Commutative Laws:-
Commutative laws allow change in position of AND or OR variables. There are two commutative
laws.
Law 1: A + B = B + A
Law 2: A . B = B . A
5. Associative Laws:-
The associative laws allow grouping of variables. There are 2 associative laws.
Law 1: (A + B) + C = A + (B + C)
Law 2: (A .B) C = A (B .C)
6. Distributive Laws:-
The distributive laws allow factoring or multiplying out of expressions. There are two distributive
laws.
Law 1: A (B + C) = AB + AC
Law 2: A + BC = (A+B) (A+C)
Proof:
RHS = (A+B) (A+C) = AA + AC + BA + BC
= A + AC + AB + BC
= A (1+ C + B) + BC
= A. 1 + BC ( 1 +C + B) = 1 + B = 1, FROM OR Law 2 )
= A + BC = LHS
7. Redundant Literal Rule (RLR):-
Law 1: A + 𝐴̅B = A + B
Proof
A + 𝐴̅B = (A + 𝐴̅) (A + B)
= 1. (A + B)
= A +B

Law 2: A(𝐴̅ + B) = AB
Proof
A(𝐴̅ + B) = A𝐴̅ + AB = 0 + AB = AB
8. Idempotence Laws:-
Idempotence means same value.
Law 1: A. A = A
Law 2: A+A=A
9. Absorption Laws:-
There are two laws:
 KIIT POLYTECHNIC

Law 1: A+A∙B=A
Proof: A+A∙B
= A (1 + B)
=A∙1=A

Law 2: A ( A + B) = A
Proof : A ( A + B)
=A∙A+A∙B
= A + AB
= A(1 + B)
=A∙1=A
12. De Morgan’s Theorem:-
De Morgan’s theorem represents two laws in Boolean algebra.
This law states that the complement of a sum of variables is equal to the product of their individual
complements.
Law 1: ¯¯¯= 𝐴̅∙ 𝐵
¯𝐴¯¯+̄¯¯𝐵 ¯

Law 2: ¯¯
𝐴 .¯¯𝐵¯ = 𝐴¯ + 𝐵
¯
This law states that the complement of a product of variables is equal to the sum of their individual
complements.

20