4-1 Bit Multiplexer (1) (1)

4 to 1 Multiplexer. PROCEDURE:- ● At first choose the multiplexer, by find out the number of selection lines. o No. of selection lines (n) = no. of inputs – 1 o This ‘1’ is for data line. ● Since multiplexer is: o MUX 2n x 1 ● Now implement the Boolean function by using multiplexer. OBSERVATION/RESULTS and DISCUSSION:- 1. Make the circuit diagram. 2. Show the input implementation table for the multiplexer. 3. Show the multisim simulation for the function given below: F(A,B,C,D)= π (1,3,4,11,12,13,14,15)