What is dynamic random access memory, Computer Engineering

Assignment Help:

Q. What is Dynamic Random Access Memory?

RAM technology is divided into 2 technologies: Static and dynamic. A dynamic RAM (DRAM) is made with cells which store data as charge on capacitors. Absence or presence of charge on capacitor is interpreted as binary 1 or 0. Since capacitors have a natural tendency to discharge, dynamic RAM needs periodic charge refreshing to maintain data storage. Term dynamic corresponds to this tendency of stored charge to leak away even with power continuously applied.

Figure below is a typical DRAM structure for an individual cell which stores one bit. The address line is activated when bit value from this cell is to be read or written.  Transistor acts as a switch which is closed (allowing current to flow) if a voltage is applied to address line and open (no current flows) if no voltage is present on address line.

2157_What is Dynamic Random Access Memory.png

For write operation a voltage signal is applied to bit line; a high voltage represents 1 and a low voltage represents 0.  A signal is then applied to address line allowing a charge to be transferred to capacitor. 

For read operation when address line is selected transistor turns on and charge stored on capacitor is fed out onto a bit line and to the sense amplifier. Sense amplifier compares capacitor voltage to a reference value and decides if cell contains logic 1 or logic 0.  The read out from cell discharges the capacitor that should be restored to complete operation. 

Even though the DRAM cell is used to store a single bit (0 or 1) it is necessary an analog device. Capacitor can store any charge value within a range. A threshold value determines whether charge is interpreted as 1 or 0.


Related Discussions:- What is dynamic random access memory

Illustration of a memory organization, Q. Illustration of a memory organiza...

Q. Illustration of a memory organization? Let's consider an illustration of a memory organization as displayed in Figure below in that main memory can store 32K words of 12 b

Explain the types of computer architecture, Explain the types of computer a...

Explain the types of computer architecture Computer architecture can be divided into three main categories: Instruction Set Architecture, or ISA, is the image of a computing

Convert a JK flipflop to T type flipflop, With the help of a suitable diagr...

With the help of a suitable diagram, explain how do you convert a JK flipflop to T type flipflop. Ans. As here flip flop is JK flip flop and it is required to convert JK in T.

Differentiate aggregation and containment, Aggregation is the relationship ...

Aggregation is the relationship among the whole and a part. We can add/subtract some properties in the part (slave) side. It won't affect the entire part. Best example is Car,

Data structure, explain different type of sparse matrix

explain different type of sparse matrix

Difference between finite automata and turing machine, What are the differe...

What are the difference between finite automata and Turing Machines?  Turing machine can alter symbols on its tape, while the FA cannot change symbols on tape.  Also  TM  has  a

Explain the wap stack in brief, Discuss the WAP stack in brief. The pro...

Discuss the WAP stack in brief. The protocol stacks part implemented by WAP Stack for the WAP development and research platform. The protocol stack will be exploited into many

Compact disk read only memory, Q. What is Compact Disk Read Only Memory? ...

Q. What is Compact Disk Read Only Memory? This technology has evolved out of entertainment electronics market where cassette tapes and long playing records are being replaced b

Implement a memory management system , There should be 1 server thread and ...

There should be 1 server thread and N client threads, where N is supplied by the user as a command line argument. The server opens a file called "all_requests.dat", the file has

Define deadlock with resource request and allocation graph, Define Deadlock...

Define Deadlock with Resource request and allocation graph (RRAG) Deadlocks can be described through a directed bipartite graph termed as a RRAG that is Resource Request All

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd