Realize a new solution for a 2bit maximum value selector tha

Realize a new solution for a 2-bit maximum value selector that uses two 1-bit 16-to-1 multi-plexers(one to implement C1 and one to implement C0). You may use noother discrete logic devices. Simulate your design, and test it.

Solution

Any logic function of n inputs be implemented with a 2^n-1 multiplexer for example for a 2 input logic function call the inputs x and Y and the result r, and let the truth table be:

X Y r

0 0 a

0 1 b

1 0 c

1 1 d

Where a,b,c and each either 0 or 1

Exercise: how many logic gates are used by this implementation ( if the multiplexer is fully expanded in to gates)? How does this compare with the number of gates required to implement a logic function directly.

Any logic function ofb3 inputs can be inverter as follows.

Let the inputs be x, Y, and z. Connect x and Y to the control inputs of the multiplexer for each combination of values of x and Y. One of the following must apply.

1. The out put is 0, regardless of the value of z.

2. The output is 1 regardless of the value of z.

3. The output is equal to z.

For each combination of values of x and Y, the multiplexer input which is selected by that combination is connected to either 0, 1, z or [\'z], depending on which of the above