- 2076 Asoj · 3 marks
1×16 DMUX using 1×4 DMUX
Short answer
Use five 1×4 demuxes in a tree. The first demux uses select bits S3S2 to route data D to one of four second-level demuxes, which use S1S0 to select the final output from Y0–Y15. No extra gates needed.
Realize the logic circuit of 1×16 DMUX using 1×4 DMUX and gates if necessary.
A 1×16 DMUX needs 4 select lines . It is built as a demultiplexer tree from five 1×4 DMUXes; no extra gates are needed.
- Stage 1: one 1×4 DMUX receives the data and uses the MSBs to send it to one of four second-stage DMUXes.
- Stage 2: four 1×4 DMUXes use and produce –.
S1 S0
+------+-- Y0..Y3
S3 S2 +->| DM1 |
+------+ | +------+
D -->| DM0 0|---+ +------+-- Y4..Y7
| 1|----->| DM2 |
| 2|---+ +------+
| 3|-+ | +------+-- Y8..Y11
+------+ | +->| DM3 |
| +------+
| +------+-- Y12..Y15
+--->| DM4 |
+------+
| Active stage-2 DMUX | Outputs reached by | |
|---|---|---|
| 00 | DM1 | – |
| 01 | DM2 | – |
| 10 | DM3 | – |
| 11 | DM4 | – |
Example: → DM0 picks DM4, DM4 picks its output 2, so appears at .
✓ Answer checked by Claude Opus 5.5 (high effort)
Related questions
- Universal gates; positive and negative logic · Digital Logic, chapter 2
- K-map Σ(0,1,4,8,10,11,12)+d, realize circuit · Digital Logic, chapter 3 · asked 2×
- Define combinational logic circuit · Digital Logic, chapter 3
- K-map Σ(0,2,3,4,7,8,10,13)+d, logic circuit · Digital Logic, chapter 3
- Seven-segment "a" segment using NOR gates · Digital Logic, chapter 4
- Positive/negative logic; XNOR using NAND · Digital Logic, chapter 2 · 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×
- Is reservoir necessary: village of 800, spring 0.5 L/s · Water Supply Engineering, chapter 7
- Is treatment necessary? Industry near river · Sanitary Engineering, chapter 6