Notes on Multiplexers as general-purpose logic (cont’d)
Sometimes it can be reduced even further to a 2n-k:1 multiplexer (kɭ) but there is no standard method to determine this.
F(A,B,C) = m0 + m2 + m6 + m7 = A'B'C' + A'BC' + ABC' + ABC = A'B'(C') + A'B(C') + AB'(0) + AB(1) = A'(C') + A(B)