University of Southern Mindanao

Kabacan, Cotabato
College of Engineering and Information Technology

PLATE NO. 5
16-SEGMENT DECODER

CpE 311 – Logic Circuits and Design

Submitted by:

Ayessa Kaye L. Tac-an

3-BSCpE-A

Submitted to:

Jeannalen P. Lunod, ME-CpE

Instructor

November 3, 2023
A. Problem

A sixteen-segment display (SISD) 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 and splitting the three horizontal segments in half. Design a 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 be treated as don’t care.

B. Truth Table
# A B C D E A1 A2 B C D1 D2 E F G1 G2 H J K L M N
0 A 0 0 0 0 0 1 1 1 1 0 0 1 1 1 1 0 0 0 0 0 0
1 B 0 0 0 0 1 1 1 1 1 1 1 0 0 0 1 0 1 0 0 1 0
2 C 0 0 0 1 0 1 1 0 0 1 1 1 1 0 0 0 0 0 0 0 0
3 D 0 0 0 1 1 1 1 1 1 1 1 0 0 0 0 0 1 0 0 1 0
4 E 0 0 1 0 0 1 1 0 0 1 1 1 1 1 1 0 0 0 0 0 0
5 F 0 0 1 0 1 1 1 0 0 0 0 1 1 1 1 0 0 0 0 0 0
6 G 0 0 1 1 0 1 1 0 1 1 1 1 1 0 1 0 0 0 0 0 0
7 H 0 0 1 1 1 0 0 1 1 0 0 1 1 1 1 0 0 0 0 0 0
8 I 0 1 0 0 0 1 1 0 0 1 1 0 0 0 0 0 1 0 0 1 0
9 J 0 1 0 0 1 0 0 1 1 1 1 1 0 0 0 0 0 0 0 0 0
1 K 0 1 0 1 0 0 0 0 0 0 0 1 1 1 0 0 0 1 1 0 0
0
1 L 0 1 0 1 1 0 0 0 0 1 1 1 1 0 0 0 0 0 0 0 0
1
1 M 0 1 1 0 0 0 0 1 1 0 0 1 1 0 0 1 0 1 0 0 0
2
1 N 0 1 1 0 1 0 0 1 1 0 0 1 1 0 0 1 0 0 1 0 0
3
1 O 0 1 1 1 0 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0
4
1 P 0 1 1 1 1 1 1 1 0 0 0 1 1 1 1 0 0 0 0 0 0
5
1 Q 1 0 0 0 0 1 1 1 1 1 1 1 1 0 0 0 0 0 1 0 0
6
1 R 1 0 0 0 1 1 1 1 0 0 0 1 1 1 1 0 0 0 1 0 0
7
1 S 1 0 0 1 0 1 1 0 1 1 1 0 1 1 1 0 0 0 0 0 0
8
1 T 1 0 0 1 1 1 1 0 0 0 0 0 0 0 0 0 1 0 0 1 0
9
2 U 1 0 1 0 0 0 0 1 1 1 1 1 1 0 0 0 0 0 0 0 0
0
2 V 1 0 1 0 1 0 0 0 0 0 0 1 1 0 0 0 0 1 0 0 1
1
2 W 1 0 1 1 0 0 0 1 1 0 0 1 1 0 0 0 0 0 1 0 1
2
2 X 1 0 1 1 1 0 0 0 0 0 0 0 0 0 0 1 0 1 1 0 1
3
2 Y 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 1 0
4
2 Z 1 1 0 0 1 1 1 0 0 1 1 0 0 0 0 0 0 1 0 0 1
5
2 X 1 1 0 1 0 X x x X x x X x x x X x x x x X
6
2 X 1 1 0 1 1 X x x x x x x x x x X x x x x X
7
2 X 1 1 1 0 0 X x x x x x x x x x x x x x x X
8
2 X 1 1 1 0 1 X x x x x x x x x x x x x x x X
9
3 X 1 1 1 1 0 X x x x x x x x x x x x x x x X
0
3 X 1 1 1 1 1 X x x x x x x x x x x x x x x X
1
C. Boolean Functions
A1 (A,B,C,D,E)= ∑(0,1,2,3,4,5,6,8,14,15,16,17,18,19,25)

A=0 A=1

BC BC
DE 00 01 11 10 00 01 11 10
DE
1 00 1 1 1 X
00
1 01 1 1 X 1
01
1 11 1 1 X X
11
1 10 1 1 1 X X
10

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

A2 (A,B,C,D,E)= ∑(0,1,2,3,4,5,6,8,14,15,16,17,18,19,25)
A=0 A=1

BC BC
DE 00 01 11 10 00 01 11 10
DE
1 00 1 1 1 X
00
1 01 1 1 X 1
01
1 11 1 1 X X
11
1 10 1 1 1 X X
10

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

B (A,B,C,D,E)= ∑(0,1,3,7,9,12,13,14,15,16,17,20,22)
A=0 A=1

