A DRAM with an address space divided into blocks, in which storage cells of individual blocks can be activated by a row address signal (RAS) furnished by a controller. Each individual block can then be activated by an independent activation signal derived from the row address signal. The activation signals for different blocks are supplied to the different blocks in succession with a partial time overlap, so that the obtained data rate is increased relative to activation of only one block, owing to partial time activation of at least two different blocks.
|
1. A dynamic random-access memory (DRAM) having an address space divided into blocks, comprising:
memory blocks having storage cells; a controller furnishing a row address signal (RAS) having pulses; said memory blocks activated by activation signals having respective beginnings and ends, said activation signals being derived from said row address signal and each of said memory blocks having an independent activation signal; and said activation signals for different memory blocks supplied in succession to said different memory blocks in a partial time overlap obtained by deriving the respective beginnings and ends of said activation signals from the pulses of said row address signal, so that an obtained data rate is increased as a result of partial simultaneous activation of at least two of said different memory blocks relative to an activation of only one memory block.
5. A dynamic random-access memory (DRAM) having an address space divided into blocks, comprising:
memory blocks having storage cells; a controller furnishing a row address signal (RAS) having pulses; said memory blocks activated by activation signals each having a respective beginning and duration, said activation signals being derived from said row address signal and each of said memory blocks having an independent activation signal; said activation signals for different memory blocks supplied in succession to said different memory blocks in a partial time overlap obtained by deriving the respective beginning of said activation signals from the pulses of said row address signal, so that an obtained data rate is increased as a result of partial simultaneous activation of at least two of said different memory blocks relative to an activation of only one memory block; and an internal timer determining the respective duration of said activation signals.
2. The DRAM according to
3. The DRAM according to
4. The DRAM according to
|
This is a continuation of copending International Application PCT/DE97/02233, filed Sep. 29, 1997, which designated the United States.
1. Field of the Invention
The invention concerns a dynamic random-access memory (DRAM) with an address space divided into blocks, in which memory cells of individual blocks can be activated by a row address signal (RAS) delivered by a controller.
The address space of DRAMs are known to be divided into several blocks that are disposed physically in a row next to each other and logically in two rows next to each other. Viewed logically, two superimposed blocks of the two rows then form a single block. However, the access time for accessing data in the memory blocks is time consuming.
2. Summary of the Invention
It is accordingly an object of the invention to provide a DRAM that overcomes the above-mentioned disadvantages of the prior art devices of this general type, having a particularly short cycle time and thus permitting even more rapid data access.
With the foregoing and other objects in view there is provided, in accordance with the invention, a dynamic random-access memory (DRAM) having an address space divided into blocks, including: memory blocks having storage cells; a controller furnishing a row addressing signal (RAS); the memory blocks activated by activation signals derived from the row address signal and each of the memory blocks having an independent activation signal; and the activation signals for different memory blocks supplied in succession to the different memory blocks in a partial time overlap, so that an obtained data rate is increased as a result of partial simultaneous activation of at least two of the different memory blocks relative to an activation of only one memory block.
The task is solved in a DRAM according to the invention of the type mentioned at the outset, in that each individual block can be activated by an independent activation signal derived from the RAS signal. The activation signals for different blocks are supplied in succession in partial time overlap to the different blocks, so that the obtained data rate, as a result of partially simultaneous activation of at least two different blocks, is increased relative to the activation of only one block.
In the DRAM according to the invention, which, as further explained below, has a cycle time of about 60 ns and therefore is also referred to as a fast RAS cycle (FRC) DRAM one or more of the unactivated blocks can be activated before the activity of at least one previously selected block is completed. The cycle time of the RAS signal can thus be significantly shortened and reduced to about half. The shortening of cycle time is achieved, in particular, by a shorter precharging time in the RAS cycle.
If the ordinary longer precharging time is considered again, one can convert without difficulty from a normal mode of the existing DRAM to the FRC mode of the DRAM according to the invention. A "jump" between the normal mode and the FRC mode is therefore possible without a time loss.
Whereas, as explained above, an address restriction to 0.05% of the total address space is present in the FPM operation, the restriction is significantly lower in the FRC DRAM according to the invention: successive X addresses in the FRC DRAM according to the invention may not lie in the same storage block. Therefore, in a 4 M DRAM, after an X address that lies, say, in block 0, blocks 1 to 3 are available (compare FIG. 1), which means that 75% of the address space is freely available. In a 16 M DRAM this percentage of freely available addresses is even greater.
In the DRAM according to the invention the activation signals for the individual blocks are generated independently of each other. This can occur, for example, by deriving the beginning and end of an activation signal from the RAS signal. However, it is also possible to derive only the beginning of the activation signal from the RAS signal and then adjust the end of the activation signal by an internal timer. The restore timing is generated in the individual storage blocks, i.e., for these blocks individually, and not centrally, as previously done.
The same applies to the drive voltage and the decoder voltage of the word lines.
When a DRAM according to the invention has 4 independent blocks, i.e., a 4 M DRAM is present, a lower value X address can be used for block selection. The probability that two consecutive addresses lie in the same block can then be substantially reduced. Under practical conditions, a large number of addresses are accessed sequentially anyway, so that the addresses of the same block can scarcely occur in succession.
When the controller uses two different timings, which operate depending on the distance from the last access address, it is possible without difficulty for access to the same block to occur not in succession. The same can also be achieved by corresponding storage of an additional bit.
The DRAM according to the invention permits a cycle time gain in 4 blocks of about 55% of the cycle time of a normal DRAM during sequential access, 67% of the cycle time of a normal DRAM during statistical access and about 60% of the cycle time of a normal DRAM during practical use.
Since the activation signals in the DRAM according to the invention are derived from the RAS signal, a CAS-before-RAS mode is not possible.
Other features which are considered as characteristic for the invention are set forth in the appended claims.
Although the invention is illustrated and described herein as embodied in a DRAM, it is nevertheless not intended to be limited to the details shown, since various modifications and structural changes may be made therein without departing from the spirit of the invention and within the scope and range of equivalents of the claims.
The construction and method of operation of the invention, however, together with additional objects and advantages thereof will be best understood from the following description of specific embodiments when read in connection with the accompanying drawings.
In all the figures of the drawing, sub-features and integral parts that correspond to one another bear the same reference symbol in each case. Referring now to the figures of the drawing in detail and first, particularly, to
In this type of DRAM a row address signal (RAS) cycle consists of addressing the individual lines, evaluation of the internal data of the corresponding storage cells and lasts till the "equalization" of a bit line. The RAS cycle is only ended when the cycle of the corresponding activated block is completed.
This is shown in detail in
Shortening of the cycle time Tcycle is desirable as this allows a more rapid readout of the DRAM. For example, a fast page mode (FPM) operation permits more rapid access. FPM operation, however, is restricted to one page, namely, columns of a logic block (compare the dashed arrow in FIG. 1), and therefore is only 0.05% of the total address space in a 4 M DRAM, namely, 2 kbit of the 4 Mbit.
It should be noted that
As is shown in
In the example of
Block-wise activation with independent block activation signals that are generated from the RAS from the controller in the DRAM is therefore essential to the invention. Because of this, a subsequent block can be activated before the present block is deactivated.
Whereas two activation signals overlap each other in the practical example of
Patent | Priority | Assignee | Title |
8229995, | May 26 2008 | Fujitsu Limited | Data transfer processing apparatus, data transfer processing method, and computer product |
Patent | Priority | Assignee | Title |
5097450, | Feb 28 1985 | Kabushiki Kaisha Toshiba | Semiconductor memory device having a plurality of memory blocks |
5511030, | Aug 31 1993 | OKI SEMICONDUCTOR CO , LTD | Semiconductor memory device and method of driving same |
5528552, | Aug 18 1993 | PS4 LUXCO S A R L | Dynamic random access memory device with sense amplifiers serving as cache memory independent of row address buffer unit for high-speed sequential access |
5657285, | Jul 14 1995 | Intellectual Ventures II LLC | Pipelined address memories, and systems and methods using the same |
5666322, | Sep 21 1995 | NEC Electronics, Inc. | Phase-locked loop timing controller in an integrated circuit memory |
5699300, | May 26 1989 | Divided wordline memory arrangement having overlapping activation of wordlines during continuous access cycle | |
5991230, | Mar 19 1997 | Kabushiki Kaisha Toshiba | Synchronous random access memory |
EP165612, | |||
JP467389, |
Executed on | Assignor | Assignee | Conveyance | Frame | Reel | Doc |
Mar 31 1999 | Siemens Aktiengesellschaft | Infineon Technologies AG | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 024120 | /0505 | |
Jan 08 2001 | Infineon Technologies AG | (assignment on the face of the patent) | / | |||
Apr 25 2006 | Infineon Technologies AG | Qimonda AG | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 023963 | /0502 | |
Oct 09 2014 | Qimonda AG | Infineon Technologies AG | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 035623 | /0001 | |
Jul 08 2015 | Infineon Technologies AG | Polaris Innovations Limited | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 036201 | /0432 |
Date | Maintenance Fee Events |
Jan 05 2004 | M1551: Payment of Maintenance Fee, 4th Year, Large Entity. |
Jun 17 2004 | ASPN: Payor Number Assigned. |
Jan 17 2008 | M1552: Payment of Maintenance Fee, 8th Year, Large Entity. |
Jan 20 2012 | M1553: Payment of Maintenance Fee, 12th Year, Large Entity. |
Date | Maintenance Schedule |
Dec 10 2005 | 4 years fee payment window open |
Jun 10 2006 | 6 months grace period start (w surcharge) |
Dec 10 2006 | patent expiry (for year 4) |
Dec 10 2008 | 2 years to revive unintentionally abandoned end. (for year 4) |
Dec 10 2009 | 8 years fee payment window open |
Jun 10 2010 | 6 months grace period start (w surcharge) |
Dec 10 2010 | patent expiry (for year 8) |
Dec 10 2012 | 2 years to revive unintentionally abandoned end. (for year 8) |
Dec 10 2013 | 12 years fee payment window open |
Jun 10 2014 | 6 months grace period start (w surcharge) |
Dec 10 2014 | patent expiry (for year 12) |
Dec 10 2016 | 2 years to revive unintentionally abandoned end. (for year 12) |