Multiplexers
Download
1 / 26

Multiplexers - PowerPoint PPT Presentation


  • 60 Views
  • Uploaded on

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.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' Multiplexers' - mulan


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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript


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
















Multiplexer universality for logic realization
Multiplexer Universality for Logic Realization

Implementation directly from truth tables

  • f(a, b, c) = a’b’c + ab


Multiplexer universality for logic realization1
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


Multiplexer universality for logic realization2
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


ad