Combinatorial Logic Circuits

Sum of Products Form

ABC A B C
AB ABC CD D

Simplifying Logic Circuits

A BC

x A.B. A BC

Cont-1

x A.B.C

Algebraic Simplification

z ABC A B. A C
Penyelesaian

z ABC A B A C (teorema 17)

ABC A B A C (ubah invers ganda)
ABC A BA A BC (Perkalian output)
ABC A B A BC (Teorema 3)

Cont

z AC(B B) A B
AC(1) A B
AC A B

A C B

Cont-1

AC

z ABC A B A C

Cont-2

z BC

z A BC

Designing Combinatorial Logic

Circuits
A

0
0
1
1

0
1
0
1

0
1
1
0

Karnaugh MAP Method

A
0
0
1
1

B
0
1
0
1

X
1
0
0
1

AB

AB

Bentuk sum of product :

X A B AB

Cont
B

Cont-1
A

B C

0
0
0
0
1
1
1
1

0
0
1
1
0
0
1
1

1
1
1
0
0
0
1
0

0
1
0
1
0
1
0
1

A BC
A BC
ABC

ABC

X A BC A B C A B C AB C

Cont-2
C

AB

AB

AB

AB

Cont-3
A

B C D

0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1

0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1

0
1
0
0
0
1
0
0
0
0
0
0
0
1
0
1

0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1

0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1

A BC D

A BC D

X A BC D A B C D
AB C D ABCD
AB C D

ABCD

Cont-4
CD C D CD C D

AB

AB

AB

AB

Looping
The expression for output X can be
simplified by properly combining those
squares in the K map which contain 1 s.
The process for combining these 1 s is
called looping.
Looping groups of two (pairs)
Looping groups of four (quads)
Looping groups of eight (ectets)

Cont-pair
1

Cont-quad
0

Con-quad
0

Cont-octet
0

Cont-octet
1

Exclusive-OR Circuits

Cont
A

0
0
1
1

0
1
0
1

0
1
1
0

Exclusive-NOR Circuits

Cont

0
0
1
1

0
1
0
1

1
0
0
1