1. Multiplexers

2. Functional Description and Symbols

3. Where, N = {1, 2, 3, ….., ∞}

4. Where, N = {1, 2, 3, ….., ∞}

5. Where, N = {1, 2, 3, ….., ∞}

9. Where, n = 2 (m+1) – 1 m = {0,1, 2, 3, ….., ∞}

10. Operation of a 2-to-1 line Mux

13. Operation of a 4-to-1 line Mux

18. Operation of a Multiplexer Tree

23. Implementing Functions Using Multiplexers

24. Multiplexer Universality for Logic Realization f(a, b, c) = a’b’c + ab Implementation directly from truth tables

25. Multiplexer Universality for Logic Realization f(a, b, c) = a’b’c + abfor ( a, b ) = ( 0, 0 )  f = c for ( a, b ) = ( 0, 1 )  f = 0 for ( a, b ) = ( 1, 0 )  f = 0 for ( a, b ) = ( 1, 1 )  f = 1 Implementation directly from truth tables

26. Multiplexer Universality for Logic Realization f(a, b, c) = a’b’c + abfor a == 0  f = b’. c for a == 1  f = ( b. c’ ) + ( b. c ) = b Implementation directly from truth tables