Question: Consider a function F with 4 bits of input A3, A2, A1, A0 such that the output of F is 1 if the unsigned binary
Consider a function F with 4 bits of input A3, A2, A1, A0 such that the output of F is 1 if the unsigned binary number represented by A3A2A1A0 is prime (i.e. 2, 3, 5, 7, 11, or 13). Otherwise, the output of F is 0.
1-Write the truth table for F.
2-Implement F using only a 16-to-1 MUX.
3-Implement F using an 8-to-1 MUX, and some AND, OR, and NOT gates.
4-Implement F using an 4-to-1 MUX, and some AND, OR, and NOT gates.
5-Using Shannons expansion, implement F using a 2-to-1 MUX, and some AND, OR, and NOT gates.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
