Skip to main content

Semiconductor Memory

 The basic element of a semiconductor memory is the memory cell.

The cell has three functional terminals capable of carrying an electrical signal. The select terminal, selects a memory cell for a read or write operation. 

The control terminal indicates read or write.

For writing, the other terminal provides an electrical signal that sets the state of the cell to 1 or 0. 

For reading, that terminal is used for output of the cell’s state.

Major types of semiconductor memory

  • Random access memory (RAM)
  • Read only memory (ROM)
  • Programmable ROM (PROM)
  • Erasable PROM (EPROM)
  • Electrically erasable PROM (EEPROM)
  • Flash memory

The most common is referred to as random-access memory (RAM).

RAM is able to read data from the memory and to write new data into the memory easily and rapidly. Both the reading and writing are accomplished through the use of electrical signals.

RAM is volatile. If power is interrupted, then the data are lost.

A dynamic RAM (DRAM) is made with cells that store data as charge on capacitors. The presence or absence of charge in a capacitor is interpreted as a binary 1 or 0.

a static RAM (SRAM) is a digital device where binary values are stored using traditional flip-flop logic-gate configurations.

SRAM stores each bit in a bi-stable memory cell. Each cell is implemented with a six-transistor circuit.

DRAM stores each bit as charge on a capacitor. This capacitor is very small—typically around 30 femtofarads, that is, 30 × 10−15 farads.

SRAM is used for cache memory and DRAM is used for main memory.

SRAM cells use more transistors than DRAM cells, and thus have lower densities, are more expensive, and consume more power.

A read-only memory (ROM) contains a permanent pattern of data that cannot be changed. A ROM is nonvolatile; and no power source is required to maintain the bit values in memory.

A programmable ROM (PROM) is nonvolatile, the writing process is performed electrically and may be performed later than the original chip fabrication.

A read-mostly memory, which is useful for applications in which read operations are far more frequent than write operations.

EPROM, EEPROM, and flash memory are common forms of read mostly memory.

A electrically erasable programmable read-only memory (EEPROM) is a read-mostly memory that can be written into at any time without erasing prior contents; only the byte or bytes addressed are updated.

16Mbits DRAM is organized as four square arrays of 2048 by 2048 elements. The elements of the array are connected by both horizontal (row) and vertical (column) lines. Each horizontal line connects to the Select terminal of each cell in its row; each vertical line connects to the Data-In/Sense terminal of each cell in its column.

Types of DRAMs

  • Fast Page Mode DRAM (FPM DRAM)
  • Extended Data Out DRAM (EDO DRAM)
  • Synchronous DRAM (SDRAM)
  • Double Data Rate Synchronous DRAM (DDR SDRAM)
  • Rambus DRAM (RDRAM)
  • Video RAM (VRAM)

Popular posts from this blog

Gaussian Elimination - Row reduction Algorithm

 Gaussian elimination is a method for solving matrix equations of the form, Ax=b.  This method is also known as the row reduction algorithm. Back  Substitution Solving the last equation for the variable and then work backward into the first equation to solve it.  The fundamental idea is to add multiples of one equation to the others in order to eliminate a variable and to continue this process until only one variable is left. Pivot row The row that is used to perform elimination of a variable from other rows is called the pivot row. Example: Solving a linear equation The augmented matrix for the above equation shall be The equation shall be solved using back substitution. The eliminating the first variable (x1) in the first row (Pivot row) by carrying out the row operation. As the second row become zero, the row will be shifted to bottom by carrying out partial pivoting. Now, the second variable (x2)  shall be eliminated by carrying out the row operation again. ...

Exercise 2 - Amdahl's Law

A programmer has parallelized 99% of a program, but there is no value in increasing the problem size, i.e., the program will always be run with the same problem size regardless of the number of processors or cores used. What is the expected speedup on 20 processors? Solution As per Amdahl's law, the speedup,  N - No of processors = 20 f - % of parallel operation = 99% = 1 / (1 - 0.99) + (0.99 / 20) = 1 / 0.01 + (0.99 / 20) = 16.807 The expected speedup on 20 processors is 16.807

Minor, Cofactor, Determinant, Adjoint & Inverse of a Matrix

Consider a matrix Minor of a Matrix I n the above matrix A, the minor of first element a 11  shall be Cofactor The Cofactor C ij  of an element a ij shall be When the sum of row number and column number is even, then Cofactor shall be positive, and for odd, Cofactor shall be negative. The determinant of an n x n matrix can be defined as the sum of multiplication of the first row element and their respective cofactors. Example, For a 2 x 2 matrix Cofactor C 11 = m 11 = | a 22 | = a 22  = 2 Determinant The determinant of A is  |A| = (3 x 2) - (1 x 1) = 5 Adjoint or Adjucate The Adjoint matrix of A , adjA is the transpose of its cofactor matrix. Inverse Matrix A matrix should be square matrix to have an inverse matrix and also its determinant should not be zero. The multiplication of matrix and its inverse shall be Identity matrix. The square matrix has no inverse is called Singular. Inv A = adjA / |A|           [ adjoint A / determ...