Truth Table:
A | B | C | F |
0 | 0 | 0 | 1 |
0 | 0 | 1 | 0 |
0 | 1 | 0 | 1 |
0 | 1 | 1 | 0 |
1 | 0 | 0 | 1 |
1 | 0 | 1 | 1 |
1 | 1 | 0 | 0 |
1 | 1 | 1 | 1 |
Here, input variable, n =3
So, selection variable, s=n-1=3-1=2
Here output variable is one so, we need one 2s×1 or 22×1 or 4×1 size multiplexer
Let us assume, B and C as selection variable. Now put A into the implementation table:
Implementation Table for output F:
I0 | I1 | I2 | I3 | |
A/ | 0 | 1 | 2 | 3 |
A | 4 | 5 | 6 | 7 |
1 | A | A/ | A |
Circuit Diagram:
Thanks for every other informative blog. Where else may I get that kind of info written in such a perfect approach? I’ve a project that I’m simply now running on, and I have been on the glance out for such information.
Hello. splendid job. I did not expect this. This is a remarkable story. Thanks!
I believe this website contains some really superb info for everyone :D. “Anybody who watches three games of football in a row should be declared brain dead.” by Erma Bombeck.
Hi! Would you mind if I share your blog with my myspace group? There’s a lot of folks that I think would really enjoy your content. Please let me know. Thanks