BTCS 2134 ELEKTRONIK DIGITAL

CHAPTER 2: PART 1 LOGIC GATES AND BOOLEAN ALGEBRA

1

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Logic Gates
Inverter AND Gate OR Gate Exclusive-OR Gate NAND Gate NOR Gate Exclusive-NOR Gate
UNIVERSITI TEKNIKAL MALAYSIA MELAKA
Kompetensi Teras Kegemilangan

2.1 The Inverter

Truth table
0 = LOW 1 = HIGH

Boolean expression Pulsed waveforms

The output of an inverter is always the complement (opposite) of the input.

UNIVERSITI TEKNIKAL MALAYSIA MELAKA
Kompetensi Teras Kegemilangan

2.2 The AND Gate

Boolean expression Truth table

0 = LOW 1 = HIGH

Pulsed waveforms

The output of an AND gate is HIGH only when all inputs are HIGH.
UNIVERSITI TEKNIKAL MALAYSIA MELAKA
Kompetensi Teras Kegemilangan

2.2 The AND Gate (cont.)

3-Input AND Gate 4-Input AND Gate

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

2.3 The OR Gate (cont.)

Boolean expression Truth table

0 = LOW 1 = HIGH

Pulsed waveforms

The output of an OR gate is HIGH whenever one or more inputs are HIGH
UNIVERSITI TEKNIKAL MALAYSIA MELAKA
Kompetensi Teras Kegemilangan

2.3 The OR Gate (cont.)

3-Input OR Gate 4-Input OR Gate

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

2.4 The NAND Gate

Boolean expression Truth table

0 = LOW 1 = HIGH

Pulsed waveforms

The output of a NAND gate is HIGH whenever one or more inputs are LOW.

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

2.4 The NAND Gate (cont.)

3-Input NAND Gate

4-Input NAND Gate

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

2.5 The NOR Gate (cont.)

Boolean expression Truth table

0 = LOW 1 = HIGH

Pulsed waveforms

The output of a NOR gate is LOW whenever one or more inputs are HIGH.
UNIVERSITI TEKNIKAL MALAYSIA MELAKA
Kompetensi Teras Kegemilangan

2.5 The NOR Gate (cont.)

3-Input NOR Gate

4-Input NOR Gate

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

2.6 Exclusive-OR Gate

Boolean expression Truth table

0 = LOW 1 = HIGH

Pulsed waveforms

The output of an XOR gate is HIGH whenever the two inputs are different.
UNIVERSITI TEKNIKAL MALAYSIA MELAKA
Kompetensi Teras Kegemilangan

2.7 Exclusive-NOR Gate

Boolean expression Truth table

0 = LOW 1 = HIGH

Pulsed waveforms

The output of an XNOR gate is HIGH whenever the two inputs are identical.
UNIVERSITI TEKNIKAL MALAYSIA MELAKA
Kompetensi Teras Kegemilangan

CHAPTER 2 LECTURE 5
Logic Gates and Boolean Algebra

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

2.1 Boolean Operations and Expressions Addition

0+0=0 0+1=1 1+0=1 1+1=1

Multiplication
0*0=0 0*1=0 1*0=0 1*1 =1

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

2.2 Laws and Rules of Boolean Algebra

Commutative Laws Associative Laws Distributive Law 12 basic rules of Boolean Algebra

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Laws and Rules Boolean Algebra

Commutative Laws: A+B = B+A AB = BA Associative Laws: A+(B+C) = (A+B)+C A(BC) = (AB)C Boolean Addition: * A+0 = A * A+1 = 1 * A+A = A * A+ = 1 Complement Rules: * Distributive Laws: A(B+C) = AB+AC Demorgans Theorem:

XY X Y X Y XY
Boolean Multiplication: * A0 = 0 * A1 = A * AA = A * A = 0 Boolean other Rules: * A+AB = A * A+B = A+B +AB = +B * (A+B)(A+C) = A+BC

AA

17

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

2.2 Laws Boolean Algebra (cont .)

Commutative Law of Addition:

A+B=B+A

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

2.2 Laws Boolean Algebra (cont .)

Commutative Law of Multiplication:

A*B=B*A

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

2.2 Laws Boolean Algebra (cont .)

