1. Say we had the following function: F =!(!A*B*!C+A*!B*C*!D) a. Draw a schematic that matches the...
a) Draw SR latch impeltation in NOR gates provied function table b) Show how D latch (transprent) can be made from NOR gate. SR latch is transprent when it comes to storing data. c) What is limitation of D latch in terms of storing data ? what does it achive for digital terms d) Design a D flip flop that is -ve edge trigged using master slave combination of D latches designed in b) Inverters may be needed.
Problem 3. a. Draw a NAND logic diagram that implements the complement of the following function: F(A, B, C, D) = ∑(0,1,2,3,6, 10, 11, 14). b. Use Karnaugh Map to minimize the function F(w, x, y, z) = ∑ (0,2,5,7,8, 10, 12, 13, 14, 15)
3. Design the CMOS gate that implements the following function OUT- AB (a) Draw the circuit schematic without any output inverter. (b) Size all the transistors in this circuit such that TR 3Tr. The minimum geometry is W. 3. Design the CMOS gate that implements the following function OUT- AB (a) Draw the circuit schematic without any output inverter. (b) Size all the transistors in this circuit such that TR 3Tr. The minimum geometry is W.
need explain... 5. Implement the function f(a,b,c,d) = 2 m(0,1,3,4,5,7,9,10,11,13) a. (3 points) using an 8-to-1 multiplexer and as few inverters as possible, and b. (4 points) using a 4-to-1 multiplexer and as few additional gates as possible.
(18 pts) Given the Boolean function F(A, B, C, D) = Σ (0, 1, 2, 3, 4, 5, 7, 8, 10, 12, 14) a. Draw a Karnaugh Map. b. Identify the prime implicants of F. c. Identify all Essential Prime Implicants of F. d. Derive minimal SOP expressions for F e. Derive minimal POS expressions for F. f. Assume each inverter has a cost of 1, each 2-input NAND gate has a cost of 2, and 4-input NAND gate has...
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
1- Given the following Boolean function in product of sums (Maxterms); F(b,c,d) = (b+c+d) (b+c+d) (b +c+d) (b+c+d) i- Use De Morgan's rule to convert Finto F ii- Complete the truth table (Table 1) iii- Simplify Fusing Boolean algebra iv- Count the number of gates in the original Fand insert them in Table.2 V- Count the number of gates in the simplified F (convert the simplified F'in part iii back to F) and insert them in Table.3 i- F' Table.1...
The following logic function is given as a sum of minterms F(A,B,C,D) = Σ A,B,C,D(0,1,4,5,9,11,13,15) A) Find out SOP for the function. B) List all the input pair(s) where we can observe a timing hazard from the K-map. C) Draw the timing hazard diagram for one of the input pair. Assume ALL gate delays are equal. Identify the timing hazard from the diagram. D) Write the expression of an equivalent logic function in which the timing hazard(s) is/are eliminated.
I am confused about how to solve (b) (c) (d) (4) (Interpolating polynomials) Say we want to find a polynomial f(x) of degree 3, satisfying some interpolation conditions. In each case below, write a system of linear equations whose solutions are (ao, a1, a2, az). You don't need to solve. (a) We want f(x) to pass through the points(1,-1), (1, 2), (2,1) and (3,5). (b) We want f(x) to pass through (1,0) with derivative +2 and (2,3) with derivative-1 (c)...
(1) Let's say that you are trying to find a formula for the solution to: ay'' + by' + cy = f(t), y(to) = ko, y' (to) = k1 with a, b, c, ko, and ki specified, and that the formula should be valid for any continuous forcing function f(t). In trying to find the formula, you have solved for the Laplace Transform of y(t), Y(s), in terms of the Laplace Transform of f(t), F(s), and have found: Y (s)...