DIGITAL SYSTEMS TCE1111

ECB2212-Digital Electronics
Numbering Systems

Ms.K.Indra Gandhi
Asst Prof (Sr.Gr) /ECE
DIGITAL SYSTEMS TCE1111

• If two input bits are not equal, its output is a 1. But if

two input bits are equal, its output is a 0.
• So exclusiveOR gate can be used as a 2bit Comparator.

2
DIGITAL SYSTEMS TCE1111

• In order to compare binary numbers containing two bits

each,
an additional XOR gate is necessary

• 2 LSB of two numbers are compared by gate G1

• 2 MSB of two numbers are compared by gate G2

• 2 Inverters and 1 AND gate can be used

3
DIGITAL SYSTEMS TCE1111

Logic diagram for equality comparison of two 2-bit numbers..

XOR gate and inverter can be replaced by an XNOR symbol,

HOW?
4
DIGITAL SYSTEMS TCE1111

Contd...
• There are two different types of output relationship
between the two binary quantities;

• Equality output indicates that the two binary numbers

being compared is equal (A = B) and

• Inequality output that indicates which of the two binary

number being compared is the larger.

• That is, there is an output that indicates when A is

greater than B (A > B) and an output that indicates
when A is less than B (A < B).
5
DIGITAL SYSTEMS TCE1111

74LS85 (4bit magnitude comparator)

The 74LS85 compares two unsigned 4-bit binary

numbers , the unsigned numbers are A3, A2, A1, A0
and B3, B2, B1, B0.

Cascading Outputs
Inputs

6
DIGITAL SYSTEMS TCE1111

It has three active-HIGH outputs

Start with most significant bit in each number to determine the

inequality of 4-bit binary numbers A and B
• Output A<B will be HIGH if A3=0, and B3=1
• Output A>B will be HIGH if A3=1, and B3=0
• If A3=0, and B3=0 or A3=1, and B3=1, then examine the next lower
order bit position for an inequality.Only when all bits of A=B,
output A=B will be HIGH

7
DIGITAL SYSTEMS TCE1111

The general procedure used in comparator:

• Start with the highest-order bits (MSB)

• When an inequality is found, the relationship of the 2

numbers is established, and any other inequalities in lower-
order positions must be ignored

• THE HIGHEST ORDER INDICATION MUST TAKE

PRECEDENCE

8
DIGITAL SYSTEMS TCE1111

Example: Determine the A=B, A>B, and A<B outputs for the input numbers shown on the 4-bit comparator as given below.

Solution: The number on the A inputs is 0110 and the number on the B
inputs is 0011. The A > B output is HIGH and the other outputs (A=B
and A<B) are LOW
9
DIGITAL SYSTEMS TCE1111

Contd...
• In addition, it also has three cascading inputs:

• These inputs provides a means for expanding the

comparison operation by cascading two or more 4bit
comparator.

• To expand the comparator, the A<B, A=B, and A>B outputs

of the lowerorder comparator are connected to the
corresponding cascading inputs of the next higherorder
comparator.

10
DIGITAL SYSTEMS TCE1111

Contd...
• The lowest-order comparator must have a HIGH on the
A=B, and LOWs on the A<B and A>B inputs as shown in next
slide.

• The comparator on the left is comparing the lower-order

8bit with the comparator on the right with higherorder
8bit .

• The outputs of the lowerorder bits are fed to the cascade

inputs of the comparator on the right, which is comparing
the high-order bits.

• The outputs of the high-order comparator are the final

outputs that indicate the result of the 8bit comparison.
11
DIGITAL SYSTEMS TCE1111

An 8-bit magnitude comparator using two 4-bit comparators.

12
DIGITAL SYSTEMS TCE1111

13
DIGITAL SYSTEMS TCE1111

14
DIGITAL SYSTEMS TCE1111

15
DIGITAL SYSTEMS TCE1111

16
DIGITAL SYSTEMS TCE1111

Example :
Determine the output for the following sets of
binary
numbers to the comparator inputs in figure below.
(a) 10 and 10 (b) 11 and 10

Solution
( a )The output is 1 (b) The output is 0
17
DIGITAL SYSTEMS TCE1111

CODE CONVERTERS
• A code converter is a logic circuit that changes data
presented in one type of binary code to another type of
binary code, such as BCD to binary, BCD to 7segment,
binary to BCD, BCD to XS3, binary to Gray code, and Gray
code to binary.
• We know that, two digit decimal values ranging from 00
to 99 can be represented in BCD by two 4bit code
groups.

18
DIGITAL SYSTEMS TCE1111

BCD-to-Binary Conversion

One method of BCD-to-Binary code conversion uses adder

circuits :
1. The value, or weight, of each bit in the BCD number is
represented by a binary number

2. All of the binary representations of the weights of bits that

are 1s in the BCD number are added

3. The result of this addition is the binary equivalent of the

BCD number

19
DIGITAL SYSTEMS TCE1111

Contd...
For example, 4610 is represented as

• The MSB has a weight of 10, and the LSB has a weight
of 1.

• So the most significant 4bit group represents 40, and

