1 / 26

Multiplexers

Multiplexers. Functional Description and Symbols. Where, N = {1, 2, 3, ….. , ∞}. Where, N = {1, 2, 3, ….. , ∞}. Where, N = {1, 2, 3, ….. , ∞}. Where, n = 2 (m+1) – 1 m = {0,1, 2, 3, ….. , ∞}. Operation of a 2-to-1 line Mux. Operation of a 2-to-1 line Mux.

mulan
Download Presentation

Multiplexers

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  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, ….. , ∞}

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

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

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

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

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

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

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

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

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

  15. Operation of a Multiplexer Tree

  16. Operation of a Multiplexer Tree

  17. Operation of a Multiplexer Tree

  18. Operation of a Multiplexer Tree

  19. Operation of a Multiplexer Tree

  20. Implementing Functions Using Multiplexers

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

  22. Multiplexer Universality for Logic Realization Implementation directly from truth tables • f(a, b, c) = a’b’c + ab for ( 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

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

More Related