Embodiments of the present invention relate generally to systems and methods involving multi-level non-volatile memory, and particularly to allocating and/or using a spare block pool in such a memory device.
Flash memory devices, which include arrays of Flash memory cells, are used in many applications for storing digital information. Flash memory is frequently used in portable electronic devices, digital cameras, personal computers, memory cards, and other types of devices. Due to the nature of these devices, the endurance, speed, and longevity of the Flash memory are important.
Flash memory devices may store data in arrays of Flash memory cells, including single-level and/or multi-level cells. A single level cell (SLC) flash memory stores one bit of information per cell, typically by programming and reading a binary charge (e.g., high or low charge). In contrast, multi-level cells (MLC) store multiple bits of information in each cell by programming and reading a level of charge in the cell. Multi-level cells may include cells that store two bits (MLCx2), three bits (MLCx3), N bits (MLCxN), etc. Flash memory cells are organized into blocks within the array, and the blocks may be arranged by block type into flash memory arrays, or populations of block types.
The majority of blocks in a Flash memory device are usable blocks, or good blocks. However, inevitably, every Flash device includes non-functional blocks, commonly referred to as bad blocks, which may be incapable of being erased or rewritten with new information for any number of reasons. Typically, a Flash memory device may include some bad blocks at the beginning of the life of the device, and the number of bad blocks typically increases during the lifetime of the device. Flash memory blocks can become bad from any number of reasons. For example, each block of flash memory is limited in the number of times the data therein can be programmed and erased, characterized by a maximum program/erase (P/E) cycle. Thus, if a block of the Flash memory has been programmed and erased a number of times exceeding the P/E cycle maximum, it may turn bad. Flash memory blocks may also become bad blocks by erase failure, or other causes.
In most instances, the capacity of a memory card or other device using Flash memory (referred to generally as a Flash device) must be guaranteed during a rated lifetime of the device. The Flash device capacity may be directly limited by the number of usable blocks available to store data. Therefore, in order to ensure that the card capacity is maintained throughout the rated lifetime of the Flash device, a system designer may allocate a certain amount of usable blocks in a spare pool to allow switching of good spare blocks instead of bad used blocks during usage. Maintaining a pool of spare blocks from which good blocks may be drawn upon in exchange for bad blocks allows a requisite number of usable blocks to be ensured throughout the life of the device.
In MLC flash memory devices, memory blocks may be used as different types, for example SLC, MLCx2, MLCx3 blocks, etc., each of which may have different reliability specifications. Due to the differing reliability specifications of each data block type, a designer may allocate different numbers of spare blocks associated with each block type.
However, the rate of deterioration may be different for the different block types, such that when a spare block pool of one type is depleted, the memory device may reach the end of its usable life, even though there may be spare blocks of other types remaining. For example, at a certain point in the life of the device, there may be too few usable SLC blocks to maintain the specified flash memory card capacity while a surplus of MLC block types remain. The lifetime of the device will therefore end while usable MLC spare blocks are still available. Consequently, all of the flash memory blocks will be sub-optimally exploited during the lifespan of the device.
A similar problem arises when handling caching and buffering for the flash memory write operation or when executing the static and dynamic wear leveling processes. Buffer and cache operations and static and dynamic wear leveling processes may both require use of spare blocks. A problem may arise when there are too few good blocks of one of the block populations, e.g., SLC, MLC, to allocate for buffering and caching, or for static and dynamic wear leveling.
For the foregoing reasons, there is a need for a flash memory method that ensures optimal usage of all blocks throughout the life of the flash memory device and increases longer flash memory device lifespan.
Embodiments of the present invention provide systems and methods for using Flash memory by allocating a first portion of spare blocks in the Flash memory as a single level cell (SLC) spare block pool, and allocating a second portion of spare blocks in the Flash memory as a multi-level cell (MLC) spare block pool. Bad SLC blocks in the Flash memory may be replaced with spare blocks from the SLC spare block pool. If the number of spare blocks in the SLC spare block pool is less than a minimum SLC spare pool threshold, then spare blocks from the MLC spare block pool may be re-allocated to the SLC spare block pool.
Embodiments of the present invention provide systems and methods for using non-volatile memory by allocating N number of portions of spare blocks in the non-volatile memory as N number of multi-level cell (MLCx(N)) spare block pools. Bad MLCx(j) blocks in the non-volatile memory may be exchanged with spare blocks from an MLCx(j) spare block pool. If the number of spare blocks in an MLCx(j) spare block pool is less than a minimum MLCx(j) spare pool threshold, spare blocks may be transferred from the MLCx(j+1) spare block pool to the MLCx(j) spare block pool.
The subject matter regarded as the invention is particularly pointed out and distinctly claimed in the concluding portion of the specification. The invention, however, both as to organization and method of operation, together with objects, features, and advantages thereof, may best be understood by reference to the following detailed description when read with the accompanying drawings in which:
It will be appreciated that for simplicity and clarity of illustration, elements shown in the figures have not necessarily been drawn to scale. For example, the dimensions of some of the elements may be exaggerated relative to other elements for clarity. Further, where considered appropriate, reference numerals may be repeated among the figures to indicate corresponding or analogous elements.
In the following detailed description, numerous specific details are set forth in order to provide a thorough understanding of the invention. However, it will be understood by those skilled in the art that the present invention may be practiced without these specific details. In other instances, well-known methods, procedures, and components, modules, units and/or circuits have not been described in detail so as not to obscure the invention.
Although embodiments of the invention are not limited in this regard, discussions utilizing terms such as, for example, “processing,” “computing,” “calculating,” “determining,” “establishing”, “analyzing”, “checking”, or the like, may refer to operation(s) and/or process(es) of a computer, a computing platform, a computing system, or other electronic computing device, that manipulates and/or transforms data represented as physical (e.g., electronic) quantities within the computer's registers and/or memories into other data similarly represented as physical quantities within the computer's registers and/or memories or other information non-transitory storage medium that may store instructions to perform operations and/or processes.
Although embodiments of the invention are not limited in this regard, the terms “plurality” and “a plurality” as used herein may include, for example, “multiple” or “two or more”. The terms “plurality” or “a plurality” may be used throughout the specification to describe two or more components, devices, elements, units, parameters, or the like. Unless explicitly stated, the method embodiments described herein are not constrained to a particular order or sequence. Additionally, some of the described method embodiments or elements thereof can occur or be performed simultaneously, at the same point in time, or concurrently.
According to embodiments of the present invention, a common spare block pool may be used in a Flash memory so as to increase the usable lifetime of a Flash memory device by more fully exploiting spare memory blocks.
According to embodiments of the invention, upon initialization of the Flash memory, a common pool of spare blocks may be apportioned as a pool of spare SLC blocks and a pool of spare MLC blocks. More specifically, in some embodiments of the invention, an initial number of the spare blocks may initially be allocated as a pool of spare SLC blocks, and the remainder of the spare blocks may be allocated as a pool of spare MLC blocks. The initial number of spare blocks allocated for use as a spare pool of SLC blocks may be a small number, for example, the minimum number of spare blocks required for smooth operation of the SLC memory cells, for example, two spare blocks. The remainder of the spare blocks may be allocated for use as a spare pool of MLC blocks.
As described below, during use of the Flash device, memory blocks in use are periodically tested to identify bad blocks, and bad blocks are exchanged with spare blocks from the spare block pool of the corresponding type. According to embodiments of the invention, upon reaching below a minimum level of spare SLC blocks, spare blocks allocated to the MLC spare block pool may be transferred to the SLC spare block pool to maintain a minimum number of spare blocks. Additionally or alternatively, according to embodiments of the invention, MLC blocks in use may be transferred to the SLC spare block pool upon reaching a use condition, such as a maximum MLC bearable cycle count. SLC blocks that reach a maximum cycle count may be declared bad blocks. When no more MLC spare blocks are available, the Flash device may end its lifetime.
As shown in
For example, in an embodiment of the invention, the SLC flash memory array 110, may require 10 usable SLC blocks and one spare SLC block at any arbitrary moment for smooth operation. A total of 11 SLC blocks may therefore be allocated to the SLC flash memory array 110 at system initialization, ten blocks of which are for general use in the SLC used memory pool 130, and one block of which is allocated to the SLC spare blocks pool 140. The remaining blocks are allocated to the MLC spare block pool 150.
According to an embodiment of the invention, during normal operation of the flash memory device 100, the memory controller 30 may scan and test the flash memory arrays to identify bad blocks 170. Various methods are known for testing for bad blocks, which are not described herein for purposes of brevity. If a bad block 170 is discovered in the MLC flash memory array 120, the MLC bad block may be exchanged with a spare block from the MLC spare block pool 150. If a bad block is discovered in the SLC flash memory array 110, the bad block may be exchanged with a spare block from the SLC spare blocks pool 140.
In some embodiments of the invention, the memory device may require a predetermined minimum number of spare SLC blocks to be available at any time. Therefore, according to embodiments of the invention, when, for example, due to usage of SLC spare blocks, the number of available spare SLC blocks falls below this minimum, spare blocks from the MLC spare pool may be transferred, or re-allocated for use as SLC spare blocks as required.
In an embodiment of the invention, dynamic and static wear leveling operations may be performed within the SLC flash memory array 110 and the MLC flash memory array 120. Dynamic and static wear leveling operations may be performed, for example, in order to extend the useful life of the Flash memory device. Each flash memory block is typically rated for a certain number of P/E cycles. For example, MLC blocks may be rated for 3,000 P/E cycles and SLC blocks may be rated for 50,000 P/E cycles. Dynamic and static wear leveling may prevent or delay some blocks of memory from exceeding a predetermined P/E cycle threshold while other blocks have endured fewer P/E cycles by distributing Flash cell erasures and re-writes evenly across the Flash memory array.
In an embodiment of the invention, MLC blocks from the MLC flash memory array 120 that reach a predetermined maximum MLC bearable P/E cycles may be transferred to the SLC spare block pool 140 and called into use as SLC blocks as required. In some embodiments of the invention, a maximum number of bearable P/E cycles for an MLC block may be approximately 3,000 P/E cycles; a maximum number of bearable P/E cycles for an SLC block may be approximately 50,000 P/E cycles. According to embodiments of the invention, MLC blocks, therefore, may be used as SLC blocks after exceeding the maximum P/E cycle rating for an MLC block but while still less than the maximum P/E cycle rating for SLC blocks. SLC blocks that reach the maximum P/E cycle count for an SLC block may be declared bad blocks. Accordingly, the end of the Flash memory device's life may be declared when the number of remaining MLC spare blocks is zero. In some embodiments of the invention, when a device reaches the end of its lifetime, no more writes may be allowed, and the device may be declared Read-Only.
During normal operation of Flash memory device 200, memory controller 30 may regularly scan and test the memory arrays to identify bad blocks, e.g., a bad SLC block is discovered, or a SLC memory block has exceeded the prescribed maximum number of bearable P/E cycles. In an embodiment of the invention, bad SLC blocks in use in SLC used memory pool 240 may be exchanged for good SLC blocks from SLC spare block pool 250. Bad MLCx2 blocks in use in MLCx2 used block pool 270 may be exchanged for good MLCx2 blocks from MLCx2 spare block pool 280. Bad MLCx3 blocks in use in MLCx3 blocks 290 may be exchanged for good MLCx3 blocks from MLCx2 spare block pool 260.
As mentioned above, the number of SLC blocks allocated to the SLC spare block pool may be small, and therefore, the pool may be depleted of spare blocks after operation of SLC blocks in the device. Accordingly, if SLC blocks are no longer available in the SLC spare block pool, or if the number of spare blocks in the SLC spare block pool falls below a minimum threshold, e.g., a minimum number required for smooth operation of the SLC memory, a spare block from the MLCx2 spare block pool may be reallocated for the SLC spare block pool.
Likewise, the number of MLCx2 blocks allocated to the MLCx2 spare block pool may be small, and therefore, the pool may be depleted of spare blocks after operation of MLCx2 blocks in the device. Accordingly, if MLCx2 blocks are no longer available in the MLCx2 spare block pool, or if the number of spare blocks in the MLCx2 spare block pool falls below a minimum threshold, e.g., a minimum number required for smooth operation of the MLCx2 memory, a spare block from the MLCx3 spare block pool may be reallocated for the MLCx2 spare block pool.
In an embodiment of the invention, dynamic and static wear leveling operations may be performed in any one or more of the SLC flash memory array 210, the MLCx2 memory array 220, and the MLCx3 memory array 230 in order to increase the lifetime of the flash memory.
Additionally or alternatively, in an embodiment of the invention, MLCx3 blocks in use from the MLCx3 memory array 230 that reach maximum bearable cycle count for MLCx3 memory may be transferred to the MLCx2 spare block pool 280. Similarly, MLCx2 blocks in the MLCx2 memory array 220 that reach maximum bearable cycle count specified for MLCx2 memory may be transferred to SLC spare block pool 250. SLC blocks that reach the maximum bearable P/E cycle count for an SLC block may be declared bad blocks 300.
According to an embodiment of the invention, the end of the Flash memory device 200 life may be declared to occur when the number of MLCx3 spare blocks is less than a predefined minimum spare blocks required for the X3 flash memory device 200 to operate according to specification.
It will be understood that the above example involving one type of MLC block, e.g., an MLCx2, and SLC blocks may be generalized to include many types of MLC, e.g., MLCxN, MLCx(N−1) . . . MLCx2 and SLC blocks. In such embodiments of the invention, each of the lower levels of cell blocks (SLC, MLCx2 . . . MLCx(N−1)) may be allotted the minimum number of spare blocks, and upon a type of spare block pool being depleted of spare blocks, additional spare blocks may be allocated from the spare block pool of a higher-order MLC block pool. Additionally or alternatively, upon exhaustion of an MLC block in use by reaching a maximum number of bearable P/E cycles for that type of MLC block, e.g., MLCx(j), the block may be reallocated as a spare block of type MLCx(j−1). It will be understood that in an SLC block may be considered analogous to MLCx1.
In operation 400, a controller (e.g., memory controller 30 of
In operation 410, the controller may allocate a second portion of spare blocks as an MLC spare block pool (e.g., MLC spare block pool 150 of
In operation 420, the controller may replace bad SLC blocks in the Flash memory with spare blocks from the SLC spare block pool. An SLC block or other type of Flash memory block may become a bad block, for example, if the block is programmed and erased a number of times exceeding the P/E cycle maximum for the SLC block. Flash memory blocks may also become bad blocks by erase failure, or other causes.
In operation 430, the controller may replace bad MLC blocks in the Flash memory with spare blocks from the MLC spare block pool.
In operation 440, the controller may determine if the number of blocks in the SLC spare block pool is less than a minimum SLC spare pool threshold (e.g., the minimum number of SLC blocks necessary for smooth function of the SLC memory cells and/or the Flash memory device). If the number of blocks in the SLC spare block pool is less than a minimum SLC spare pool threshold, a process or the controller may proceed to operation 450. If the number of blocks in the SLC spare block pool is equal to or greater than a minimum SLC spare pool threshold, a process or the controller may proceed to operation 420.
In operation 450, the controller may re-allocate spare blocks from the MLC spare block pool to the SLC spare block pool. The controller may, in some embodiments, transfer or re-allocate MLC spare blocks whose P/E cycles have exceeded the maximum P/E cycle rating for an MLC block but not the maximum P/E cycle rating for an SLC block. Any MLC block, or other type of block, that has not exceeded the maximum P/E cycle rating for SLC blocks may be re-allocated to the SLC spare block pool.
In operation 460, the controller may determine if the number of blocks in the MLC spare block pool is less than a minimum MLC spare pool threshold. If the number of blocks in the MLC spare block pool is less than a minimum MLC spare pool threshold, a process or controller may proceed to operation 470. If the number of blocks in the MLC spare block pool is greater than or equal to a minimum MLC spare pool threshold, a process or controller may proceed to operation 420.
In operation 470, the controller may declare an end of life of the Flash memory array.
Other operations or orders of operations may be used.
Embodiments of the invention may demonstrate one or move advantages, including, without requirement or limitation, ensuring optimal usage of all blocks throughout the life of the Flash memory device, increased spare block resources for the buffer and cache processes within the Flash device, longer Flash memory device lifespan, and/or reducing environmental waste from expired flash memory devices.
While certain features of the invention have been illustrated and described herein, many modifications, substitutions, changes, and equivalents may occur to those skilled in the art. It is, therefore, to be understood that the appended claims are intended to cover all such modifications and changes as fall within the true spirit of the invention.
This application claims the benefit of U.S. Provisional Patent Application No. 61/329,366, filed Apr. 29, 2010, which is incorporated herein by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
4463375 | Macovski | Jul 1984 | A |
4584686 | Fritze | Apr 1986 | A |
4589084 | Fling et al. | May 1986 | A |
4866716 | Weng | Sep 1989 | A |
5077737 | Leger et al. | Dec 1991 | A |
5297153 | Baggen et al. | Mar 1994 | A |
5657332 | Auclair et al. | Aug 1997 | A |
5729490 | Calligaro et al. | Mar 1998 | A |
5793774 | Usui et al. | Aug 1998 | A |
5926409 | Engh et al. | Jul 1999 | A |
5956268 | Lee | Sep 1999 | A |
5982659 | Irrinki et al. | Nov 1999 | A |
6038634 | Ji et al. | Mar 2000 | A |
6094465 | Stein et al. | Jul 2000 | A |
6119245 | Hiratsuka | Sep 2000 | A |
6182261 | Haller et al. | Jan 2001 | B1 |
6192497 | Yang et al. | Feb 2001 | B1 |
6195287 | Hirano | Feb 2001 | B1 |
6199188 | Shen et al. | Mar 2001 | B1 |
6209114 | Wolf et al. | Mar 2001 | B1 |
6259627 | Wong | Jul 2001 | B1 |
6278633 | Wong et al. | Aug 2001 | B1 |
6279133 | Vafai et al. | Aug 2001 | B1 |
6301151 | Engh et al. | Oct 2001 | B1 |
6370061 | Yachareni et al. | Apr 2002 | B1 |
6374383 | Weng | Apr 2002 | B1 |
6504891 | Chevallier | Jan 2003 | B1 |
6532169 | Mann et al. | Mar 2003 | B1 |
6532556 | Wong et al. | Mar 2003 | B1 |
6553533 | Demura et al. | Apr 2003 | B2 |
6560747 | Weng | May 2003 | B1 |
6637002 | Weng et al. | Oct 2003 | B1 |
6639865 | Kwon | Oct 2003 | B2 |
6674665 | Mann et al. | Jan 2004 | B1 |
6704902 | Shinbashi et al. | Mar 2004 | B1 |
6751766 | Guterman et al. | Jun 2004 | B2 |
6772274 | Estakhri | Aug 2004 | B1 |
6781910 | Smith | Aug 2004 | B2 |
6792569 | Cox et al. | Sep 2004 | B2 |
6873543 | Smith et al. | Mar 2005 | B2 |
6891768 | Smith et al. | May 2005 | B2 |
6914809 | Hilton et al. | Jul 2005 | B2 |
6915477 | Gollamudi et al. | Jul 2005 | B2 |
6952365 | Gonzalez et al. | Oct 2005 | B2 |
6961890 | Smith | Nov 2005 | B2 |
6990012 | Smith et al. | Jan 2006 | B2 |
6996004 | Fastow et al. | Feb 2006 | B1 |
6999854 | Roth | Feb 2006 | B2 |
7010739 | Feng et al. | Mar 2006 | B1 |
7012835 | Gonzalez et al. | Mar 2006 | B2 |
7038950 | Hamilton et al. | May 2006 | B1 |
7068539 | Guterman et al. | Jun 2006 | B2 |
7079436 | Perner et al. | Jul 2006 | B2 |
7149950 | Spencer et al. | Dec 2006 | B2 |
7177977 | Chen et al. | Feb 2007 | B2 |
7191379 | Adelmann et al. | Mar 2007 | B2 |
7196946 | Chen et al. | Mar 2007 | B2 |
7203874 | Roohparvar | Apr 2007 | B2 |
7290203 | Emma et al. | Oct 2007 | B2 |
7292365 | Knox | Nov 2007 | B2 |
7301928 | Nakabayashi et al. | Nov 2007 | B2 |
7441067 | Gorobets et al. | Oct 2008 | B2 |
7466575 | Shalvi et al. | Dec 2008 | B2 |
7533328 | Alrod et al. | May 2009 | B2 |
7558109 | Brandman et al. | Jul 2009 | B2 |
7593263 | Sokolov et al. | Sep 2009 | B2 |
7697326 | Sommer et al. | Apr 2010 | B2 |
7706182 | Shalvi et al. | Apr 2010 | B2 |
7804718 | Kim | Sep 2010 | B2 |
7805663 | Brandman et al. | Sep 2010 | B2 |
7805664 | Yang et al. | Sep 2010 | B1 |
7844877 | Litsyn et al. | Nov 2010 | B2 |
7961797 | Yang et al. | Jun 2011 | B1 |
8020073 | Emma et al. | Sep 2011 | B2 |
8122328 | Liu et al. | Feb 2012 | B2 |
20020063774 | Hillis et al. | May 2002 | A1 |
20020085419 | Kwon et al. | Jul 2002 | A1 |
20020154769 | Petersen et al. | Oct 2002 | A1 |
20030065876 | Lasser | Apr 2003 | A1 |
20030101404 | Zhao et al. | May 2003 | A1 |
20030105620 | Bowen | Jun 2003 | A1 |
20030192007 | Miller et al. | Oct 2003 | A1 |
20040015771 | Lasser et al. | Jan 2004 | A1 |
20040030971 | Tanaka et al. | Feb 2004 | A1 |
20040153722 | Lee | Aug 2004 | A1 |
20040153817 | Norman et al. | Aug 2004 | A1 |
20040181735 | Xin | Sep 2004 | A1 |
20050013165 | Ban | Jan 2005 | A1 |
20050018482 | Cemea et al. | Jan 2005 | A1 |
20050083735 | Chen et al. | Apr 2005 | A1 |
20050117401 | Chen et al. | Jun 2005 | A1 |
20050120265 | Pline et al. | Jun 2005 | A1 |
20050128811 | Kato et al. | Jun 2005 | A1 |
20050138533 | Le Bars et al. | Jun 2005 | A1 |
20050144213 | Simkins et al. | Jun 2005 | A1 |
20050144368 | Chung et al. | Jun 2005 | A1 |
20050169057 | Shibata et al. | Aug 2005 | A1 |
20050172179 | Brandenberger et al. | Aug 2005 | A1 |
20050213393 | Lasser | Sep 2005 | A1 |
20060059406 | Micheloni et al. | Mar 2006 | A1 |
20060059409 | Lee | Mar 2006 | A1 |
20060064537 | Oshima et al. | Mar 2006 | A1 |
20060101193 | Murin | May 2006 | A1 |
20060203587 | Li et al. | Sep 2006 | A1 |
20060221692 | Chen | Oct 2006 | A1 |
20060248434 | Radke et al. | Nov 2006 | A1 |
20060268608 | Noguchi et al. | Nov 2006 | A1 |
20060294312 | Walmsley | Dec 2006 | A1 |
20070025157 | Wan et al. | Feb 2007 | A1 |
20070063180 | Asano et al. | Mar 2007 | A1 |
20070103992 | Sakui et al. | May 2007 | A1 |
20070104004 | So et al. | May 2007 | A1 |
20070109858 | Conley et al. | May 2007 | A1 |
20070124652 | Litsyn et al. | May 2007 | A1 |
20070143561 | Gorobets | Jun 2007 | A1 |
20070150694 | Chang et al. | Jun 2007 | A1 |
20070168625 | Cornwell et al. | Jul 2007 | A1 |
20070171714 | Wu et al. | Jul 2007 | A1 |
20070171730 | Ramamoorthy et al. | Jul 2007 | A1 |
20070180346 | Murin | Aug 2007 | A1 |
20070223277 | Tanaka et al. | Sep 2007 | A1 |
20070226582 | Tang et al. | Sep 2007 | A1 |
20070226592 | Radke | Sep 2007 | A1 |
20070228449 | Takano et al. | Oct 2007 | A1 |
20070253249 | Kang et al. | Nov 2007 | A1 |
20070253250 | Shibata et al. | Nov 2007 | A1 |
20070263439 | Cornwell et al. | Nov 2007 | A1 |
20070266291 | Toda et al. | Nov 2007 | A1 |
20070271494 | Gorobets | Nov 2007 | A1 |
20080010581 | Alrod et al. | Jan 2008 | A1 |
20080028014 | Hilt et al. | Jan 2008 | A1 |
20080055989 | Lee et al. | Mar 2008 | A1 |
20080082897 | Brandman et al. | Apr 2008 | A1 |
20080092026 | Brandman et al. | Apr 2008 | A1 |
20080104309 | Cheon et al. | May 2008 | A1 |
20080112238 | Kim et al. | May 2008 | A1 |
20080116509 | Harari et al. | May 2008 | A1 |
20080126686 | Sokolov et al. | May 2008 | A1 |
20080127104 | Li et al. | May 2008 | A1 |
20080128790 | Jung | Jun 2008 | A1 |
20080130341 | Shalvi et al. | Jun 2008 | A1 |
20080137413 | Kong et al. | Jun 2008 | A1 |
20080148115 | Sokolov et al. | Jun 2008 | A1 |
20080158958 | Shalvi et al. | Jul 2008 | A1 |
20080159059 | Moyer | Jul 2008 | A1 |
20080162079 | Astigarraga et al. | Jul 2008 | A1 |
20080168216 | Lee | Jul 2008 | A1 |
20080168320 | Cassuto et al. | Jul 2008 | A1 |
20080181001 | Shalvi | Jul 2008 | A1 |
20080198650 | Shalvi et al. | Aug 2008 | A1 |
20080198652 | Shalvi et al. | Aug 2008 | A1 |
20080209114 | Chow et al. | Aug 2008 | A1 |
20080219050 | Shalvi et al. | Sep 2008 | A1 |
20080225599 | Chae | Sep 2008 | A1 |
20080263262 | Sokolov et al. | Oct 2008 | A1 |
20080282106 | Shalvi et al. | Nov 2008 | A1 |
20080285351 | Shlick et al. | Nov 2008 | A1 |
20080301532 | Uchikawa et al. | Dec 2008 | A1 |
20090024905 | Shalvi et al. | Jan 2009 | A1 |
20090043951 | Shalvi et al. | Feb 2009 | A1 |
20090072303 | Prall et al. | Mar 2009 | A9 |
20090091979 | Shalvi | Apr 2009 | A1 |
20090103358 | Sommer et al. | Apr 2009 | A1 |
20090106485 | Anholt | Apr 2009 | A1 |
20090113275 | Chen et al. | Apr 2009 | A1 |
20090125671 | Flynn et al. | May 2009 | A1 |
20090144600 | Perlmutter et al. | Jun 2009 | A1 |
20090150748 | Egner et al. | Jun 2009 | A1 |
20090157964 | Kasorla et al. | Jun 2009 | A1 |
20090158126 | Perlmutter et al. | Jun 2009 | A1 |
20090168524 | Golov et al. | Jul 2009 | A1 |
20090187803 | Anholt et al. | Jul 2009 | A1 |
20090199074 | Sommer | Aug 2009 | A1 |
20090213653 | Perlmutter et al. | Aug 2009 | A1 |
20090213654 | Perlmutter et al. | Aug 2009 | A1 |
20090228761 | Perlmutter et al. | Sep 2009 | A1 |
20090240872 | Perlmutter et al. | Sep 2009 | A1 |
20090300269 | Radke et al. | Dec 2009 | A1 |
20100005270 | Jiang | Jan 2010 | A1 |
20100058146 | Weingarten et al. | Mar 2010 | A1 |
20100064096 | Weingarten et al. | Mar 2010 | A1 |
20100088557 | Weingarten et al. | Apr 2010 | A1 |
20100091535 | Sommer et al. | Apr 2010 | A1 |
20100095186 | Weingarten | Apr 2010 | A1 |
20100110787 | Shalvi et al. | May 2010 | A1 |
20100115376 | Shalvi et al. | May 2010 | A1 |
20100122113 | Weingarten et al. | May 2010 | A1 |
20100124088 | Shalvi et al. | May 2010 | A1 |
20100131580 | Kanter et al. | May 2010 | A1 |
20100131806 | Weingarten et al. | May 2010 | A1 |
20100131809 | Katz | May 2010 | A1 |
20100131826 | Shalvi et al. | May 2010 | A1 |
20100131827 | Sokolov et al. | May 2010 | A1 |
20100131831 | Weingarten et al. | May 2010 | A1 |
20100146191 | Katz | Jun 2010 | A1 |
20100146192 | Weingarten et al. | Jun 2010 | A1 |
20100149881 | Lee et al. | Jun 2010 | A1 |
20100172179 | Gorobets et al. | Jul 2010 | A1 |
20100180073 | Weingarten et al. | Jul 2010 | A1 |
20100199149 | Weingarten et al. | Aug 2010 | A1 |
20100211724 | Weingarten | Aug 2010 | A1 |
20100211833 | Weingarten | Aug 2010 | A1 |
20100211856 | Weingarten | Aug 2010 | A1 |
20100241793 | Sugimoto et al. | Sep 2010 | A1 |
20100251066 | Radke | Sep 2010 | A1 |
20100253555 | Weingarten et al. | Oct 2010 | A1 |
20100257309 | Barsky et al. | Oct 2010 | A1 |
20100293321 | Weingarten | Nov 2010 | A1 |
20110051521 | Levy et al. | Mar 2011 | A1 |
20110055461 | Steiner et al. | Mar 2011 | A1 |
20110096612 | Steiner et al. | Apr 2011 | A1 |
20110119562 | Steiner et al. | May 2011 | A1 |
20110153919 | Sabbag | Jun 2011 | A1 |
20110161775 | Weingarten | Jun 2011 | A1 |
20110214029 | Steiner et al. | Sep 2011 | A1 |
20110214039 | Steiner et al. | Sep 2011 | A1 |
20110246792 | Weingarten | Oct 2011 | A1 |
20110246852 | Sabbag | Oct 2011 | A1 |
20110252187 | Segal et al. | Oct 2011 | A1 |
20110252188 | Weingarten | Oct 2011 | A1 |
20110271043 | Segal et al. | Nov 2011 | A1 |
20110302428 | Weingarten | Dec 2011 | A1 |
20120001778 | Steiner et al. | Jan 2012 | A1 |
20120005554 | Steiner et al. | Jan 2012 | A1 |
20120005558 | Steiner et al. | Jan 2012 | A1 |
20120005560 | Steiner et al. | Jan 2012 | A1 |
20120008401 | Katz et al. | Jan 2012 | A1 |
20120008414 | Katz et al. | Jan 2012 | A1 |
20120051144 | Weingarten et al. | Mar 2012 | A1 |
20120063227 | Weingarten et al. | Mar 2012 | A1 |
20120066441 | Weingarten | Mar 2012 | A1 |
20120110250 | Sabbag et al. | May 2012 | A1 |
20120246391 | Meir et al. | Sep 2012 | A1 |
Entry |
---|
Search Report of PCT Patent Application WO 2009/118720 A3. |
Search Report of PCT Patent Application WO 2009/095902 A3. |
Search Report of PCT Patent Application WO 2009/078006 A3. |
Search Report of PCT Patent Application WO 2009/074979 A3. |
Search Report of PCT Patent Application WO 2009/074978 A3. |
Search Report of PCT Patent Application WO 2009/072105 A3. |
Search Report of PCT Patent Application WO 2009/072104 A3. |
Search Report of PCT Patent Application WO 2009/072103 A3. |
Search Report of PCT Patent Application WO 2009/072102 A3. |
Search Report of PCT Patent Application WO 2009/072101 A3. |
Search Report of PCT Patent Application WO 20091072100 A3. |
Search Report of PCT Patent Application WO 20091053963 A3. |
Search Report of PCT Patent Application WO 20091053962 A3. |
Search Report of PCT Patent Application WO 20091053961 A3. |
Search Report of PCT Patent Application WO 20091037697 A3. |
Yani Chen, Kcshab K. Parhi, “Small Area Parallel Chien Search Architectures for Long BCH Codes”, leee Transactions on Very Large Scale Integration( VLSI) Systems, vol. 12, No. 5, May 2004. |
Yuejian Wu, “Low Power Decoding of BCH Codes”, Nortel Networks, Ottawa, Ont., Canada, in Circuits and systems, 2004. ISCAS '04. Proceeding of the 2004 International Symposium on Circuits and Systems, published May 23-26, 2004, vol. 2, pp. II-369-372 vol. 2. |
Michael Purser, “Introduction to Error Correcting Codes”, Artech House Inc., 1995. |
Ron M. Roth, “Introduction to Coding Theory”, Cambridge University Press, 2006. |
Akash Kumar, Sergei Sawitzki, “High-Throughput and Low Power Architectures for Reed Solomon Decoder”, (a.kumar at tue.nl, Eindhoven University of Technology and sergei.sawitzki at philips.com). |
Todd K.Moon, “Error Correction Coding Mathematical Methods and Algorithms”, A John Wiley & Sons, Inc., 2005. |
Richard E. Blahut, “Algebraic Codes for Data Transmission”, Cambridge University Press, 2003. |
David Esseni, Bruno Ricco, “Trading-Off Programming Speed and Current Absorption in Flash Memories with the Ramped-Gate Programming Technique”, leee Transactions on Electron Devices, vol. 47, No. 4, Apr. 2000. |
Giovanni Campardo, Rino Micheloni, David Novosel, “VLSI-Design of Non-Volatile Memories”, Springer Berlin Heidelberg New York, 2005. |
John G. Proakis, “Digital Communications”, 3rd ed., New York: McGraw-Hill, 1995. |
J.M. Portal, H. Aziza, D. Nee, “EEPROM Memory: Threshold Voltage Built in Self Diagnosis”, ITC International Test Conference, Paper 2.1. |
J.M. Portal, H. Aziza, D. Nee, “EEPROM Diagnosis Based on Threshold Voltage Embedded Measurement”, Journal of Electronic Testing: Theory and Applications 21, 33-42, 2005. |
G. Tao, A. Scarpa, J. Dijkstra, W. Stidl, F. Kuper, “Data retention prediction for modern floating gate non-volatile memories”, Microelectronics Reliability 40 (2000), 1561-1566. |
T. Hirncno, N. Matsukawa, H. Hazama, K. Sakui, M. Oshikiri, K. Masuda, K. Kanda, Y. Itoh, J. Miyamoto, “A New Technique for Measuring Threshold Voltage Distribution in Flash EEPROM Devices”, Proc. IEEE 1995 Int. Conference on Microelectronics Test Structures, vol. 8, Mar. 1995. |
Boaz Eitan, Guy Cohen, Assaf Shappir, Eli Lusky, Amichai Givant, Meir Janai, Ilan Bloom, Yan Polansky, Oleg Dadashev, Avi Lavan, Ran Sahar, Eduardo Maayan, “4-bit per Cell NROM Reliability”, Appears on the website of Saifun.com. |
Paulo Cappelletti, Clara Golla, Piero Olivo, Enrico Zanoni, “Flash Memories”, Kluwer Academic Publishers, 1999. |
JEDEC STANDARD, “Stress-Test-Driven Qualification of Integrated Circuits”, JEDEC Solid State Technology Association. JEDEC Standard No. 47F pp. 1-26. |
Dempster, et al., “Maximum Likelihood from Incomplete Data via the EM Algorithm”, Journal of the Royal Statistical Society. Series B (Methodological), vol. 39, No. 1 (1997), pp. 1-38. |
Mielke, et al., “Flash EEPROM Threshold Instabilities due to Charge Trapping During Program/Erase Cycling”, IEEE Transactions on Device and Materials Reliability, vol. 4, No. 3, Sep. 2004, pp. 335-344. |
Daneshbeh, “Bit Serial Systolic Architectures for Multiplicative Inversion and Division over GF (2)”, A thesis presented to the University of Waterloo, Ontario, Canada, 2005, pp. 1-118. |
Chen, Formulas for the solutions of Quadratic Equations over GF (2), IEEE Trans. Inform. Theory, vol. IT-28, No. 5, Sep. 1982, pp. 792-794. |
Berlekamp et al., “On the Solution of Algebraic Equations over Finite Fields”, Inform. Cont. 10, Oct. 1967, pp. 553-564. |
Number | Date | Country | |
---|---|---|---|
20110271043 A1 | Nov 2011 | US |
Number | Date | Country | |
---|---|---|---|
61329366 | Apr 2010 | US |