17-mem - 11/3/09 1 1 ECE2030 Introduction to Computer...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 11/3/09 1 1 ECE2030 Introduction to Computer Engineering Lecture 17: Memory 2 Memory Random Access Memory (RAM) Contrary to Serial Access Memory (e.g. Tape) Static Random Access Memory (SRAM) Data stored so long as Vdd is applied 6-transistors per cell Faster Differential Dynamic Random Access Memory (DRAM) Require periodic refresh Smaller (can be implemented with 1 or 3 transistor) Slower Single-Ended Can be read and written Typically, addressable at byte granularity Read-Only Memory (ROM) 3 Block Diagram of Memory Example: 2MB memory, byte-addressable N = 8 (because of byte-addressability) K = 21 (1 word = 8-bit) 2 k words N-bit per word Memory Unit N-bit Data Input (for Write) N-bit Data Output (for Read) K-bit address lines Read/Write Chip Enable N N K 4 Static Random Access Memory (SRAM) Typically each bit is implemented with 6 transistors (6T SRAM Cell) During read, the bitline and its inverse are precharged to Vdd (1) before set WL=1 During write, put the value on Bitline and its inverse on Bitline_bar before set WL=1 BitLine BitLine Wordline (WL) 11/3/09 2 5 Dynamic Random Access Memory (DRAM)...
View Full Document

This note was uploaded on 11/24/2009 for the course ENGINEERIN 4283 taught by Professor Smith during the Spring '09 term at American InterContinental University Dunwoody.

Page1 / 5

17-mem - 11/3/09 1 1 ECE2030 Introduction to Computer...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online