- 2078 Kartik · 6 marks
ΠM(0,2,6,7) using 4:1 MUX
Short answer
Convert ΠM(0,2,6,7) to minterms: Y = Σm(1,3,4,5). Use A, B as select lines of a 4:1 MUX. Connect data inputs: I0 = C, I1 = C, I2 = 1, I3 = 0. The MUX output yields the function.
Realize a following logic expression using a 4:1 multiplexer and standard logic gates. Y(A,B,C) = ΠM(0,2,6,7)
First convert the maxterm list to minterms. A 3-variable function has minterms 0–7; the ones not listed as maxterms are the minterms:
Implementation table
Use as select lines (, ) and express each data input in terms of . Input covers minterms () and ().
| 0 | 2 | 4 | 6 | |
| 1 | 3 | 5 | 7 | |
| Input | 1 | 0 |
- : only minterm 1 present, so .
- : only minterm 3, so .
- : both 4 and 5, so .
- : neither 6 nor 7, so .
Circuit
+--------+
C -------->| I0 |
C -------->| I1 4:1 |----> Y
1 (Vcc) -->| I2 MUX |
0 (GND) -->| I3 |
+--------+
S1 S0
A B
No extra gate is needed here (no input appears).
Check
The MUX equation gives
| ABC | 000 | 001 | 010 | 011 | 100 | 101 | 110 | 111 |
|---|---|---|---|---|---|---|---|---|
| Y | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 0 |
Y is 0 exactly at 0, 2, 6, 7, which matches .
✓ Answer checked by Claude Opus 5.5 (high effort)
Related questions
- Multiplexer tree; 16:1 MUX from 4:1 · Digital Logic, chapter 4
- Universal gates; positive and negative logic · Digital Logic, chapter 2
- Full adder using a single 4:1 MUX · Digital Logic, chapter 4
- K-map ΠM(0,2,4,6,7,8,10,13,15) and 8:1 MUX · Digital Logic, chapter 3
- Multiplexer tree; 1:16 DEMUX from 1:4 · Digital Logic, chapter 4
- 8:1 MUX operation; 32:1 MUX from 8:1 · Digital Logic, chapter 4
- Multiplexer and 4:1 MUX · Basic Electronics Engineering, chapter 6 · asked 2×
- Short note: Logic gates · Basic Electrical and Electronics Engineering, chapter 3
- K-map: x'yz + x'y'z + xyz with gates · Basic Electronics Engineering, chapter 6 · asked 2×