LOGIKA MATEMATIKA 2004/2005

Circuit Digital
A B C C

Aljabar Boolean

(AB)(B + C)

Draw the logic circuit for AB + CD + ABC = Y

Minimization of circuits

A B C D Y

Example: a circuit has output 1 if and only if: x = y = z = 1 or x = z = 1 and y = 0. The sum-of-product of this circuit is:

xyz + x y z = ( y + y )( xz ) = 1 .( xz ) = xz .

Minimization of circuits
x y z xyz

SIMPLIFICATION
Truth Table Unique Boolean Function Many different expressions exist Simplification from Boolean function

xyz + xyz

x y z x z
y

- Finding an equivalent expression that is least expensive to implement - For a simple function, it is possible to obtain a simple expression for low cost implementation - But, with complex functions, it is a very difficult task Karnaugh Map (K-map) is a simple procedure for simplifying Boolean expressions. Truth Table Boolean function
6

xyz

xz

Karnaugh Map

Simplified Boolean Function

Two circuits with the same output5

Goals of Circuit Minimization

(1) Minimize the number of primitive Boolean logic

Boolean Algebra
Developed by George Boole in the 1850s Mathematical

gates needed to implement the circuit.

Ultimately, this also roughly minimizes the number of transistors, the chip area, and the cost. Also roughly minimizes the energy expenditure
among traditional irreversible circuits.

theory of logic.

Shannon was the first to use Boolean

(2) It is also often useful to minimize the number

of combinational stages or logical depth of the circuit. This roughly minimizes the delay or latency through
the circuit, the time between input and output.

Algebra to solve problems in electronic c i r c u i t d e s i g n . ( 1 9 3 8 ) . The behavior of a Digital Circuit can be described in terms of Boolean Algebra. Boolean algebra provides the operations and the rules for working with the set {0, 1}.
7 8

Karnaugh Maps
In 1953, Maurice Karnaugh published a paper

Logic Gates

about his system of mapping & simplifying Boolean expressions. Karnaugh maps are a way of getting a simplified expression from a truth table By writing out the truth table in a specialised format, we can find minterms for the expression by looking for groupings of 1s The minterms are referred to as implicants because their truth implies the truth of the expression
9 10

Example using 3 variables:

OR Truth Table
Inputs C B 0 0 1 0 1 0 1 1 A 0 1 0 0 0 1 1 1 Output Y 0 1 1 1 1 1 1 1

Karnaugh Maps
B A A

Karnaugh Map B

Boolean Expression

OR Truth Table
Inputs B 0 0 1 1 A 0 1 0 1 Output Y 0 1 1 1

Karnaugh Map B B A A

Boolean Expression

0 0

x x
C B

x x
C B

x x
C

x x
B

AB + AB + AB = Y
Simplified Boolean Expression

0 1 1 1 0 1

ABC + ABC + ABC + ABC + ABC + ABC + ABC = Y

x
B

Simplified Boolean Expression

A A

x x

A+B=Y
2 Terms: 1 Variable = 2 Blocks 2 Variables = 1 Block
11

A A

x x
C

x x

x x
C

A+B+C=Y
3 Terms: 1 Variable = 4 Blocks 2 Variables = 2 Blocks 3 Variables = 1 Block 12

x
C

 Q. Simplify AB + CBA + BAC + CB + AC.

Q. Simplify ABC + CB + AC + BCA + CA.

B A A

x x
C

x x
C

B A A

x
C

x x
C

x x
C

x
C

A. A + C

A. A + BC + BC

13

14

Soal
Diberikan fungsi boolean berikut ini
(X

+ Y). Z

Carilah SPE dari fungsi boolean tersebut

kemudian dgn kernaugh map lakukan penyederhanaan dan gambarlah circuit akhirnya.

15