Associative Law of Addition:

A + (B + C) = (A + B) + C

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

2.2 Laws Boolean Algebra (cont .)

Associative Law of Multiplication:

A * (B * C) = (A * B) * C

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

2.2 Laws Boolean Algebra (cont .) Distributive Law: A(B + C) = AB + AC

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

2.3 12 Basic Rules of Boolean Algebra

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

2.3 Rules of Boolean Algebra (cont.) Rule 1

OR Truth Table
UNIVERSITI TEKNIKAL MALAYSIA MELAKA
Kompetensi Teras Kegemilangan

2.3 Rules of Boolean Algebra (cont.) Rule 2

OR Truth Table
UNIVERSITI TEKNIKAL MALAYSIA MELAKA
Kompetensi Teras Kegemilangan

2.3 Rules of Boolean Algebra (cont.)

Rule 3

AND Truth Table

UNIVERSITI TEKNIKAL MALAYSIA MELAKA
Kompetensi Teras Kegemilangan

2.3 Rules of Boolean Algebra (cont.) Rule 4

AND Truth Table

UNIVERSITI TEKNIKAL MALAYSIA MELAKA
Kompetensi Teras Kegemilangan

2.3 Rules of Boolean Algebra (cont.) Rule 5

OR Truth Table
UNIVERSITI TEKNIKAL MALAYSIA MELAKA
Kompetensi Teras Kegemilangan

2.3 Rules of Boolean Algebra (cont.) Rule 6

OR Truth Table
UNIVERSITI TEKNIKAL MALAYSIA MELAKA
Kompetensi Teras Kegemilangan

2.3 Rules of Boolean Algebra (cont.) Rule 7

AND Truth Table

UNIVERSITI TEKNIKAL MALAYSIA MELAKA
Kompetensi Teras Kegemilangan

2.3 Rules of Boolean Algebra (cont.) Rule 8

AND Truth Table

UNIVERSITI TEKNIKAL MALAYSIA MELAKA
Kompetensi Teras Kegemilangan

2.3 Rules of Boolean Algebra (cont.) Rule 9

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

2.3 Rules of Boolean Algebra (cont.)

Rule 10: A + AB = A

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

2.3 Rules of Boolean Algebra (cont.)

Rule 11:

A AB A B

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

2.3 Rules of Boolean Algebra (cont.)

Rule 12: (A + B)(A + C) = A + BC

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

2.4 DeMorgans Theorems

Theorem 1

XY X Y
Theorem 2

X Y XY
Remember: Break the bar, change the sign
UNIVERSITI TEKNIKAL MALAYSIA MELAKA
Kompetensi Teras Kegemilangan

CHAPTER 2 LECTURE 6
Logic Expression and Minimization

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Logic Gates
Name Graphical Symbol Algebraic Function Truth Table AND
x 0 0 1 1 x 0 0 1 1 y 0 1 0 1 y 0 1 0 1 x f 0 0 0 1 f 0 1 1 1 f 1 0

x y

f xy

OR
x y f

f x y

INVERTER

f x

0 1

38

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Logic Gates
Name NAND Graphical Symbol Algebraic Function Truth Table
x 0 0 1 1 y f 1 1 1 0 f 1 0 0 0 f 0 1 1 0 f 1 0 0 1

x y

f xy

NOR
x y f

f x y f xy x y
f x y

0 1 0 1 x y 0 0 0 1 1 0 1 1 x 0 0 1 1 y

EX-OR

x y

EX-NOR

x y

f xy x y f x y

0 1 0 1 x y 0 0 0 1 1 0 1 1

39

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Boolean Expression
Boolean expressions are a much better form for representing digital circuits because it is much easier to manipulate and simplify. A Boolean expression is an expression formed with: binary variables the binary operators OR and AND the operator NOT parentheses an equal sign For example, F xy z ; F is 1 when z = 1 OR when x = 0 AND y = 1. The precedence of operations is as follows: parentheses, NOT, AND OR.

40

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Boolean Algebra
Definition: Theorems that are used at design time to manipulate and simplify Boolean expressions for easier and less expensive implementation. Any Boolean expression can be represented using only AND, OR, and NOT operations. May need to use Boolean algebra to change the form of a Boolean expression to better utilize the types of gates provided by the component library being used. A Boolean variable, x, can have two values, typically 1 and 0 (on and off)

