0
1.3kviews
Implement the Boolean function using 8:1 multiplexer
written 5.5 years ago by | modified 4.6 years ago by |
$$F(A,B,C,D) = \bar A B\bar D+ACD+ \bar BCD+ \bar A \bar C D$$
ADD COMMENT
EDIT
1 Answer
written 5.5 years ago by | modified 4.6 years ago by |
$$F(A,B,C,D) = \bar A B\bar D+ACD+ \bar BCD+ \bar A \bar C D$$
written 5.5 years ago by | • modified 5.5 years ago |
Write 0 for complements e.g $\bar A B \bar D = 010$ and find all the possibilities for the remaining term.e.g $\bar A B \bar C \bar D = 0100$ or $\bar A B C \bar D = 0110$
Therefore, $F(A,B,C,D)= \sum m (1,3,4,5,6,11,15)$
Design Table -
Inputs | $\bar B \bar C \bar D$ | $\bar B \bar C D$ | $\bar B C \bar D$ | $\bar B C D$ | $ B \bar C \bar D$ | $ B \bar C D$ | $ B C \bar D$ | $ B C D$ |
---|---|---|---|---|---|---|---|---|
$\bar A$ | 0 | $\underline 1$ | 2 | $\underline 3$ | $\underline 4$ | $\underline 5$ | $\underline 6$ | 7 |
A | 8 | 9 | 10 | $\underline {11}$ | 12 | 13 | 14 | $\underline {15}$ |
Input to MUX | 0 | $\bar A$ | 0 | 1 | $\bar A$ | $\bar A$ | $\bar A$ | A |