6.5.4.1 Consider the following Boolean function. It is required
to implement it using 8x1 MUX and
4x1 MUX
F(x, y, z) = x' y' z' + x' y z' + x y' z + x y z
Solution:
F(x, y, z) = x' y' z' + x' y z' + x y' z + x y z
Now we have to implement the above Boolean function uisng 8×1 MUX and 4×1 MUX.


First, check if the function can be simplified:
Factor out common terms:
Since :
This simplifies to:
An 8×1 MUX has 3 select lines (for 8 inputs) and can directly implement any 3-variable function.
Truth Table for :
| 0 | 0 | 0 | 1 | () |
| 0 | 0 | 1 | 0 | |
| 0 | 1 | 0 | 1 | () |
| 0 | 1 | 1 | 0 | |
| 1 | 0 | 0 | 0 | |
| 1 | 0 | 1 | 1 | () |
| 1 | 1 | 0 | 0 | |
| 1 | 1 | 1 | 1 | () |
MUX Configuration:
Select Lines: , , .
Input Lines (D0–D7):
A 4×1 MUX has 2 select lines, so we must reduce the function to 2 variables by fixing one variable as a select line.
Choose and as Select Lines (, ):
The remaining variable determines the MUX inputs.
Express in terms of for each combination:
:
:
:
:
MUX Configuration:
and : Connect to (NOT ).
and : Connect directly to .
Input Lines (D0–D3):
Logic for Inputs:
8×1 MUX: Directly implement using the truth table (inputs = 1, 0, 1, 0, 0, 1, 0, 1).
4×1 MUX: Use as select lines and as inputs.
6.5.4.1 Consider the following Boolean function. It is required to implement it using 8x1 MUX and...
Multiplexer Example Implement the following Boolean function using a 4x1 Mux; F(x,y,z) = Σ (1,2,6,7) Decoder Example Implement the following functions for a full adder using decoder; S(x,y,z) = Σ (1,2,4,7) C(x,y,z) = Σ (3,5,6,7) Implement the following Boolean function; F(x,y,z) = Σ (0,2,3,7): Using; 1. Two 2x4 decoders and logic gates 2. One 4x1 multiplexer Decoder . Draw the truth table for the function to be implemented. . Pick the terms for output. . Derive appropriate logic to combine terms. . Use two 2x4 decoders to make one3x8 decoder. . Pay attention to fact...
Build the Boolean function F(W, X, Y, Z) = ∑ (1,3,4,11,12,13,14,15) using a) a 8x1 multiplexer and external gates. b) a 4x1 multiplexer and external gates. c) two 3-to-8 decoders with enables and external gates with a maximum of 4 inputs.
2. How to implement 4x1 MUX using 2x1 MUX?
(a) Implement the following Boolean functions using decoders. i) F1 = x'y z' + x Z ii) F2 = x y' z' + x' y (b) Implement the following Boolean function using multiplexers. i) F1 (a, b, c, d) = Σ(1, 3, 4, 11, 12, 13, 14, 15) ii) F2 (a, b, c, d)= Σ(1, 2, 5, 7, 8, 10, 11, 13, 15)
Implement a Full Adder using: A. A 4x1 MUX B. A 2x1 MUX ( digital logic design)
Implement the Boolean expression F (A, B, C, D) = summation (1, 3, 4,7, 8,12, 13, 14, 15) using 4X1 mux.
F(ABCD)=£(1,3,4,11,12,13,14,15) using 8x1 MUX with A as an input variable and and BCD as selectors
Consider the Boolean function F1 = X' · Z + X ' · Y · Z + X · Y ' + X · Y' · Z (a) Implement F1, in the form as given, using 2-input ANDs, 2-input ORs and NOT gates. How many gates did you use? (b) Simplify F1 using Boolean algebra identities. Show all the steps & the identities used at each step. (c) Implement the simplified form of F1 using 2-input ANDs, 2-input ORs and...
Q# 7 (3 marks) Implement the Boolean function F(K,A,B,C,D) shown below using a single decoder of a suitable size and multi- input OR gate and inverter. Note the order of the variables in the function F and use the same order when implementing input to the decoder. + (4-1) MUX (2-1) FIK.A,BC,D) MUX + 0 + - Si So BUD
3. (10 pts, Ch 2 & 6.2] For the 8X1 MUX below, complete the following: a. [4 points, Ch 2] Fill in the truth table. 8x1 ABCD | 0 0 0 0 0 0 1 0 0 101 0011 0 1 0 0 0 1 0 1 0 1 100 01111 1000 1 0011 1010 1 0 1 1 1100 11 01 AB.CD) MUX s2 s1 s0 b. (3 points, Ch 6.2] Using the blank K-map below, provide the Minimized...