41

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Boolean Analysis of Logic Circuits

The Boolean Expression for a Logic Circuit
Any logic circuit, may completely described using the Boolean expressions. To derive the Boolean Expression of a given logic circuit, begin the left-most inputs and work toward the final output, writing the expression for each gate.

Ex:
A B AB+CD C D CD AB

42

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Boolean Analysis of Logic Circuits

Ex:
A B Y C D

Y ( A B )(C D )

Ex:

A B

W AB A C
W

C
UNIVERSITI TEKNIKAL MALAYSIA MELAKA
Kompetensi Teras Kegemilangan

43

Boolean Analysis of Logic Circuits

44

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Implementing Circuits From Boolean Expression

Ex:

x ( A B )( B C )

45

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Boolean Analysis of Logic Circuits

Constructing Truth Table for a logic circuit
Once the Boolean expression has been determined, truth table can be developed. Boolean expression have to evaluate for all possible combinations of values input variable. If there are four input variables (A, B, C, D) therefore sixteen (24=16) combinations of values possible. Evaluating the Expression: To evaluate the expression, first find the values of the variables that make the expression equal to 1, using rules for Boolean addition and multiplication.

46

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Boolean Analysis of Logic Circuits

Putting the Results in Truth Table Format.
The first step, list the sixteen input variable combinations of 1s and 0s in binary sequence. Place a 1 in the output column for each combination of input variables. Place a 0 in the output column for all other combinations input variables.

47

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

DeMorgans Theorem
WXYZ
W X Y Z

A B CD
AB CD EF

48

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Simplification Using Boolean Algebra

Ex: Simplify the Boolean expression

Y AB AB C BB C

F X Y X Y X Z
49

ABC BD ABC
ABC ABC ABC ABC ABC

AB AC ABC
F XY X Z YZ
UNIVERSITI TEKNIKAL MALAYSIA MELAKA
Kompetensi Teras Kegemilangan

Standard Forms of Boolean Expressions

All Boolean expressions, regardless of their form can be converted into either of two standard forms:
sum-of-product forms (SOP) product-of-sums forms (POS)

Standardization makes the evaluation, simplification and implementation of Boolean expressions much more systematic and easier.
UNIVERSITI TEKNIKAL MALAYSIA MELAKA
Kompetensi Teras Kegemilangan

50

2.5 Standard Forms of Boolean Expressions

The sum-of-product (SOP) form

Example: X = AB + CD + EF

The product of sum (POS) form

Example: X = (A + B)(C + D)(E + F)

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Standard Forms of Boolean Expressions

Sum-of-products (SOP) form:
Two or more product terms are summed by Boolean addition. OR the outputs of two or more AND gates. ABC A B ABC D Eg: A single over bar cannot extend over more than one variable, eg: ABC Standard SOP-all the variables in the domain appear in each product term, eg:

ABCD ABC D ABC D

52

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Sum-of-products (SOP)
Converting product terms to standard SOP
Step 1: multiply each nonstandard product term by a term made up of the sum of a missing variable and its complement. Eg: multiply ( A A) Repeat step 1 until all resulting product terms contain all variables. Ex: Convert following Boolean expression into standard SOP form: ABC AB ABC D

53

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Standard Forms of Boolean Expressions

Product-of-Sums (POS) form: Two or more um terms are multiplied by Boolean multiplication. AND the outputs of two or more OR gates. Eg: A B C B C D A B C D A single over bar cannot extend over more than one variable, eg: A B C Standard POS- all the variables in the domain appear in each product term, eg: A BC D A BC D A BC D

54

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

55

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Product-of-Sums (POS)
Converting a sum term to Standard POS
Add to each nonstandard product term a term made up of the product of the missing variable and its complement. Example: add ( A A) and apply rule 12. Repeat step 1 until all sum terms contain all variables. Ex: Convert the following Boolean expression into standard POS form: A B C B C D A B C D

56

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Standard Forms of Boolean Expressions

Converting Standard SOP to Standard POS
Step1: Determine the binary numbers for each literal. Step2: Determine the absent binary numbers. Step3: Write the binary numbers from Step 2 in equivalent term in opposite standard Ex: Convert the following SOP expression to an equivalent POS expression

