TAMS / Java / Hades / applets: contents | previous | next | ||||
Hades Applets contents visual index introduction std_logic_1164 gatelevel circuits delay models flipflops adders and arithm... counters LFSR and selftest memories ROM circuit 1Kx8 ROM demo RAM structure RAM write-cycle RAM read-cycle RAM write-ha... RAM storage ... RAM address ... RAM bitline ... 74189 SRAM 74219 SRAM 74219 SRAM a... 6116 CMOS SRAM multiple SRAMs programmable logic state-machine editor misc. demos I/O and displays DCF-77 clock relays (switch-le... CMOS circuits (sw... RTLIB logic RTLIB registers Prima processor D*CORE MicroJava Pic16 cosimulation Mips R3000 cosimu... Intel MCS4 (i4004) image processing ... [Sch04] Codeumsetzer [Sch04] Addierer [Sch04] Flipflops [Sch04] Schaltwerke [Sch04] RALU, Min... [Fer05] State-Mac... [Fer05] PIC16F84/... [Fer05] Miscellan... [Fer05] Femtojava FreeTTS | RAM address decoder (2 to 4 bit with enable)
Circuit Description
The address decoder required for the simple 4x4 bit
random access memory circuit.
While nChipSelect is high, all word-lines are disabled.
When nChipSelect is low, the decoder decodes the 2-bit input on the A1,A0
input lines and enables the corresponding word-line.
When the number of memory addresses becomes very large, the addresses are usually split into multiple parts, each of which is decoded separately. For example, a 64 Mbit RAM organized as 2 M words of 32 bits might include 1024 blocks of 512 wordlines of 128 bits. Then, a first 10-to-1024 decoder would enable one of the 1024 blocks, while a second 9-to-512 decoder enables one of the 512 wordlines of the selected block, and a third stage of 2-to-4 decoders selects one 32-bit group out fo the 128-bits of the block. This organization avoids very long bitlines, which are limited to at most a thousand connections due to electrical effects. Naturally, each block requires its own second-level (here 9-to-512) and third-level (here 2-to-4) decoders, unless it is possible to share the second-level decoders between a few blocks. (Note that one 10-to-1024 decoder and 1024 9-to-512 decoders plus 1024 2-to-4 decoders are not more expensive than a single impractical 21-to-2million decoder!). | |||
Print version | Run this demo in the Hades editor (via Java WebStart) | ||||
Usage | FAQ | About | License | Feedback | Tutorial (PDF) | Referenzkarte (PDF, in German) | ||||
Impressum | http://tams.informatik.uni-hamburg.de/applets/hades/webdemos/40-memories/40-ram/ram-decoder24.html |