(Regular Logic Implementation Methods) A logic network has four inputs (Input0, Input1, Input2, Input3) and two outputs (Output0, Output1). At least one of the inputs always is asserted high. If a given input line has a logic 1 applied to it, the output signals will encode its index in binary. For example, if Input2 is asserted, the output reads Output1 = 1, Output0 = 0. If two or more inputs are at logic 1, the output will be set according to which input has the highest index (Input3 > Input2 > Input1 > Input0).
(a) Fill in the truth table for this function.
(b) Fill in K-maps for Output1 and Output0, and find the Boolean expression for the minimum sum of products implementation.
(c) Show how you would implement this function using a PLA that is as small as possible.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.