A BC ABC ABC A BC ABC

57

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

58

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Converting Standard SOP & Standard POS to Truth Table Format

SOP- equal to 1 only if at least one of the product terms is equal to 1. POS-equal to 0 only if at least one of the sum terms is equal to 0.

59

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Converting Standard SOP to Truth Table Format

A 0 0 0 0 1 1 1 1
A B C A B C A B C

B 0 0 1 1 0 0 1 1

C 0 1 0 1 0 1 0 1

Y 0 1 0 1 0 1 0 0

ABC ABC A BC

Ex: Develop the truth table for the

Y

Y ABC ABC ABC

expression and draw the logic circuit.

60

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Converting Standard POS to Truth Table Format

A 0 0 0 0 1 1 1 1
B C

B 0 0 1 1 0 0 1 1

C 0 1 0 1 0 1 0 1

Y 1 1 0 1 0 1 1 0

A B C

A B C A B C

Ex: Develop the truth table for and draw logic circuit.

61

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Minterm and Maxterm

minterm

y c ab abc
6 literals in 3 terms

Minterm in SOP format Input=a,b,c Output=y

maxterm

y (b c ) ( a b ) ( a b c )
7 literals in 3 terms

Maxterm in POS format Input=a,b,c Output=y

62

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Minterm and Maxterm

Writing Boolean expression using decimal list shorthand notation
a 0 0 0 0 1 1 1 1 b 0 0 1 1 0 0 1 1 c 0 1 0 1 0 1 0 1 Y 0 1 0 1 0 0 1 1

0 1 2 3 4 5 6 7

Minterm expression (SOP):

Y f (a, b, c) abc abc abc abc (1,3,6,7)

Maxterm expression (POS):

Y f (a,b,c) (abc)(abc)(abc)(abc) (0,2,4,5)

63

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

The Karnaugh Map (K-map)

Is an array of cells in which each cell represents a binary value of the input variables. Can be used for expressing two, three, four, and five variables. Mapping a nonstandard SOP expression: A Boolean expression must first be in standard form before putting in Karnaugh map.

64

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

The K-Map SOP Minimization

Grouping/looping the 1s
Each cell in a group must be adjacent, this included wrap-around adjacent. Maximize the size of the groups, but minimize the number of groups. A group must contain either 1,2,4,8,16 cells (power of 2). Overlapping groups is allowed.

Determine the minimum SOP expression

Each group of cells containing 1s creates one product terms composed of all variables that occur either uncomplemented or complemented. Variables with both uncompleted and complemented within the group are eliminated.

65

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

66

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

K-Map for (a) 2, (b) 3 and (c) 4 variables

Looping Groups of Two (Pairs)

67

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Looping Group of Four (Quads)

68

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Looping Group of Eight (Octets)

69

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

2 variables K-map
A two variable K-map with their truth table which is showing product terms of each line as shown below
A B Product term

0 0 1 1

0 1 0 1

AB

AB AB

AB

AB
AB

AB

AB

Ex: Map the following SOP expression of two

variables.
70

AB AB AB
Kompetensi Teras Kegemilangan

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

2 variables K-map

71

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

3 Variable K-map
A B C Product terms

C
ABC
ABC ABC

0 0 0 0 1 1 1 1

0 0 1 1 0 0 1 1

0 1 0 1 0 1 0 1

A BC

AB
AB
AB

A BC
ABC
A BC

ABC
ABC ABC
A BC

ABC ABC ABC

AB

ABC

ABC

Ex: Map the SOP expression ABC ABC ABC ABC ABC of three variables.

72

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

3 Variable K-map

73

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

3 Variable K-map

3-Variable Karnaugh Map

UNIVERSITI TEKNIKAL MALAYSIA MELAKA
Kompetensi Teras Kegemilangan

3 Variable K-map

3-Variable Example
UNIVERSITI TEKNIKAL MALAYSIA MELAKA
Kompetensi Teras Kegemilangan

4 Variable K-map

76

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

4 Variable K-map

4-Variable Karnaugh Map

UNIVERSITI TEKNIKAL MALAYSIA MELAKA
Kompetensi Teras Kegemilangan

