Scribd
Upload
129 views13 pages

Code Conversion

The document describes the conversion between binary, gray code, excess-3 code and binary coded decimal. It provides truth tables and K-maps to derive the logic expressions for each conversion. Logic circuits are also shown for decoding binary to gray code, gray code to binary, and excess-3 code to binary coded decimal.

Uploaded by

Adhara Mukherjee
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
129 views13 pages

Code Conversion

The document describes the conversion between binary, gray code, excess-3 code and binary coded decimal. It provides truth tables and K-maps to derive the logic expressions for each conversion. Logic circuits are also shown for decoding binary to gray code, gray code to binary, and excess-3 code to binary coded decimal.

Uploaded by

Adhara Mukherjee
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

CODE CONVERSION

BINARY TO GRAY CODE CONVERSION:

BINARY CODE GRAY CODE


B4 B3 B2 B1 G4 G3 G2 G1
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

K-MAP FOR G4:

B2 B1
B4 B3 00 01 11 10
00 0 0 0 0

01 0 0 0 0

1 1 1 1
11

10 1 1 1 1

EXPRESSION: G4 = B4
K-MAP FOR G3:
B2 B1
B4 B3
00 01 11 10
00 0 0 0 0
01 1 1 1 1

11 0 0 0 0

1 1 1 1
10

EXPRESSION: G3 = B3 B4’ + B4 B3’ = B3 B4

K-MAP FOR G2:


B2 B1
B4 B3 00 01 11 10
00 0 1
0 1
01
1 1 0 0

11 1 1 0 0

0 0 1 1
10

EXPRESSION: G2 = B3 B2’ + B2 B3’ = B2 B3

B2 B1
K-MAP FOR G1:
B4 B3 00 01 11 10
00
0 1 0 1

01 0 1 0 1

11 0 1 0 1

0 1 0 1
10

EXPRESSION: G1 = B1 B2’ + B2 B1’ = B1 B2


LOGIC CIRCUIT FOR BINARY TO GRAY DECODER:
GRAY CODE TO BINARY CODE CONVERSION:

GRAY CODE BINARY CODE


G4 G3 G2 G1 B4 B3 B2 B1
0 0 0 0 0 0 0 0
0 0 0 1 0 0 0 1
0 0 1 1 0 0 1 0
0 0 1 0 0 0 1 1
0 1 1 0 0 1 0 0
0 1 1 1 0 1 0 1
0 1 0 1 0 1 1 0
0 1 0 0 0 1 1 1
1 1 0 0 1 0 0 0
1 1 0 1 1 0 0 1
1 1 1 1 1 0 1 0
1 1 1 0 1 0 1 1
1 0 1 0 1 1 0 0
1 0 1 1 1 1 0 1
1 0 0 1 1 1 1 0
1 0 0 0 1 1 1 1

K-MAP FOR B4:

G2 G1
G4 G3 00 01 11 10
00 0 0 0 0

01 0 0 0 0

11 1 1 1 1
1 1 1 1
10

EXPRESSION: B4 = G4
K-MAP FOR B3:

G2 G1
G4 G3 00 01 11 10
00 0 0 0 0

01 1 1 1 1

11 0 0 0 0
1 1 1 1
10

EXPRESSION: B3 = G4 G3
K-MAP FOR B2:

G2 G1
G4 G3 00 01 11 10
00 0 0 1 1

01 1 1 0 0

11 0 0 1 1

1 1 0 0
10

EXPRESSION: B2 = G4 G3 G2
K-MAP FOR B1:
G2 G1
G4 G3 00 01 11 10
00 0 1 0 1

01 1 0 1 0

11 0 1 0 1

1 0 1 0
10

EXPRESSION: B1 = G4 G3 G2 G1
LOGIC CIRCUIT FOR GRAY CODE TO BINARY DECODER:
XS-3 TO BCD CONVERSION:

EXCESS-3 CODE Binary Coded Decimal (BCD)


w x y z A B C D
0 0 0 0 X X X X
0 0 0 1 X X X X
0 0 1 0 X X X X
0 0 1 1 0 0 0 0
0 1 0 0 0 0 0 1
0 1 0 1 0 0 1 0
0 1 1 0 0 0 1 1
0 1 1 1 0 1 0 0
1 0 0 0 0 1 0 1
1 0 0 1 0 1 1 0
1 0 1 0 0 1 1 1
1 0 1 1 1 0 0 0
1 1 0 0 1 0 0 1
1 1 0 1 X X X X
1 1 1 0 X X X X
1 1 1 1 X X X X

K-MAP FOR D:

yz
wx 00 01 11 10
00 X X 0 X
1 1
01 0 0

11 1 X X X

10 1 0 0 1

EXPRESSION: D = z’
K-MAP FOR C:

yz
wx 00 01 11 10
00 X X 0 X
1 1
01 0 0

11 0 X X X

10 0 1 0 1

EXPRESSION: C = y’z + yz’ = y z

K-MAP FOR B:

yz
wx 00 01 11 10
00 X X 0 X

1
01 0 0 0

11 0 X X X
1 1 0 1
10

EXPRESSION: B = x’y’ + x’z’ + xyz = x yz


K-MAP FOR A:

yz
wx 00 01 11 10
00 X X 0 X

01 0 0 0 0

11 1 X X X
1
10 0 0 0

EXPRESSION: A = wx + wyz = w (x + yz)

LOGIC CIRCUIT FOR XS-3 TO BCD DECODER:


BCD TO XS-3 CONVERSION:

BCD EXCESS-3
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 0 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

K-MAP FOR w:

CD
AB 00 01 11 10
00 X X 0 X
1
01 1 1 1

X X X X
11

10 1 1 X X

EXPRESSION: w = A + BC + BD = A + B (C + D)
K-MAP FOR x:

CD
AB 00 01 11 10
00 1 1 1

01 1

11 X X X X
1 X X
10

EXPRESSION: x = B’C + B’D + BC’D’ = B (C + D)

K-MAP FOR y:

CD
AB 00 01 11 10
00 1 1

01 1 1

X X X X
11

10 1 X X

EXPRESSION: y = CD + C’D’ = C D
K-MAP FOR z:

CD
AB 00 01 11 10
00 1 1
1
01 1

X X X X
11

10 1 X X

EXPRESSION: z = D’

LOGIC CIRCUIT FOR BCD TO XS-3 DECODER:


BCD TO 7-SEGMENT DISPLAY DECODER:

DECIMAL A B C D C-SEGMENT
0 0 0 0 0 1
1 0 0 0 1 1
2 0 0 1 0 0
3 0 0 1 1 1
4 0 1 0 0 1
5 0 1 0 1 1
6 0 1 1 0 1
7 0 1 1 1 1
8 1 0 0 0 1
9 1 0 0 1 1

K-MAP FOR C – SEGMENT:

CD
AB 00 01 11 10
00 1
1 1 0
1
01 1 1 1

X X X X
11

10 1 1 X X
EXPRESSION: B + C’ + D
LOGIC CIRCUIT FOR SEGMENT ‘c’:

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy