Realizing the following functions using only 8-to-1 multiplexer: F_1(x, y, z) = Sigma m(0, 2, 3,...
1. Read Only Memory Design a ROM that implements the following four Boolean functions: A(x,y,z)-2m(2, 3, 4, 5) B(x,y,z)-2m(0, 1, 2, 6) C(x,y,z) -2m(0, 3, 4, 5, 7) D(x,y,z) -2m(3, 5, 6) Make sure you are using an appropriately sized decoder, all lines are clear, and all "connections" are clearly marked.
1. Read Only Memory Design a ROM that implements the following four Boolean functions: A(x,y,z)-2m(2, 3, 4, 5) B(x,y,z)-2m(0, 1, 2, 6) C(x,y,z) -2m(0, 3, 4, 5, 7) D(x,y,z)...
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.
using discrete structures
3. Consider the function F(x, y, z) for x, y, z z 0 defined as follows: a. F(x, y, 0)-y+1 b. F(x, 0, 1)-x c, F(x, 0, 2) = 0 d. F(x, 0, z+ 3)-1 e. F(x, y, z)-F(x, F(x, y-1, z), z-1) Using Induction, prove the following a. F(x, y, 1)-x +y b, F(x, y, 2) = xy c. F(x, y, 3)-xy
3. Consider the function F(x, y, z) for x, y, z z 0 defined...
1. Find 8 different 2-level minimized circuits to realize each of the following functions. 1. F(W,X,Y,Z) = {m (2,4,6,7,12,14,15) 2. G(W,X,Y,Z) = (x + Y' + Z) (X' + Y + Z) W • Using algebraic techniques • Using network conversion
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.
Consider these three moment generating functions, for X, Y and Z: (5 points each) m (t)=W-3 m, (t)=e + m,(t)=eW-7 a. What is the mean of X? b. What is the mean of Y? c. What is the mean of Z? d. What is the variance of X? e. What is the variance of Y? f. What is the variance of Z? Consider independent random variables X and Y with the following pmfs: y=1 (0.5 x=1 S(x)= {0.5 x =...
Simplify the following Boolean functions using four-variable maps: F(w, x, y, z) = Σ (1, 4, 5, 6, 12, 14, 15) F(w, x, y, z) = Π (0, 1, 4, 5, 6, 7, 8, 9) AB’C + B’C’D’ + BCD + ACD’ + A’B’C+ A’BC’D (A xor B)’ (C xor D)
Computer architecture
Having the next Boolean functions: F1(x,y,z)-П (1, 3, 5) . F2(x,y,z)-Σ (0, 2, 4, 5) . 1. Make one logic gate design circuit, using AND, OR and NOT logic gates (20 points). 2. Design two 4-to-1 selectors, one for each Boolean function (20 points) 3. Design one 3-to-8 decoder to solve both Boolean functions (20 points) 4. Design a 8x2 ROM to solve both Boolean functions (20 points) 5. Design a 3x5x2 PLA to solve both Boolean functions...
Implement the logic equation F(W, X, Y, Z) = Σ(0, 1, 5, 7, 11, 13, 15) using an 8:1 Multiplexer
Implement B(x,y,z) = y’z + x’y’z’ + xz using a 2^3x 1 multiplexer.