Prévia do material em texto
Step 1 of 5 4.06DP To simplify the Boolean function or logic function the following switching algebra theorems are used: T1=X+0=X T2=X+1=1 T3=X+X=X T4=(X)'=X T5=X+X'=1 T7 Step 2 of 5 (a) Steps for simplifying the logic function, using switching algebra theorems as follows, To take the parenthesize of the above function, multiply with function inside parenthesize as shown, = (According to T5') (According to T2') =0+0+0+0 =0 Thus, the simplified value of the logic function F is 0 Step 3 of 5 (b) Steps for simplifying the logic function, using switching algebra theorems as follows, (According toT2 and T5) (According toT2) Thus, the simplified logic function F is Step 4 of 5 (c) Steps for simplifying the logic function, using switching algebra theorems as follows, (According to T2) = Further simplification yields, (According to T2) Thus, the simplified function F is Step 5 of 5