Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Solved Assignments
Asked Questions
Answered Questions
Realize the BCD to a Gray code converter specified by y1 = x1 .
Consider the switching function f(x1, x2, x3) defined by the set of decimal indices corresponding to 1-minterms f(1) = {0, 4, 6, 7}.
The function f(x1, x2, x3) is given by the set of decimal indices of 1-minterms f(1) = {0, 3, 4, 5, 6}. Realize f by an (8 × 1) decoder.
Realize the switching function f = x1x3 + x1x2 + x1x2x3 + x1x2x3 by an (8 × 1) multiplexer.
Realize the switching function f = x1x2x5 + x2x3x5 + x2x3x5 + x2x4x5 + x3x4x5 by a (4 × 1) multiplexer and logic AND and OR circuits.
Compare realizations with BDDs for a few different orders of variables.
rom the BDD for the function f(x1, x2, x3, x4) = x1x2? x1x3 ? x2x3x4, determine the corresponding (2×1) multiplexer network.
Table shows six different codes of the first 10 nonnegative numbers.
Represent the integer-valued function F=[2, 1, 0, 1, 1, 2, 1, 2]T as a two-output binary-valued function f = (f0, f1).
Determine all functions of two variables which belong to the same LP-class as the function x1 ? x2.
Calculate the arithmetic spectrum over this BDD and show the corresponding ACDD.
Realize a network that activates the seven-segment display of first 10 non-negative integers as shown in Figure.
This often used is the binary-reflected Gray code which can be generated by starting from the n-tuple of all bits zero and successively flipping.
How many Fixed-polarity Reed-Muller expressions there are for functions of n = 3 variables?
Calculate the FPRM-expression for the polarity H = (110) for the function given by the truth vector F = [1, 0, 0, 1, 1, 0, 1, 1]T .
Determine the Kronecker expressions for the following a ssignments of the Shannon, positive Davio, and negative Davio expansion rules to the variables.
Determine the fixed polarity arithmetic expressions, and show that the FPRM- repressions can be derived from them by recalculating the coefficients.
Represent the function given by the truth-vector F = [1, 0, 0, 1, 1, 1, 1, 1]T by decision trees on groups C3 2 and C2 × C4.
Draw the Positive and Negative Reed-Muller decision diagrams for the function f in Problem 2.
Determine the Binary decision tree and the Binary decision diagram for the function.
Calculate the values of constant nodes in the Kronecker decision tree with the same assignment of nodes for the function given by the truthvector .
Determine the functional expression for f. by this diagram and write the corresponding functional expression for f.
Represent this function at the Karnaugh map and determine the complete disjunctive and conjunctive forms.
Determine the truth table of a function that has the value 1 if the number of 1 bits is even.
Determine the variances of n1 and n2 and the covariance of n1 and n2.