COMPUTER ORGANIZATION AND

ARCHITECTURE
IKSAN BUKHORI, M.PHIL.
SUPPLEMENTARY: BINARY AND DECIMAL
REPRESENTATION
DECIMAL  BINARY

 Decimal  Binary  Binary  Decimal

Remainder 1101
13
1 0
:2
6
0
1× 2 =1
1
:2
:2
3
1 0 ×2 =0
2
:2
1 1 1× 2 =4
3
0 1× 2 =8
 
CANONICAL FORM OF BOOLEAN EXPRESSION
(CONT’D)
MINTERM AND MAXTERM

 A Minterm mi is a complete argument vector (a,b,c,...,x) for which a Boolean function f(a,b,c,...,x)
delivers the value ‘1’ in SOP canonical form
 A Maxterm Mi is a complete argument vector (a,b,c,...,x) for which a Boolean function f(a,b,c,...,x)
delivers the value '0’ in POS canonical form
MINTERMS FROM VALUES

Using variable values, we can write the minterms as:

1. If the variable value is 1, we will take the variable without its complement.
2. If the variable value is 0, take its complement.

 For example, if A = 1, B = 0, and C = 0, the minterm form is AB’C’

SHORTHAND NOTATION FOR MINTERMS

We know that, when Boolean variables are in the form of minterm, the variables will appear in the product. There are
the following steps for getting the shorthand notation for minterm.
• In the first step, we will write the term consisting of all the variables
• Next, we will write 0 in place of all the complement variables such as ~A or A'.
• We will write 1 in place of all the non-complement variables such as A or b.
• Now, we will find the decimal number of the binary formed from the above steps.
• In the end, we will write the decimal number as a subscript of letter m(minterm). Let's take some example to
understand the theory of shorthand notation
EXAMPLES: SHORTHAND NOTATION FOR MINTERM

 Example 1: Minterm = AB'

• First, we will write the minterm: Minterm = AB'
• Now, we will write 0 in place of complement variable B’. Minterm = A0
• We will write 1 in place of non-complement variable A. Minterm = 10
• The binary number of the minterm AB' is 10. The decimal point number of (10)2 is 2. So, the shorthand notation of
AB’ is Minterm = m2
 Example 2: Minterm = AB'C'
• First, we will write the minterm: Minterm = AB'C'
• Now, we will write 0 in place of complement variables B' and C’. Minterm = A00
• We will write 1 in place of non-complement variable A. Minterm = 100
• The binary number of the minterm AB'C' is 100. The decimal point number of (100) 2 is 4. So, the shorthand notation
of AB'C’ is Minterm = m4
SIGMA NOTATION FOR MINTERMS (SOP)

 Example:
MAXTERMS FROM VALUES

Using variable values, we can write the maxterms as:

1. If the variable value is 0, we will take the variable without its complement.
2. If the variable value is 1, take its complement.

 For example, if A = 1, B = 0, and C = 0, the maxterm form is A’+B+C

SHORTHAND NOTATION FOR MINTERMS

We know that, when Boolean variables are in the form of minterm, the variables will appear in the product. There are
the following steps for getting the shorthand notation for minterm.
• In the first step, we will write the term consisting of all the variables
• Next, we will write 1 in place of all the complement variables such as ~A or A'.
• We will write 0 in place of all the non-complement variables such as A or b.
• Now, we will find the decimal number of the binary formed from the above steps.
• In the end, we will write the decimal number as a subscript of letter M(minterm). Let's take some example to
understand the theory of shorthand notation
EXAMPLES: SHORTHAND NOTATION FOR MINTERM

 Example 1: Maxterm = A+B'

• First, we will write the maxterm: Maxterm = A+B'
• Now, we will write 1 in place of complement variable B’. Maxterm= A+1
• We will write 0 in place of non-complement variable A. Maxterm = 0+1
• The binary number of the minterm A+B' is (0+1). The decimal point number of (01)2 is 1. So, the
shorthand notation of A+B’ is Maxterm = m1
 Example 2: Maxterm= A+B’+C'
• First, we will write the maxterm: Maxterm = A+B’+C'
• Now, we will write 1 in place of complement variables B' and C’. Maxterm = A11
• We will write 0 in place of non-complement variable A. Maxterm = 011
• The binary number of the Maxterm A+B’+C' is 011. The decimal point number of (011)2 is 3. So, the
shorthand notation of A+B’+C’ is Maxterm = m3
PI NOTATION FOR MAXTERMS (POS)

 Example:
SIMPLIFICATION OF BOOLEAN EXPRESSION
AND KARNAUGH MAP
EXAMPLE 1: ALGEBRAIC SIMPLIFICATION

 Try to simplify the following logic circuit

 First of all, by tracing through all wires, we can see that the output is
EXAMPLE 1: ALGEBRAIC SIMPLIFICATION

 Using deMorgan’s law we can simplify this to be

 Using Boolean algebra we can simplify further

 This now is the simplest form of the original expression. The logic circuit thus looks as follows
EXAMPLE II: ALGEBRAIC SIMPLIFICATION

 Simplify the expression

Solution:
HOW TO DESIGN LOGIC CIRCUIT

Boolean
Logic Spec Truth Table Simplify
Formula
HOW TO DESIGN LOGIC CIRCUIT: EXAMPLE

 Design a logic circuit with three inputs A, B, and C and whose output is HIGH only when the majority of
the inputs are HIGH
KARNAUGH MAP

 Karnaugh Map (or as what is commonly called in the business, K-map), is a tool that can make algebraic
simplification of logic expression easier and more structured
 It is also commonly used to convert a truth table to its corresponding logic circuit
 Theoretically, it can be used for any number of input variables, but its practical usefulness is limited to
five or six input variables
THANK YOU