Switching functions

The postulates and sets of Boolean logic are presented in generic terms without the elements of K being specified In EE we need to focus on a specific Boolean algebra with K = {0, ! This formulation is referred to as "Switching #lgebra$

Switching functions
#%iomatic definition&

X 1 X = 0 X = 0 X '=1 00 = 0 11 = 1 0 1 = 1 0 = 0

Switching functions
'ariable& can ta(e either of the )alues *0+ or * + ,et f-% , %., / %n0 be a switching function of n )ariables There e%ist .n wa1s of assigning )alues to % , %., / %n 2or each such assignment of )alues, there e%ist e%actl1 . )alues that f-% , %., / %n0 can ta(e 2n 2 Therefore, there e%ist switching functions of n )ariables

Switching functions
2or 0 )ariables there e%ist how man1 functions3

2 =2

20

f0 = 04

f =

2or )ariable a there e%ist how man1 functions3 21

2 =4

f0 = 04

f = a4

f. = 54

f6 = 4

Switching functions
2or n = . )ariables there e%ist how man1 functions3 2

2 = 16
2

The 7 functions can be represented with a common e%pression&

fi -a, b0 = i6ab 8 i.ab 8 i 5b 8 i05b where the coefficients ii are the bits of the binar1 e%pansion of the function inde% -i0 0 = -i6i.i i00. = 0000, 000 , / 0,

Switching functions

Switching functions

Truth tables
9 # wa1 of specif1ing a switching function 9 ,ist the )alue of the switching function for all possible )alues of the input )ariables 9 2or n = )ariables the onl1 non:tri)ial function is 5

Switching functions
Truth tables of the ; functions for n =
a 0 f(a) = 0 0 0 a 0 f(a) = a 0 a 0 0 f(a) = a 0 f(a) = 1

Truth tables of the #<= and >? functions for n=.

Boolean operators
@omplement& #<=& >?& A -opposite of A0 binar1 operators, described ABC functionall1 b1 truth tableD A8C

#lternate Eate S1mbols

X + Y = [( X + Y )' ]' = [ X ' Y ' ]'

#lternate Eate S1mbols

Switching functions
Truth tables
9 @an replace " $ b1 T "0$ b1 2

#lgebraic forms of Switching functions

Sum of products form -S>F0

Froduct of sums form -F>S0

,ogic representations& -a0 truth table -b0 boolean eGuation

from 1-rows in truth table:

2 = A+C+H+ 8 A+CH 8 AC+H+ 8 ACH+ 8 ACH 2 = C+H+ 8 AC 8 CH

from 0-rows in truth table:

2 = -A 8 C 8 H+0-A 8 C+ 8 H0-A+ 8 C 8 H+0 2 = -A 8 C+ 8 H0-C 8 H+0

=efinitions&
Literal ::: a )ariable or complemented )ariable -eDgD, A or AI0 product term ::: single literal or logical product of literals -eDgD, A or AIC0 sum term ::: single literal or logical sum of literals -eDgD AI or -AI 8 C00 sum-of-products ::: logical sum of product terms -eDgD AIC 8 CIH0 product-of-sums ::: logical product of sum terms -eDgD -A 8 CI0-C 8 H00 normal term ::: sum term or product term in which no )ariable appears more than once -eDgD AICH but not AICHA or AICHAI -A 8 C 8 HI0 but not -A 8 C 8 HI 8 A00 minterm ::: normal product term containing all )ariables -eDgD ACHI0 maxterm ::: normal sum term containing all )ariables -eDgD -A 8 C 8 HI00 canonical sum ::: sum of minterms from truth table rows producing a canonical product ::: product of ma%terms from truth table rows producing a 0

Truth table )sD minterms J ma%terms

Switching functions

Switching functions

Switching functions

Switching functions

The order of the )ariables in the function specification is )er1 important, because it determines different actual minterms

Truth tables
Ei)en the S>F form of a function, deri)ing the truth table is )er1 eas1& the )alue of the function is eGual to " $ onl1 for these input combinations, that ha)e a corresponding minterm in the sumD 2inding the complement of the function is Kust as eas1

Truth tables

Truth tables and the S>F form

Linterms
Mow man1 minterms are there for a function of n )ariables3
.n

Nhat is the sum of all minterms of an1 function 3 -Ose switching algebra0
2 n 1 i =0

= f ( x1 , x2 ,..., xn ) + f ( x1 , x2 ,..., xn ) = 1

La%terms
# sum term that contains each of the )ariables in complemented or uncomplemented form is called a ma%term # function is in canonical Froduct of Sums form -F>S0, if it is a product of ma%terms

f ( A, B, C ) = ( A + B + C ) ( A + B + C )( A + B + C )( A + B + C )

La%terms

La%terms

#s with minterms, the order of )ariables in the function specification is )er1 importantD If a truth table is constructed using ma%terms, onl1 the "0$s are the ones included
9 Nh13

La%terms

La%terms

It is eas1 to see that minterms and ma%terms are complements of each otherD ,et some minterm mi = a b c 4 then its complement

mi = a b c = ( a + b + c ) = M i

La%terms
Mow man1 ma%terms are there for a function of n )ariables3
.n

Nhat is the product of all ma%terms of an1 function3 -Ose switching algebra0

M
i =0

2 n 1

= f ( x1 , x2 ,..., xn ) f ( x1 , x2 ,..., xn ) = 0

=eri)ation of canonical forms

=eri)ation of canonical forms

=eri)ation of canonical forms

=eri)ation of canonical forms

=eri)ation of canonical forms

@anonical forms
SOP Sum of minterms POS Product of maxterms

@ontain each )ariable in either true or complemented form 2n minterms 02n-1 2n maxterms 02n-1 Variable true if bit = 1 Variable true if bit = 0 Complemented if bit =0 Complemented if bit =1

m0 = a b c
iS

M0 = a + b + c f = mk
kS

f = mi

@anonical forms
SOP POS

f = mi
iS

f = mk
kS

If row i of the truth table If row k of the truth is = 1, then minterm mi table is = 0, then maxterm Mi is included is included in f (iS) in f (kS)

mi = M i

M i = mi

@anonical forms
SOP The sum of all minterms = 1 If POS The product of all maxterms = 0 If

f = mi
iS

f = mk
Then
i kS

Then

f =

i U S

m { }

f =

k U S

m { }

Nhere U is the set of all .n inde%es

Shortcut notation& 2 = A+C+H+ 8 A+CH 8 AC+H+ 8 ACH+ 8 ACH = -0, 6, ;, 7, P0 2 = -A 8 C 8 H+0-A 8 C+ 8 H0-A+ 8 C 8 H+0 = - , ., Q0

<ote eGui)alences& -0, 6, ;, 7, P0 = - , ., Q0 R -0, 6, ;, 7, P0S+ = - , ., Q0 = -0, 6, ;, 7, P0 R - , ., Q0S+ = -0, 6, ;, 7, P0 = - , ., Q0

Incompletel1 specified functions

Incompletel1 specified functions

Incompletel1 specified functions

Incompletel1 specified functions

Incompletel1 specified functions