the least significant 4bit group represents 6 as in
Table.
20
DIGITAL SYSTEMS TCE1111

Weight Table
21
DIGITAL SYSTEMS TCE1111
The binary equivalent of each BCD bit is a binary number
representing the BCD bit weight

22
DIGITAL SYSTEMS TCE1111

The result from the addition of the binary representation for

the weights of all the 1s in the BCD number is the binary
number that corresponds to the BCD number.

23
DIGITAL SYSTEMS TCE1111

Example :
Convert the BCD equivalent of 26 to binary.

Solution

24
DIGITAL SYSTEMS TCE1111

FOUR BIT BINARY TO GRAY CODE CONVERTER –DESIGN (1)…

MSB + + + + Binary code
0 1 1 0 1

TRUTH TABLE: Gray code

0 1 0 1 1
INPUT ( BINARY) OUTPUTS (GRAY CODE)
B3 B2 B1 B0 G3 G2 G1 G0
0 0 0 0 0 0 0 0
0 0 0 1 0 0 0 1
0 0 1 0 0 0 1 1
0 0 1 1 0 0 1 0
0 1 0 0 0 1 1 0
0 1 0 1 0 1 1 1
0 1 1 0 0 1 0 1
0 1 1 1 0 1 0 0
1 0 0 0 1 1 0 0
1 0 0 1 1 1 0 1
1 0 1 0 1 1 1 1
1 0 1 1 1 1 1 0
1 1 0 0 1 0 1 0
1 1 0 1 1 0 1 1
1 1 1 0 1 0 0 1
1 1 1 1 1 0 0 0
25
DIGITAL SYSTEMS TCE1111

FOUR BIT BINARY TO GRAY CODE CONVERTER –DESIGN (2)…

Simplification using K-maps:

26
DIGITAL SYSTEMS TCE1111
FOUR BIT BINARY TO GRAY CODE CONVERTER –DESIGN
(3)

Logic Diagram:

27
DIGITAL SYSTEMS TCE1111

FOUR BIT GRAY CODE TO BINARY CONVERTER –DESIGN (1)… MSB + + + + Gray code
1 0 1 0 0

• Truth Table:
Binary code
INPUT ( GRAY CODE) OUTPUTS (BINARY
1 1 ) 0 0 0

G3 G2 G1 G0 B3 B2 B1 B0

0 0 0 0 0 0 0 0
0 0 0 1 0 0 0 1
0 0 1 0 0 0 1 1
0 0 1 1 0 0 1 0
0 1 0 0 0 1 1 1
0 1 0 1 0 1 1 0
0 1 1 0 0 1 0 0
0 1 1 1 0 1 0 1
1 0 0 0 1 1 1 1
1 0 0 1 1 1 1 0
1 0 1 0 1 1 0 0
1 0 1 1 1 1 0 1
1 1 0 0 1 0 0 0
1 1 0 1 1 0 0 1
1 1 1 0 1 0 1 1
1 1 1 1 1 0 1 0
28
DIGITAL SYSTEMS TCE1111

FOUR BIT GRAY CODE TO BINARY CONVERTER –DESIGN (2)…

Simplification using K-Maps:

29
DIGITAL SYSTEMS TCE1111

FOUR BIT GRAY CODE TO BINARY CONVERTER –DESIGN (3)…

Simplification using K-Maps:

30
DIGITAL SYSTEMS TCE1111
FOUR BIT GRAY CODE TO BINARY CONVERTER –DESIGN
(4)
Logic Diagram:

31
DIGITAL SYSTEMS TCE1111

Exercise

1. Convert the binary number 0101 to Gray code with XOR

gates
2. Convert the gray code 1011 to binary with XOR gates

Solution:

32
DIGITAL SYSTEMS TCE1111

BCD to XS 3 code converter- Design (1)...

TRUTH TABLE FOR BCD TO XS3 CODE CONVERTER:

Input ( Std BCD code) Output ( XS3 Code)

A B C D w x y z
0 0 0 0 0 0 1 1
0 0 0 1 0 1 0 0
0 0 1 0 0 1 0 1
0 0 1 1 0 1 1 0
0 1 0 0 0 1 1 1
0 1 0 1 1 0 0 0
0 1 1 0 1 0 0 1
0 1 1 1 1 0 1 0
1 0 0 0 1 0 1 1
1 0 0 1 1 1 0 0
1 0 1 0 X X X X
1 0 1 1 X X X X
1 1 0 1 X X X X
1 1 1 0 X X X X
1 1 1 1 X X X X
33
DIGITAL SYSTEMS TCE1111

BCD to XS 3 code converter- Design (2)...

K-maps for simplification and simplified Boolean expressions

34
DIGITAL SYSTEMS TCE1111

BCD to XS 3 code converter- Design (3)...

• After the manipulation of the Boolean expressions

for using common gates for two or more outputs,
logic expressions can be given by
z=D’
y=CD+C’D’ = (C+D)’
x= B’C + B’D + BC’D’ = B’(C+D) + BC’D’
w= A + BC + BD = A + B (C+D)

35
DIGITAL SYSTEMS TCE1111

BCD to XS 3 code converter- Design (4)

36