Difficulty: Medium
Correct Answer: 4
Explanation:
Introduction / Context:Large decoders are commonly constructed from smaller standard decoder ICs. Understanding how to hierarchically combine decoders helps with resource estimation and practical PCB design. A 1-of-32 decoder asserts exactly one of 32 outputs for a 5-bit input address.
Given Data / Assumptions:
Concept / Approach:Partition the 5-bit address into a 2-bit high field and a 3-bit low field. Use a 2-to-4 predecoder (implemented with gates or other logic not counted here) to generate four enables. Feed each enable to one 3-to-8 decoder that handles the lower 3 address bits. Only the enabled decoder will assert one of its eight outputs, yielding a total of 4 * 8 = 32 distinct lines.
Step-by-Step Solution:
Split address: A[4:3] as high field (2 bits), A[2:0] as low field (3 bits).Generate four enables E0..E3 from A[4:3] using a small 2-to-4 decode (glue logic).Instantiate four 3-to-8 decoders; tie each decoder's inputs to A[2:0] and its enable to one of E0..E3.Exactly one decoder is active at a time; within the active decoder, exactly one of eight outputs asserts → overall 32-way one-hot output.Verification / Alternative check:Count outputs: 4 decoders * 8 outputs/decoder = 32 outputs, matching specification. Timing-wise, this yields a two-level decode (predecode + 3-to-8) typical in memory address decoding.
Why Other Options Are Wrong:
Common Pitfalls:Assuming an extra 3-to-8 is required to realize the 2-to-4 predecode. While some designs may count that as a fifth decoder, the question explicitly allows small predecode outside the count, leaving four 3-to-8 decoders sufficient.
Final Answer:4
Discussion & Comments