Embodiments of the present invention relate generally to semiconductor memory and specifically, in one or more of the illustrated embodiments, to semiconductor memory having a data path for storing more than one binary digit of digital information per memory cell.
Each memory cell of a semiconductor memory system, such as a memory device, has traditionally been used to store one binary digit (“bit”) of digital information. In order to store large amounts of digital information large arrays of memory cells are used. One challenge that is presented by the traditional approach of one bit per cell is to continually shrink the size of the memory array in order to increase the capacity of the memory without dramatically increasing the overall size of the memory system. Example approaches to reduce the size of the array have been to design memory cells that occupy less area and reducing the distance between the memory cells in order to increase memory cell density and capacity. As the feature size of the memory cells becomes smaller, however, the complexity of fabricating the memory increases resulting in increased cost of manufacturing.
A relatively recent approach to increasing memory capacity has been to design memory cells and supporting circuitry for storing multiple bits of digital information in each memory cell. For example, rather than store one bit of digital information, as has been the tradition, two bits of digital information are stored by a memory cell. Storage of two bits of digital information is accomplished by having memory cells and read/write circuitry that can accurately store, read, and write four distinct memory states. Each of the four memory states represents a different combination of two bits of information, that is, 00, 01, 10, and 11. In contrast, the traditional one bit per cell approach requires memory cells and read/write circuitry that can accurately store, read, and write two distinct memory states, each distinct memory state representing either a 0 or 1. Use of memory cells for storing more than two memory states may be applicable for different types of memory, for example, in both volatile (e.g., DRAM) and non-volatile memory (e.g., flash memory).
Projecting forward along the current trajectory of using memory cells for storing more than two memory states, starting with using two different memory states for storing one bit of digital information and evolving to using four different memory states for storing two bits of digital information, three bits of digital information may be stored by using eight different memory states and four bits of digital information may be stored by using sixteen different memory states. As illustrated by this example, the number of memory states per memory cell is a power-of-two, and the resulting number of bits stored per cell is the base two logarithm of the number of memory states.
A challenge with designing memory systems along this trajectory is the difficulty of reliably and accurately storing, reading, and writing, for example, twice as many memory states as the previous iteration. Evolving from storing, reading and writing two memory states to storing, reading and writing four memory states presented difficulties that were eventually overcome. Evolving from using four memory states to using eight memory states, however, presents challenges that are much more difficult with the current state of technology than those presented in the previous evolution of two memory states to four memory states. Although the difficulties are not insurmountable and will eventually be overcome, it is desirable to have, for example, memory systems utilizing memory cells for storing multiple memory states to provide a storage density of greater than one bit per cell without being limited to storing a power-of-two number of memory states.
Certain details are set forth below to provide a sufficient understanding of embodiments of the invention. However, it will be clear to one skilled in the art that embodiments of the invention may be practiced without these particular details. Moreover, the particular embodiments of the present invention described herein are provided by way of example and should not be used to limit the scope of the invention to these particular embodiments. In other instances, well-known circuits, control signals, timing protocols, and software operations have not been shown in detail in order to avoid unnecessarily obscuring the invention.
In operation, the bit mapping and data conversion circuit 130 can be configured to convert binary user data to IBD, and vice versa. The IBD is intermediate binary data that can be stored as a memory cell state in a memory cell of the memory array 120. As previously mentioned, the bit mapping and data conversion circuit 130 can be used to enable binary user data to be stored using groups of multi-level memory cells capable of storing non-power-of-two memory states to effectively store a non-integer number of bits-per-cell. The storage of binary user data using groups of memory cells having non-power-of-two states to provide a non-integer number of bits-per-cell is transparent to a user, who can write and read binary data in conventional byte and word lengths.
Examples of different configurations of the bit mapping and data conversion circuit 130 are shown in table 250 of
For example, where the 8-bit binary user data is 01011101 (B7:B0) and is to be written to memory, the user data is split into first 5-bit binary data, with the remaining 3-bits to be part of another 5-bit binary data. In the particular example, the first 5-bit binary data (B4:B0) is 11101 and the remaining 3-bits 010 (B7:B5) will be joined with five other bits from other 8-bit binary user data. Turning to the 5-bit binary data 11101 (B4:B0) and table 310, the binary data corresponds to a combination of memory cell states L0 and L2 stored by a pair of multilevel memory cells Cell0 and Cell1, respectively. As will be described in more detail below, in determining the memory state to be stored by the respective memory cell, the 5-bit binary data is converted into two 3-bit IBDs, which are each in turn stored as a corresponding memory state in a respective memory cell according to table 320.
In reading data from memory, a pair of cells are accessed and the respective memory states are conventionally sensed for memory cells having six memory states to provide corresponding 3-bit IBDs for each memory cell. For example, reading memory cell states L0 and L2 stored by memory cells Cell0 and Cell1, respectively, the two memory cells are accessed and memory states L0 and L2 result in two 3-bit IBDs of 111 and 101. The 3-bit IBDs are converted back into 5-bit binary data. According to table 310, the resulting 5-bit data is 11101, which is the original 5-bit binary data from the previous example of writing data to memory. The 5-bit binary data is then concatenated to other 5-bit binary data read from the memory and split into the original 8-bit binary user data.
For example, where the 8-bit binary user data is 01011101 (B7:B0) and is to be written to memory, the user data is split into first and second 3-bit binary data (B2:B0) and (B5:B3), with the remaining 2-bits (B7:B6) to be part of another 3-bit binary data. In the particular example, the first 3-bit binary data is 101, the second 3-bit binary data is 011, and the remaining 2-bits 01 will be joined with one other bit from other 8-bit binary user data. Turning to the two 3-bit binary data 101 and 011, and table 330, the first binary data 101 corresponds to a combination of memory cell states L1 and L0 stored by a first pair of multilevel memory cells Cell0 and Cell1, respectively. The second binary data 011 corresponds to a combination of memory cell states L1 and L2 stored by a second pair of multilevel memory cells Cell0 and Cell1, respectively. As will be described in more detail below, in determining the memory state to be stored by the respective memory cell, the 3-bit binary data is converted into two 2-bit IBDs, which are each in turn stored as a corresponding memory state in a respective memory cell.
In reading data from memory, a pair of cells are accessed and the respective memory states are conventionally sensed for memory cells having three memory states to provide corresponding 2-bit IBDs for each memory cell. For example, taking memory cell states L1 and L0 stored by the first pair of memory cells Cell0 and Cell1, respectively, the two memory cells are accessed and memory states L1 and L0 result in two IBDs of 10 and 11. Memory cell states L1 and L2 stored by a second pair of multilevel memory cells Cell0 and Cell1, respectively, the two memory cells are accessed and memory states L1 and L2 result in two IBDs of 10 and 01. The 2-bit IBDs are converted back into 3-bit binary data. In the present example, the resulting 3-bit binary data for the first pair of memory cells is 101 and the resulting 3-bit binary data for the second pair of memory cells is 011, in accordance with table 330, which are the original 3-bit data from the previous example of writing data to memory. The 3-bit binary data is then concatenated to other 3-bit binary data read from the memory and split into the original 8-bit binary user data.
In operation, 8-bit user data loaded in the latch 110 is sequentially provided to the bit mapping circuit 210 to have the bits of the user data mapped to corresponding locations of the register 220. In the embodiment shown in
For example, using the previously described example with reference to
After the page buffer 134 is loaded with the IBDs, sense amplifiers 138 convert the respective 3-bit IBD into a corresponding memory state to be stored in a respective multi-level memory cell. Sense amplifiers for converting the IBDs into a corresponding memory state is known in the art, and sense amplifiers of conventional design can be used for the sense amplifiers 138. In the present example, the 3-bit IBD 111 corresponds to memory state L0 (with reference to table 320 of
When reading data from the multi-level memory cells, the process of writing data to the multi-level memory cells is generally reversed. That is, the memory states stored by multi-level memory cells are sensed by sense amplifiers 138 and converted into 3-bit IBDs that are stored in respective locations in the page buffer 134. The IBDs from pairs of memory cells are coupled to the respective data converter subcircuit, for example, IBDs stored by locations 134A, 134B are coupled through the data bus 136, multiplexers 240 and bus 234 to the data converter subcircuit 230A. The two 3-bit IBDs are converted by the data converters 230 into corresponding 5-bit binary data that is stored in appropriate bit locations in register 220. The bit mapping circuit 210 maps the 5-bit binary data into 8-bit data to reconstruct the original 8-bit binary user data.
In operation, 8-bit binary user data loaded in the latch 110 is sequentially provided to the bit mapping circuit 210 to have the bits of the user data mapped to corresponding locations of the register 220. In the embodiment shown in
For example, using the previously described example with reference to
When reading data from the multi-level memory cells, the memory states stored by multi-level memory cells are sensed by sense amplifiers 138 and converted into 2-bit IBDs that are stored in respective locations in the page buffer 134. The IBDs from pairs of memory cells are coupled to the respective data converter subcircuit, for example, IBDs stored by locations 134A, 134B and IBDs stored by locations 134C, 134D are coupled through the data bus 136, multiplexers 240 and bus 234 to the data converter subcircuit 230A and 230B, respectively. The pairs of 2-bit IBDs are converted into corresponding 3-bit binary data, which are stored in appropriate bit locations in register 220. The bit mapping circuit 210 maps the 3-bit binary data into 8-bit data to reconstruct the original 8-bit user data.
A truth table for the mapping of binary user data and conversion to IBDs, and then to corresponding memory states for the four memory state, two memory cell example of
One or more Embodiments of the present invention can also have a bit mapping and data conversion circuit 130 configurable for use with different combinations of memory states to provide different bit/cell storage densities. In one embodiment, configuration of such a bit mapping and data conversion circuit can be reconfigured by user. For example, with reference to
The specific embodiments previously described have been provided by way of example, and is not intended to limit the scope of the present invention. Modifications can be made to the previous embodiment and remain within the scope of the present invention. For example, in other embodiments of the invention, the bit mapping and data conversion circuit 130 can include registers having greater or lesser bit capacity that than described with reference to
Most command signals, the address signals and the write data signals are applied to the memory system 400 as sets of sequential input/output (“I/O”) signals transmitted through an I/O bus 434. The I/O bus 134 illustrated in
In response to the memory commands decoded by the control logic unit 450, the memory cells in the array 430 are erased, programmed, or read. The memory array 430 is programmed on a row-by-row or page-by-page basis. After the row address signals have been applied to the address bus 444, the I/O control unit 440 routes write data through the bit mapping and data conversion circuit 130 to a cache register 470. The intermediate binary data are stored in the cache register 470 in preparation for programming. The cache register 470 sequentially stores the sets of intermediate binary data for an entire row or page of memory cells in the array 430. A page buffer (not shown), as previously described, may be included in or represented by the cache register 470 illustrated in
From the foregoing it will be appreciated that, although specific embodiments of the invention have been described herein for purposes of illustration, various modifications may be made without deviating from the spirit and scope of the invention. Accordingly, the invention is not limited except as by the appended claims.
This application is a continuation of U.S. patent application Ser. No. 12/956,977, filed on Nov. 30, 2010, which is a continuation of U.S. patent application Ser. No. 12/261,928, filed on Oct. 30, 2008, U.S. Pat. No. 7,852,671. These applications are incorporated herein by reference, in their entirety, for any purpose.
Number | Name | Date | Kind |
---|---|---|---|
5473577 | Miyake et al. | Dec 1995 | A |
5737265 | Atwood et al. | Apr 1998 | A |
5771248 | Katayama et al. | Jun 1998 | A |
6483742 | Sweha et al. | Nov 2002 | B1 |
6512525 | Capps et al. | Jan 2003 | B1 |
6532556 | Wong et al. | Mar 2003 | B1 |
6556465 | Haeberli et al. | Apr 2003 | B2 |
7221592 | Nazarian | May 2007 | B2 |
7278723 | Silverbrook | Oct 2007 | B2 |
7639529 | Park et al. | Dec 2009 | B2 |
7843725 | Sarin et al. | Nov 2010 | B2 |
7848142 | Radke | Dec 2010 | B2 |
7852671 | Bauer | Dec 2010 | B2 |
7872912 | Sarin et al. | Jan 2011 | B2 |
8111550 | Sarin et al. | Feb 2012 | B2 |
20020136055 | Jyouno et al. | Sep 2002 | A1 |
20030081693 | Raghavan et al. | May 2003 | A1 |
20050219077 | Zhang | Oct 2005 | A1 |
20050273549 | Roohparvar | Dec 2005 | A1 |
20060004952 | Lasser | Jan 2006 | A1 |
20060023539 | Nakai et al. | Feb 2006 | A1 |
20060233026 | Li | Oct 2006 | A1 |
20060268619 | Chen | Nov 2006 | A1 |
20060285392 | Incarnati et al. | Dec 2006 | A1 |
20070064464 | Kuo et al. | Mar 2007 | A1 |
20070171714 | Wu et al. | Jul 2007 | A1 |
20070195597 | Park et al. | Aug 2007 | A1 |
20080062760 | Kim | Mar 2008 | A1 |
20100110788 | Bauer | May 2010 | A1 |
Number | Date | Country |
---|---|---|
1 298 670 | Apr 2003 | EP |
05-174584 | Jul 1993 | JP |
07-066304 | Mar 1995 | JP |
07-093979 | Apr 1995 | JP |
07-307094 | Nov 1995 | JP |
09-198882 | Jul 1997 | JP |
11-250683 | Sep 1999 | JP |
2000-215697 | Aug 2000 | JP |
2001-028192 | Jan 2001 | JP |
2001-210085 | Aug 2001 | JP |
2004-265596 | Sep 2004 | JP |
2003-323794 | Nov 2004 | JP |
2006-221807 | Aug 2006 | JP |
2007-042265 | Feb 2007 | JP |
2007-184066 | Jul 2007 | JP |
2007-207415 | Aug 2007 | JP |
2008-097663 | Apr 2008 | JP |
Entry |
---|
Extended European Search Report dated Apr. 12, 2012 for European Patent Application No. 09840565.7, 1-7. |
International Search Report and Written Opinion dated Apr. 21, 2010 for International Application No. PCT/US2009/058053. |
Korean office action dated Sep. 20, 2012 for Korean application No. 10-2011-7009985. |
Office Action received for Japanese Appln No. 2011-534568 dated Feb. 5, 2013. |
KR Office Action for application No. 10-2011-7009985 dated Mar. 27, 2013. |
Number | Date | Country | |
---|---|---|---|
20120182799 A1 | Jul 2012 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12956977 | Nov 2010 | US |
Child | 13431837 | US | |
Parent | 12261928 | Oct 2008 | US |
Child | 12956977 | US |