BC BC
DE 00 01 11 10 00 01 11 10
DE
1 00 1 1 00 1 X
1 01 1 1 1 01 X
1 111 1 X X
11
1 1 X X
10 10

F=A’BD’E + A’B’DE + B’C’D’ + BC + ACE’

C (A,B,C,D,E)= ∑(0,1,3,6,7,9,12,13,14,15,16,18,20,22)
A=0 A=1

BC BC
DE 00 01 11 10
DE 00 01 11 10
1 00 1 1 100 X
1 01 1 1 X
01
1 111 X X
11
110 1 1 1 X X
10

F = A`B`DE + A`B`C`D` + A`BD`E + BCD` + CDE` + AB`E`

D1 (A,B,C,D,E)= ∑(1,2,3,4,6,8,9,11,14,16,18,20,25)

A=0 A=1

BC 00 01 11 10 BC 00
DE 01 11 10
DE
00 1 1 1 1 00 X
1 1 01 X 1
01
1 1 11 X X
11
1 1 1 1 X X
10 10

F= A`C`E + A`B`CE` + A`BC`D` + AB`D`E` + B`C`DE` + BCDE` + ABE

D2 (A,B,C,D,E)= ∑(1,2,3,4,6,8,9,11,14,16,18,20,25)
A=0 A=1

BC 00 01 11 10 BC 00
DE 01 11 10
DE
00 1 1 1 1 00 X
1 1 01 X 1
01
1 1 11 X X
11
1 1 1 1 X X
10 10

F= A`C`E + A`B`CE` + A`BC`D` + AB`D`E` + B`C`DE` + BCDE` + ABE

E (A,B,C,D,E) = ∑(0,2,4,5,6,7,9,10,11,12,13,14,15,16,17,20,21,22)
A=0 A=1

BC
DE 00 01 11 10 BC
DE 00 01 11 10
1 1 1 1
00 00 1 X
1 1 1 1
01 01 1 X
1 1 1 X X
11 11
1 1 1 1
10 10 1 X X

F= A`C + A`DE` + A`BE + A`B`E` + AB`D`+ CDE`

F (A,B,C,D,E) = ∑(0,2,4,5,6,7,10,11,12,13,14,15,16,17,18,20,21,22)
A=0 A=1

BC
DE 00 01 11 10 BC
DE 00 01 11 10
1 1 1 1
00 00 1 X
1 1 1
01 01 1 X
1 1 1 X X
11 11
1 1 1 1 1
10 10 1 X X

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

G1 (A,B,C,D,E)= ∑(0,4,5,7,10,15,17,18)
A=0 A=1
BC BC
DE 00 01 11 10 00 01 11 10
DE
1 100 x
00
101 1 x
01
111 1 x x
11
10 1 1 x x
10
G1=A’CDE + A’B’D’E’ + A’B’CE + AB’C’D’E + A’BC’DE’+ AC’DE’

G2 (A,B,C,D,E)= ∑(0,1,4,5,6,7,15,17,18)
A=0 A=1
BC BC
DE 00 01 11 10 00 01 11 10
DE
1 1 00 X
00
1 1 1 01 X
01
1 1 11 X X
11
1 1 10 X X
10

G2=A’B’C + A’B’D’ + A’CDE + B’C’D’E + AC’DE’

H (A,B,C,D,E)= ∑(12,13,23,24)
 A=0 A=1

BC BC
DE 00 01 11 10
DE 00 01 11 10
00 1 00 X 1
01 1 01 X
11 11 1 X X

10 10 X X

H= ACDE + BCD’ + ABC’D’E’

J (A,B,C,D,E)= ∑(1,3,8,19)
A=0 A=1
BC BC
DE 00 01 11 10
DE 00 01 11 10
00 1 00 X
1 01 01 X
1 11 1 11 X X
10 10 X X

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

K (A,B,C,D,E)= ∑(10,12,21,23,24,25)
A=0 A=1
BC BC
DE 00 01 11 10 DE 00 01 11 10
00 1 00 X 1

01 1 01 X 1

11 1 11 X X
1 X x
10 10

F=BE’(CD’ + C’D) + ACE + AB)

L (A,B,C,D,E)= ∑(10,13,16,17,22,23)
 DE 00 01 11 10
1 00
X
1 X
01
1 X X
A=0 11 A=1
BC 1 X X
BC 10
DE 00 01 11 10
00 F=BCD’E + BC’DE’ + AB’C’D’ + ACD

01 1
M (A,B,C,D,E)= ∑(1,3,8,19,24)
11
1 A=0
10
BC A=1 BC
DE 00 01 11 10
00 1
DE 00 01 11 10
1 01 X 1
00
1 11 X
01
10 1 X X
11

10
X X

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

N (A,B,C,D,E)=(21,22,23,25)
A=1
BC
DE 00 01 11 10
00 X
101 X 1
111 X X
110 X X

F= ACE + ABE + ACD

D. Logic Diagram