Author: M Abo Bakar Aslam

BCD to 7-Segment Decoder

BCD is Binary-Code-Decimal code that represents decimal-number by using 4-bit binary-number. in this lesson, you will learn to converts 4-bit binary-number to decimal-number format and decimal-number would be shown using only one 7-segment-disply.

1. SEVEN Segment

A 7-segment display is an electronic display device used to show numeric digits (0-9) using seven individual segments. It consists of seven LED segments arranged in a rectangular pattern. Each segment can be turned ON or OFF to form different numbers.

The segments are labeled as:

a, b, c, d, e, f, g (and sometimes dp for decimal point)

SEVEN segment display with its label
SEVEN segment display with its label - visualized by edu2skill

Using this segment, all possible outputs are mentioned in below figure. In case of not-possible-decimal-number, 7-segment-display is set as OFF (Fig. 1(k)).

All possible outputs for single SEVEN Segment Display
All possible outputs for single SEVEN Segment Display - visualized by edu2skill

2. Convesion from BCD to 7 segment Output

For 4-bit of binary number, there are fifteen possible decimal-numbers. All possible binary number and respective decimal numbers are shown in below Table. But there are some decimal-numbers (i.e., 10 to 15) that cannot be displayed using single SEVEN segment. Only 0-9 numbers can be displayed using one 7-segment-display. Figure numbers are also mentioned in which you can see output of the circuit for each user-input in binary format.

XYZWDecimalFigure
00000Fig. 1(a)
00011Fig. 1(b)
00102Fig. 1(c)
00113Fig. 1(d)
01004Fig. 1(e)
01015Fig. 1(f)
01106Fig. 1(g)
01117Fig. 1(h)
10008Fig. 1(i)
10019Fig. 1(j)
1010Not PossibleFig. 1(k)
1011Not PossibleFig. 1(k)
1100Not PossibleFig. 1(k)
1101Not PossibleFig. 1(k)
1110Not PossibleFig. 1(k)
1111Not PossibleFig. 1(k)

3. Boolean Expression for 7-segment-display

For conversion, we used below truth table. User-inputs are named as X, Y, Z and W. Most-Significant-Bit (MSB) is named as X and Least-Significant-Bit (LSB) is named as W. While, Middle-bits are named as Y and Z from left to right. These names would be used in Boolean expression.

This table shows that:

User Input7-Segment Display
XYZWABCDEFG
00001111110
00010110000
00101101101
00111111001
01000110011
01011011011
01101011111
01111110000
10001111111
10011111011
10100000000
10110000000
11000000000
11010000000
11100000000
11110000000

Now we have to create Boolean expressions for A, B, C, D, E, F and G.

3.1. Boolean Expression for A

K-Map for value of column A is shown in below figure. In the map, four groups (G1, G2, G3 and G4) of 0's are created.

K-Map for Boolean expression for A - Visualized by edu2skill.com
K-Map for Boolean expression for A - Visualized by edu2skill.com

Therefore, Boolean expression of A is:

A = (X'+Y')(X'+Z')(Y'+Z+W)(X+Y+Z+W')

3.2. Boolean Expression for B

K-Map for value of column B is shown in Fig. 3. In the map, four groups (G1, G2, G3 and G4) of 0's are created.

K-Map for Boolean expression for B - Visualized by edu2skill.com
K-Map for Boolean expression for B - Visualized by edu2skill.com

Therefore, Boolean expression of B is:

B = (X'+Z')(X'+Y')(Y'+Z+W')(Y'+Z'+W)

3.3. Boolean Expression for C

K-Map for value of column C is shown in Fig. 4. In the map, three groups (G1, G2, and G3) of 0’s are created.

K-Map for Boolean expression for C - Visualized by edu2skill.com
K-Map for Boolean expression for C - Visualized by edu2skill.com

Therefore, Boolean expression of C is:

C = (X'+Z')(X'+Y')(Y+Z'+W)

3.4. Boolean Expression for D

K-Map for value of column D is shown in Fig. 5. In the map, five groups (G1, G2, G3, G4 and G5) of 1’s are created.

K-Map for Boolean expression for D - Visualized by edu2skill.com
K-Map for Boolean expression for D - Visualized by edu2skill.com

Therefore, Boolean expression of D is:

D = X'ZW' + X'Y'W' + X'Y'Z + X'YZ'W + XY'Z'

3.5. Boolean Expression for E

K-Map for value of column E is shown in Fig. 6. In the map, two groups (G1 and G2) of 1’s are created.

K-Map for Boolean expression for E - Visualized by edu2skill.com
K-Map for Boolean expression for E - Visualized by edu2skill.com

Therefore, Boolean expression of E is:

E = X'ZW' + Y'Z'W'

3.6. Boolean Expression for F

K-Map for value of column F is shown in Fig. 7. In the map, four groups (G1, G2, G3 and G4) of 1’s are created.

K-Map for Boolean expression for F - Visualized by edu2skill.com
K-Map for Boolean expression for F - Visualized by edu2skill.com

Therefore, Boolean expression of F is:

F = X'YZ' + X'YW' + Y'Z'W' + XY'Z'

3.7. Boolean Expression for G

K-Map for value of column G is shown in Fig. 8. In the map, four groups (G1, G2, G3 and G4) of 1's are created.

K-Map for Boolean expression for G - Visualized by edu2skill.com
K-Map for Boolean expression for G - Visualized by edu2skill.com

Therefore, Boolean expression of G is:

G = X'YZ' + XY'Z' + X'Y'Z + X'ZW'

4 Circuit Diagram

Below figure shows the circuit diagram based on above equations. User-input is made using four bits through four logic-states (shown in blue color). Each logic-state can be either 0 or 1. The output for each user-input is also defined in above table.

Circuit Diagram for BCD to SEVEN Segment Decoder - Visualized by edu2skill.com
Circuit Diagram for BCD to SEVEN Segment Decoder - Visualized by edu2skill.com