Scribd
Upload
2 views

Code Converter

The document describes various binary code converters, including Binary to BCD, BCD to Excess-3, and BCD to Gray code converters, detailing their truth tables and logic circuit designs. Each conversion process is explained with corresponding minterms and Karnaugh maps for simplification. Additionally, it includes a section on converting Gray code back to binary with its truth table and logic diagram.

Uploaded by

rajagopal
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views

Code Converter

The document describes various binary code converters, including Binary to BCD, BCD to Excess-3, and BCD to Gray code converters, detailing their truth tables and logic circuit designs. Each conversion process is explained with corresponding minterms and Karnaugh maps for simplification. Additionally, it includes a section on converting Gray code back to binary with its truth table and logic diagram.

Uploaded by

rajagopal
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 9

CODE CONVERTER

The Code converter is used to convert one type of binary code to another. There are
different types of binary codes like BCD code(Binary-Coded Decimal), gray code,
excess-3 code, etc. Different codes are used for different types of digital applications.

2.6.1 Binary to BCD code converter


For BCD code, 0 to 9 numbers represent the equivalent binary numbers. For the
numbers above 10, LSB of a decimal number is represented by its equivalent binary
number and MSB of a decimal number is also represented by their equivalent binary
numbers.
For example, the BCD code of 12 is represented as

The following truth table shows the conversion between the binary code input and the
BCD code output. As you see from the table, the 4-bit binary number is converted into
5-bit BCD code. Decimal code is added in the table to understand the equivalence of
Binary and BCD code.
The converter has 5 outputs D0, D1, D2, D3 and D4. From the truth table,
the minterms can be obtained for each output.
D4 = ∑m(10, 11, 12, 13, 14, 15)
D3 = ∑m(8, 9)
D2 = ∑m(4, 5, 6, 7, 14, 15)
D1 = ∑m(2, 3, 6, 7, 12, 13)
D0 = ∑m(1, 3, 5, 7, 9, 11, 13, 15)
The minterms are plotted in the karnaugh map and the simplified boolean expressions are
obtained. Learn, How to minimize a boolean function using K-map
Figure 2.6.1 Truth Table – Kmap –Binary to BCD Code Converter
[Source: https://www.electrically4u.com/code-converter-types-truth-table-and-logic-circuits/]
The digital logic circuit for Binary to BCD code converter is designed from the
simplified output expressions obtained from karnaugh map.

Figure 2.6.2 Binary to BCD Code Converter


[Source: https://www.electrically4u.com/code-converter-types-truth-table-and-logic-circuits/]

2.6.2 BCD to Excess-3 code converter


For this conversion process, 4-bit BCD code is considered as input, which is converted
into 4-bit Excess-3 code. Since 4-bit is considered for BCD code, the output is
produced only for the inputs from 0 to 9.
The truth table shown below has only the valid 4-bit BCD codes. For the remaining
input combinations, the output cannot be predicted. So they are don’t care outputs.
From the truth table, the minterms are obtained for each outputs(E3, E2, E1, E0).
E3 = ∑m(5, 6, 7, 8, 9), E2 = ∑m(1, 2, 3, 4, 9), E1 = ∑m(0, 3, 4, 7, 8), E0 = ∑m(0, 2, 4, 6,
8,) the minterms of each output in plotted in k-map and simplified
expression is obtained.
Figure 2.6.3 Truth Table BCD to Excess-3 code converter
[Source: https://www.electrically4u.com/code-converter-types-truth-table-and-logic-circuits/]
The combinational logic circuit for BCD code to Excess-3 code conversion is
drawn from the obtained boolean expressions.

Figure 2.6.4 BCD to Excess-3 code converter


[Source: https://www.electrically4u.com/code-converter-types-truth-table-and-logic-circuits/]

2.6.3 BCD TO GRAY CODE CONVERTER


The truth table having the conversion from BCD code to gray code is shown below.
Since the BCD code has only 4 bits, a total of 9 BCD digits have been considered. The
output is unpredictable for other input combinations.
From the minterms of each output G3, G2, G1 and G0, the karnaugh map is
implemented to simplify the function.
The code converter circuit for BCD to gray code is drawn as below from the obtained
expression.
Figure 2.6.5 Truth Table BCD To Gray Code Converter
[Source: https://www.electrically4u.com/code-converter-types-truth-table-and-logic-circuits/]
Figure 2.6.6 BCD To Gray Code Converter

Gray Code to Binary Code Converter: Truth Table:


Gray Code to Binary Code Converter: Truth Table:

Gray code input Binary output

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
LOGIC DIAGRAM: GRAY CODE TO BINARY CONVERTOR

K-Map for B3: K-Map for B2

B3 = G3

K-Map for B1: K-Map for B0:

You might also like