Address multiplexing (DRAM context): Evaluate the statement: “Address multiplexing is used to reduce the number of address lines.”

Difficulty: Easy

Correct Answer: Correct

Explanation:


Introduction / Context:
As memory densities grew, packaging a separate pin for every address bit became impractical. DRAM solved this by multiplexing row and column addresses over the same physical pins, dramatically cutting package pin counts and cost. This question checks whether the learner recognizes the purpose of address multiplexing.


Given Data / Assumptions:

  • We consider classic asynchronous DRAMs using RAS and CAS strobes.
  • Row address and column address share the A0..An pins at different times.
  • Goal: minimize package pins while still addressing large arrays.


Concept / Approach:
With N multiplexed pins, you can send R row bits and C column bits using the same pins: total addressability is 2^(R+C) while only max(R,C) pins are needed, not R+C pins. RAS latches the row; CAS latches the column. This halves the address pin count for square arrays and reduces it substantially for rectangular organizations, enabling high-density memories in economical packages.


Step-by-Step Solution:

Present row address on A0..An; assert RAS to latch it.Present column address on the same pins; assert CAS to latch it.Access proceeds using the combined row/column to select one cell or a page (for page-mode).


Verification / Alternative check:
Compare pin counts: a 4M x 1 DRAM might use 11 address pins multiplexed (row 11 + column 11 → 22 effective bits) rather than 22 separate lines, confirming the reduction.


Why Other Options Are Wrong:

Incorrect/only SRAM/parity/ROMs only: DRAMs are the canonical example; SRAMs typically use non-multiplexed addresses; parity is unrelated.


Common Pitfalls:
Assuming multiplexing is a timing optimization only; its primary benefit is pin reduction, with timing trade-offs handled by RAS/CAS cycles.


Final Answer:
Correct

More Questions from Memory and Storage

Discussion & Comments

No comments yet. Be the first to comment!
Join Discussion