UNIVERSITY OF SOUTHERN MINDANAO

COLLEGE OF ENGINEERING AND COMPUTING

DEPARTMENT OF COMPUTER ENGINEERING

PLATE 5
16-SEGMENT DISPLAY

CpE 411
LOGIC CIRCUITS AND SWITCHING THEORY

Submitted by:
TAKUNDA P. NAUTIN
4-BSCpE-A

Submitted to:
JEANNALEN P. LUNOD
Subject Professor

Date Submitted:
11-06-17
Problem:
A sixteen-segment display (SSID) is a type of display based on 16 segments that can be
turned on or off according to the graphic pattern to be produced. It is an extension of the more
common seven-segment display, adding four diagonal and two vertical segments ad splitting the
three horizontal segments in half.
Design 16-segment decoder using a minimum number of gates. It must decode the 26
letters of the alphabet (A-Z). The six invalid combinations should result in a blank display. The
letter designation chosen represent the alphabet is shown in Figure B.

FIGURE A.

FIGURE B.
FUNCTIONS:

F0 = B’C’ + A’B’D’ + A’BCD+AC’D’E + A’C’D’E’ + A’CDE’

F1 = F0

F2 = A’BC + B’C’D’ + AB’CE’ + A’B’C’E + A’C’D’E + A’CDE

F3 = AB’E’ + A’B’C’D’ + A’B’C’E + A’C’D’E + A’BCD’ + A’B’CD + A’CDE’

F4 = A’C’E + A’BC’D’ + BC’D’E + A’CDE’ +B’C’DE’ + AB’D’E + B’CD’E’

F5 = F4

F6 = A’C +AB’D’ + A’BE + B’CE’ + A’B’E’ + A’BD

F7 = A’C + B’E’ + A’BD + AB’D’

F8 = A’CDE + A’B’D’E’ + AB’C’D’E + A’BC’DE’ + AB’C’DE’ + A’B’CE

F9 = A’B’C +A’B’D’ +A’CDE + B’C’D’E + AB’C’DE’

F10 = AB’CDE + A’BCD’ + ABC’D’E’

F11 = A’B’C’E + B’C’DE + A’BC’D’E’

F12 = ABC’D’ + AB’CE + A’BC’DE’ + A’BCD’E’

F13 = AB’CD +AB’C’D’ + A’B CD’E + A’BC’DE’

F14 = A’B’C’E + B’C’DE + BC’D’E’

F15 = AB’CE + ABC’D’E + AB’CD

Truth Table:

INPUTS F0 F1 F2 F3 F4 F5 F6 F7 F8 F9 F10 F11 F12 F13 F14 F15

0 0 0 0 0 1 1 1 1 1 1 1 1
0 0 0 0 1 1 1 1 1 1 1 1 1 1
0 0 0 1 0 1 1 1 1 1 1
0 0 0 1 1 1 1 1 1 1 1 1 1
0 0 1 0 0 1 1 1 1 1 1 1 1
0 0 1 0 1 1 1 1 1 1 1
0 0 1 1 0 1 1 1 1 1 1 1 1
0 0 1 1 1 1 1 1 1 1 1
0 1 0 0 0 1 1 1 1 1 1
0 1 0 0 1 1 1 1 1 1
0 1 0 1 0 1 1 1 1 1
0 1 0 1 1 1 1 1 1
0 1 1 0 0 1 1 1 1 1 1
0 1 1 0 1 1 1 1 1 1 1
0 1 1 1 0 1 1 1 1 1 1 1 1
0 1 1 1 1 1 1 1 1 1 1 1
1 0 0 0 0 1 1 1 1 1 1 1 1 1
1 0 0 0 1 1 1 1 1 1 1 1 1
1 0 0 1 0 1 1 1 1 1 1 1 1
1 0 0 1 1 1 1 1 1
1 0 1 0 0 1 1 1 1 1 1
1 0 1 0 1 1 1 1 1
1 0 1 1 0 1 1 1 1 1 1
1 0 1 1 1 1 1 1 1
1 1 0 0 0 1 1 1
1 1 0 0 1 1 1 1 1 1 1
1 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
1 1 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
1 1 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
LOGIC DIAGRAM:

[2]
[10]

[12]
B [11]

[3] F1
[7]
[18]
C
[9] [19]
[4] [8]

[16]
D [17]

[5] [13]
[15]
[26]

E [21]

[14]
[6] [23] F2

[22]

[24]
[25]

[21]

A [12]
[15]
[1]
F3
[6]
B [8]

[2]
[17] F4
[9]
C [11]
[10]
[3]

[7]
D [19]

[4]
[13]
[14]
E

[5]

[18]
A
[40]
[23] [41]
[27]
[29]

B [38]
[24]
[30]
[37]
[36]
C
[32]
[25] [42] [43] F5
[39]

D [28]

[26]

[33] [35] [47]

E [34]

[5]
[46]
[45]
[50]
F6
[49]

[52]
[51]

[54]
[55]
[53]

[57]

[63]
B [65]

[58]
F7
[69]
[66]
C [68]

[59] [67]

[64] [76]
[77]
D

[60] [80]
[71] F8

[72]
E

[61]
[73]

[75]
[74]
[81]
[79]
[78]
 [96]
[100]

[95]
A

[57]
[83]
[84] [99]
F9=F10
B [98]
[97]
[58]
[89]
[91]

C
[92]
[93] [101]
[59]

[90]
D
[86]
[85]
[60]

E [88]
[87]
[61]

A
[108]
[57]

F11
[103]
B

[58] [107]

[104] [109]
C

[59]
[105]

D [112]

[60] [106] F12

[113]
E
[111]
[61] [114]

[115]
[116]
 [20]
A

[1]

[6]
[12]
F13
B
[16]
[2]
F14
[7]

C
[17]
[3] [21]

[8]
D
[18]
[4]

[9]
E

[5] [19]

[11]
[10]

[1]

[6]
B

[2]

C [7] F15

[3]

D
[8]
[9]
[4]

E [10]
[11]
[5]