4 Variable K-map

4-Variable Example
UNIVERSITI TEKNIKAL MALAYSIA MELAKA
Kompetensi Teras Kegemilangan

4 Variable K-map
Ex: Map the following four variable SOP expressions:

ABC D A BC D A BC D ABC D ABC D A BC D ABCD A BCD ABCD

79

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

5 Variable K-map

5-Variable Karnaugh Mapping

UNIVERSITI TEKNIKAL MALAYSIA MELAKA
Kompetensi Teras Kegemilangan

More examples

81

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

More examples

82

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

More examples

83

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

More examples

84

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

More examples

85

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

More examples
Use a K-map to simplify the following Boolean function:
F(A,B,C) = m(0,2,3,7)

BC A 00 0

00
0

01
1

11
3

10
2

AB

AC
01 1

1
4 5

1
7

1
6

BC

86

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

More examples
Use a K-map to simplify the following Boolean function:
F(A,B,C,D) = M(0,1,2,4,9,11,15) F(A,B,C,D) = m(3,5,6,7,8,10,12,13,14)
CD AB 00 01 11 10 1
8

00
0

01
1

11
3

10
2

CD AB 00 01 11 10

00
0

01
1

11
3

10
2

CD AB 00 01 11 10

00
0

01
1

11
3

10
2

1
4 5 7 6 4 5

1
7 6 4 5

1
7 6

1
12 13

1
15

1
14 12

1
13

1
15

1
14 12

1
13

1
15

1
14

1
9 11

1
10

1
8

1
9 11

1
10

1
8

1
9 11

1
10

Prime Implicants

Essential Prime Implicants

Final Expression

F(A,B,C,D) = BC'D + AD' + A'CD + BCD'

87

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Dont Care On Karnaugh Map

Dont Care conditions
Eg: in BCD code which have 6 invalid combination: 1010, 1011, 1100, 1101, 1110, and 1111. A X is placed in the cell. It can be treat as either 1 or 0. When grouping, the Xs, it can be treated as 1s to make a larger grouping.

88

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Dont Care On Karnaugh Map

Dont Care conditions Eg: in BCD code which have 6 invalid combination: 1010, 1011, 1100, 1101, 1110, and 1111. A B C D Y
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 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 0 0 0 1 0 1 1 1 0 0 x x x x x x

89

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Dont Care On Karnaugh Map

90

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

The K-Map POS Minimization

Determine the minimum SOP expression
Determine the binary value of each sum term in the standard POS expression. As each sum term is evaluated, place a 0 on the Karnaugh map in the corresponding cell.

91

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

The K-Map POS Minimization

Ex: Map the following standard POS expression on a Kmap.

1)

A B C A B C A B C A B C A B C

2)

A B C D A B C D A B C DA B C D A B C D

92

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Example:
1)

C D CD
AB AB
AB
0 0 0 0 0 1 1 0

CD C D
0 1 1 1 1 0 0 0

2)

CD
AB AB
AB

C D CD
1 1 0 1 0 1 0 0

CD
0 1 1 1

0 0 0 1

AB

AB

93

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

Example:
3) 4)

C D CD CD C D
AB AB

C D CD CD C D
AB AB

0 1 x 0

1 0 x 1

1 0 x x

1 0 x x

1 1 x 1

0 0 x 0

1 1 x x

0 0 x x

AB
AB

AB
AB

94

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan

QUIZ 2 (Chapter 2)
A B C X

0 0 0 0 1 1 1 1

0 0 1 1 0 0 1 1

0 1 0 1 0 1 0 1

0 0 1 1 1 0 1 1

1. Find Boolean Expression in SOP and POS form from the truth table? 2. Simplify the SOP Expression above using Boolean Algebra? 3. Minimize the SOP Expression using Karnaugh Map. 4. Draw the simplified circuit.
UNIVERSITI TEKNIKAL MALAYSIA MELAKA
Kompetensi Teras Kegemilangan

QUIZ 2 (Chapter 2) - Answer

1. > ABC ABC ABC ABC ABC
( A B C )( A B C )( A B C )

2. > 3. > 4. >

B AC B AC

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

Kompetensi Teras Kegemilangan