Implement the function F (x,y,z)= (not x)(not z)+ xy using
a. One 4-to-1 multiplexer and any additional inverters. Show your truth-table and justify your choice of select inputs.
b. One 2-to-1 multiplexer and the minimal number of gates. Show the truth table used to derive your circuit.
Implement the function F (x,y,z)= (not x)(not z)+ xy using a. One 4-to-1 multiplexer and any...
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...
Question #6 6 points Implement the function from the truth table below (X, Y, Z are inputs. F is the output) using a) An 8:1 multiplexer b) A 4:1 multiplexer and one inverter c) A 2:1 multiplexer and two other logic gates Y z F 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 1 -
Design a 6 to 1 multiplexer (inputs A,B,C,D,E,F,S[2:0] and output Z) (a) Implement the 6 to 1 multiplexer using only CMOS NORs, NANDs and inverters. ( b) Implement the 6 to 1 multiplexer using only CMOS transmission gates and inverters. (c) Which approach is better and why?
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.
d) Let F(x, y)-xy'+x'y. a) 2. Construct a truth table for F. ND, OR, and NOT gates. b) Design a circuit with inputs x and y to implement F(x, y) using only AND, OR c) Use DeMorgan's law to find the complement of F, ie, find F'(x, y). d) Show that F'(x,x)-1.
Q2: 1. Proof this Boolean expression. Use Boolean Algebra (X+Y). (Z+W).(X'+Y+W) = Y.Z+X.W+Y.W 2. For this BF F(X,,Z)=((XYZ)(X +Z))(X+Y) • Design the digital circuit Derive the Boolean Function of X, Y, Z. Simplify the Function Derive the truth table before and after simplification. Derive the BF F(X,Y,Z) as Maxterms (POS) and miterms (SOP). Implement the F(X,Y,Z) after simplification using NAND gates only. Implement the F(X,Y,Z) after simplification using OR NOR gates only.
QUESTION 1 [TOTAL MARKS:25] A manufacturing process has four sensors labelled W.X, Y. and Z. The system should sound an alarm if any of the following conditions arise: • W, X, Y, Z are not activated at the same time. • X, Y, and Z are not activated and W is activated at the same time. • Wand Y are not activated, and X and Z are activated at the same time. • W, X, and Z are not activated,...
Implement the function f (A,B,C,D) summation(m(0,2,5,8,12,13,14,15)) using: a. A 4-to-1 multiplexer, and external gates. Choose inputs A and B as the select lines. b. A 4-to-16 decoder and OR gate c. A PLA
Implement the Boolean function F(w,x,y,z) = Σm(3, 4, 5, 1 1, 12, 13, 14, 15) using a minimum number of NAND gates only. Write the minimal logic expression (no need to draw the circuit).
(a) The truth table below shows a certain function F(P,Q,R,S). Implement the function F using an 8:1 multiplexer, without any other logic gate. Only the constants 0 and 1, and the literals (but not their complements) are available. Fill in the inputs in the multiplexer diagram. (b). Implement the function F using a 24 decoder and a 4:1 multiplexer, and at most one logic gate. Only the constants 0 and 1, and the literals (but not their complements) are available....