09-02-2016, 03:53 PM
can u plz send me silicon memory ppt and documentation
|
seminar topic silicon memory
|
can u plz send me silicon memory ppt and documentation
10-02-2016, 03:00 PM
seminar topic silicon memory
Abstract
The limits of pushing storage density to the atomic scale are explored with a memory that stores a bit by the presence or absence of one silicon atom. These atoms are positioned at lattice sites along self-assembled tracks with a pitch of five atom rows.
The memory can be initialized and reformatted by controlled deposition of silicon. The writing process involves the transfer of Si atoms to the tip of a scanning tunneling microscope. The constraints on speed and reliability are compared with data storage in magnetic hard disks and DNA.
In 1959 physics icon Richard Feynman estimated that “all of the information that man has carefully accumulated in all the books in the world, can be written in a cube of material one two-hundredth of an inch wide”. Thereby, he uses a cube of 5×5×5 = 125 atoms to store one bit, which is comparable to the 32 atoms that store one bit in DNA. Such a simple, back-of-the-envelope calculation gave a first glimpse into how much room there is for improving the density of stored data when going down to the atomic level.
In the meantime, there has been great progress towards miniaturizing electronic devices all the way down to single molecules or nanotubes as active elements. Memory structures have been devised that consist of crossed arrays of nanowires linked by switchable organic molecules or crossed arrays of carbon nanotubes with electro statically switchable intersections
Introduction
Now, a little more than 40 years after Feynman's prescient estimate, scientists have created an atomic-scale memory using atoms of silicon in place of the 1s and 0s that computers use to store data. The feat represents a first crude step toward a practical atomic-scale memory where atoms would represent the bits of information that make up the words, pictures and codes read by computers.
It is our goal to push the storage density to the atomic limit and to test whether a single atom can be used to store a bit at room temperature. How closely can the bits be packed without interacting? What are the drawbacks of pushing the density to its limit while neglecting speed, reliability and ease of use?
The result is a two-dimensional realization of the device envisaged by Feynman, as shown in figure 1. A bit is encoded by the presence or absence of a Si atom inside a unit cell of 5×4 = 20 atoms. The remaining 19 atoms are required to prevent adjacent bits from interacting with each other, which is verified by measuring the autocorrelation. A specialty of the structure in figure 1 is the array of self-assembled tracks with a pitch of five atom rows that supports the extra atoms. Such regular tracks are reminiscent of a conventional CDROM. However, the scale is shrunk from µm to nm. Although the memory created now is in two dimensions rather than the three-dimensional cube envisioned by Feynman, it provides a storage density a million times greater than a CD-ROM, today's conventional means of storing data
Abstract
The limits of pushing storage density to the atomic scale are explored with a memory that stores a bit by the presence or absence of one silicon atom. These atoms are positioned at lattice sites along self-assembled tracks with a pitch of five atom rows.
The memory can be initialized and reformatted by controlled deposition of silicon. The writing process involves the transfer of Si atoms to the tip of a scanning tunneling microscope. The constraints on speed and reliability are compared with data storage in magnetic hard disks and DNA.
In 1959 physics icon Richard Feynman estimated that “all of the information that man has carefully accumulated in all the books in the world, can be written in a cube of material one two-hundredth of an inch wide”. Thereby, he uses a cube of 5×5×5 = 125 atoms to store one bit, which is comparable to the 32 atoms that store one bit in DNA. Such a simple, back-of-the-envelope calculation gave a first glimpse into how much room there is for improving the density of stored data when going down to the atomic level.
In the meantime, there has been great progress towards miniaturizing electronic devices all the way down to single molecules or nanotubes as active elements. Memory structures have been devised that consist of crossed arrays of nanowires linked by switchable organic molecules or crossed arrays of carbon nanotubes with electro statically switchable intersections
Introduction
Now, a little more than 40 years after Feynman's prescient estimate, scientists have created an atomic-scale memory using atoms of silicon in place of the 1s and 0s that computers use to store data. The feat represents a first crude step toward a practical atomic-scale memory where atoms would represent the bits of information that make up the words, pictures and codes read by computers.
It is our goal to push the storage density to the atomic limit and to test whether a single atom can be used to store a bit at room temperature. How closely can the bits be packed without interacting? What are the drawbacks of pushing the density to its limit while neglecting speed, reliability and ease of use?
The result is a two-dimensional realization of the device envisaged by Feynman, as shown in figure 1. A bit is encoded by the presence or absence of a Si atom inside a unit cell of 5×4 = 20 atoms. The remaining 19 atoms are required to prevent adjacent bits from interacting with each other, which is verified by measuring the autocorrelation. A specialty of the structure in figure 1 is the array of self-assembled tracks with a pitch of five atom rows that supports the extra atoms. Such regular tracks are reminiscent of a conventional CDROM. However, the scale is shrunk from µm to nm. Although the memory created now is in two dimensions rather than the three-dimensional cube envisioned by Feynman, it provides a storage density a million times greater than a CD-ROM, today's conventional means of storing data
|
« Next Oldest | Next Newest »
|
