MAGNITUDE

COMPARATOR

1
 MAGNITUDE COMPARATOR: DIGITAL
•COMPARATOR
It is a combinational logic circuit.
• Digital Comparator is used to compare the value of two
binary digits.
• There are two types of digital comparator (i) Identity Comparator
(ii) Magnitude Comparator.
• IDENTITY COMPARATOR: This comparator has only one
output terminal for when A=B, either A=B=1 (High) or A=B=0
(Low)
• MAGNITUDE COMPARATOR: This Comparator has three
output terminals namely A>B, A=B, A<B. Depending on the
result of comparison, one of these output will be high (1)
• Block Diagram of Magnitude Comparator is shown in Fig. 1

2
BLOCK DIAGRAM OF MAGNITUDE
COMPARATOR
A B
n-Bit n-Bit

n- Bit Digital Comparator

A<B A=B A>B

Fig. 1

3
1- Bit Magnitude Comparator:
• This magnitude comparator has two inputs A and B and three
outputs A<B, A=B and A>B.
• This magnitude comparator compares the two numbers of
single bits.
• Truth Table of 1-Bit Comparator
INPUTS OUTPUTS
A B Y1 (A<B) Y2 (A=B) Y3 (A>B)
0 0 0 1 0
0 1 1 0 0
1 0 0 0 1
1 1 0 1 0

4
K-Maps For All Three Outputs
: B B
B
A 0 1
A 0 1
0
1 0 0
A

K-Map for Y1 : A<B

Y1 = AB

5
K-Maps For All Three Outputs
: B B B B
B B
A A 0 1
0 1
A 0 1 A 1 0
0 0

1 0 0 1 0 1
A A
K-Map for Y2 : A=B
K-Map for Y :
Y1 = AB 1 A<B Y2 = AB+
AB

6
K-Maps For All Three Outputs
: B B B B
B B
A A 0 1
0 1
A 0 1 A 1 0
0 0

1 0 0 1 0 1
A A
K-Map for Y2 : A=B
K-Map for Y :
Y = AB 1 A<B Y2 = AB+ AB
1
B B
B
A 0 1
A 0 0
0
K-Map for Y2 : A>B
1 1 0
A

Y3 = AB
7
 Realization of One Bit Comparator

A
Y1 = A < B

B AB
AB
Y2 = A B + AB
A=B
AB
Y3 = A B
A>B
Y1 = AB
Y2 = AB+ AB
Y3 = AB

8
Realization of by Using AND , EX-NOR
gates
A
Y1 = A < B
AB
B

Y2 = A ⊕ B
A=B

Y3 = A B
A>B

9
2-Bit Comparator:
• A comparator which is used to compare two binary numbers each of
two
bits is called a 2-bit magnitude comparator.
• Fig. 2 shows the block diagram of 2-Bit magnitude comparator.
• It has four inputs and three outputs.
• Inputs are A0 ,A1,B0 and B1 and Outputs are Y1, Y2 and Y3

A0
A Y1
A1
2-Bit Comparator Y2
B0
B
B1 Y3

Input Output Fig. 2

10
GREATER THAN
(A>B)
A1 A0 B1 B0
1 0 0 1
1 1 1 0
0 1 0 0
1. If A1= 1 and B1= 0 then A>B
2. If A1 and B1 are same, i.e A1=B1=1 or A1=B1=0 and A0=1, B0=0
then A>B

LESS THAN (A<B)

Similarly,
1. If A1= B1=1 and A0= 0, B0=1, then A<B
2. If A1= B1= 0 and A0= 0, B0=1 then A<B

11
TRUTH
TABLE
INPUT OUTPUT
A1 A0 B1 B0 Y1=A<B Y2=(A=B) Y3=A>B
0 0 0 0 0 1 0
0 0 0 1 1 0 0
0 0 1 0 1 0 0
0 0 1 1 1 0 0
0 1 0 0 0 0 1
0 1 0 1 0 1 0
0 1 1 0 1 0 0
0 1 1 1 1 0 0
1 0 0 0 0 0 1
1 0 0 1 0 0 1
1 0 1 0 0 1 0
1 0 1 1 1 0 0
1 1 0 0 0 0 1
1 1 0 1 0 0 1
1 1 1 0 0 0 1 12
1 1 1 1 0 1 0
 K-Map for K-Map for A=B:
B1B0 A<B: A1A
B1B 0
A1A00 01 11 10 00 01 11 10
0 0
0 1 1 1 00 1 0 0 0
00
01 0 0 1 1 01 0 1 0 0

1 0 0 0 0 1 0 0 1 0
1 1
10 0 0 1 0 10 0 0 0 1

For A<B
Y1 = A1 A0 B0 + A1 B1 + A0 B1 B0

For A=B
Y2 = A1 A0 B1 B0 + A1 A0 B1 B0 + A1A0B1B0 + A1 A0 B1 B0
13
K-Map For
A>B
B1B0
A1A0
00 01 1 10
1
00 0 0 0 0

01 1 0 0 0

11 1 1 0 1

10 1 1 0 0

Y3 = A0 B1 B0 + A1 B1 + A1A0 B0

14
For A=B From
K-Map

Y2 = A1 A0 B1 B0 + A1 A0 B1 B0 + A1A0B1B0 + A1 A0 B1 B0
Y2 = A0 B0 (A1 B1 + A1B1 ) + A0B0 (A1 B1 + A1B1 )
Y2 = (A1 B1 + A1B1 ) (A0 B0 +
A0B0 ) Y2 = (A1 ⋅ B1 ) (A0 ⋅ B0 )

15
LOGIC DIAGRAM OF 2-BIT
COMPARATOR:
A B
A1 0 1 B0

A1 A0 B 0
A1 B 1 A< B
A0 B 1 B 0

A1 ⋅ B 1
A=B
A0 ⋅ B 0

A0 B 1 B 0

A1 A0 B0 A>
B
A1 B 1

16