Modern flash memory devices may store information as charge in cells, where each cell may be made of a floating gate transistor or an NROM transistor. In single-level cell (SLC) flash memory devices, each cell may store only one bit of information. Multi-level cell (MLC) flash memory devices can store more than one bit per cell by choosing between more than one pair of levels of electrical charge to apply to the floating gates of their cells. The applied charge (also known as charge level) may be measured by a detector. The detector may compare the voltage of the transistor gate (also known as charge level and denoted VT) to a decision threshold voltage (also known as charge level boundary point and denoted VD). The amount of charge may be used to determine the programmed level (logical value) of the cell. Due to inaccuracies during the programming procedure and charge loss due to time and temperature (also known as retention), the measured levels may suffer from a random distortion.
In multi-level cell flash memory devices, each cell can store more than one bit per cell. The program level of each cell is determined by an n-tuple of bits (e.g., n=1, 2, 3). The cell might not be directly programmed to one of its possible program levels in a single step. Program levels may be written in stages, where in each stage only a single bit is programmed.
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.
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.
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 have not been described in detail so as not to obscure the present invention.
The cell's programmed level may be determined using several methods. One method is to apply a voltage to the cell's gate and measure if the cell conducts current. The cell may have a certain threshold voltage such that if voltage above that threshold is applied to the gate, the gate will conduct. Below that threshold voltage, the gate will not conduct current (or will conduct a small amount of current, below a certain demarcation level). As the amount of charge in the cell changes this threshold voltage, the charge may be inferred by determining at which voltage the cells starts to conduct current. Thus, the programmed level may be determined by iteratively applying different voltages to the gate and measuring whether the cells conduct or not.
Another method to determine a cell's programmed level may be to apply a voltage above the threshold voltage, the cell conducts current and the amount of current may depends on the difference between the applied voltage and the threshold voltage. As the threshold voltage changes as a function of the amount of charge in the cell, the programmed level may be inferred by measuring the current going through the cell.
Thus, the programmed level may be obtained by simultaneously comparing the conducted current with a given set of fixed currents distinguishing between all programmed levels. Each cell's programmed level may be determined by simultaneously comparing the VT level against several decision threshold levels 31, 32, 33. For example, if there are four possible programmed levels, the cell's VT may be simultaneously compared against three decision threshold levels 31, 32, 33 that may divide the voltage axis into four regions.
MSB programming may be done using a single program level (in addition to an erase level). If the MSB equals 1, no programming is done and the cell may remain in the erase state. Otherwise, the cell is programmed to a certain program level.
When the CSB is programmed, if the MSB equals 1 the erased state is either left unchanged, or the cell is programmed to the first program level, depending on the value of the CSB. If the MSB equals 0, the single program level of the MSB is shifted to one of two new program levels, depending on the value of the CSB. Thus, a cell whose MSB and CSB were programmed has one of four program levels (including the erase state).
In order to program the LSB, the MSB and CSB of the cell may first be read. Then, according to the value of the LSB, the erase state either remains unchanged, or the cell may be programmed to a new program level. Similarly, the remaining three CSB program levels may be shifted by one of two possible voltage offsets to two new program levels.
In some implementations some pages can be only MSB programmed, some pages can be only CSB programmed and some pages can be only LSB programmed.
Programming the cells as described above may reduce the effect of coupling between adjacent cells in the memory array (intra-row coupling reduction). If, at each time, only one bit is programmed to a cell then the changes in threshold voltage occur only within a small voltage window. This reduces the interference that adjacent cells may experience due to programming neighboring cells. The procedure outlined above may be referred as decoupling.
Programming a cell to a given threshold voltage (or charge level) may involve applying a sequence of voltage pulses on the cell's gate, thereby causing the insertion of an electric charge into the floating gate. After each pulse is applied, the threshold level of the cell may be measured. If the target level has been reached, further voltage pulses may not need to be applied to this cell. If, on the other hand, the target threshold voltage has not been reached, the voltage pulses may be continued.
Choosing a larger voltage for the programming pulse may increase the amount of charge inserted at each time, and may have the effect of speeding up the programming time. Because the pulses may be applied until the actual threshold voltage is higher than the target value, a larger voltage may incur a greater inaccuracy in the final threshold voltage. As the pulses' amplitude increases, the standard deviation (STD) of the threshold voltage may increase. The increase of the threshold voltage STD may indicate a higher detection error rate and a possible degradation of reliability.
Different pulses may be used to program the MSB, CSB, and/or LSB. When programming the MSB, since only two program levels are present, a larger STD can be tolerated, and a larger pulse voltage can be used. When programming the LSB, smaller voltages may be required, in order to keep the standard deviation at the minimum required by the error correcting code. Programming the MSB may be faster than programming the LSB.
The programming process may be done in parallel on a set of cells arranged in physical rows. A physical row may be a set of consecutive rows and can include one or more nonvolatile memory pages and/or a portion of a nonvolatile memory page. A cell in a physical row, when programmed to a certain bit position, may be charged to one of two voltages depending on the bit value and the programming voltages. While programming a certain row, all other physical rows of the block may be provided with a pass voltage (Vpass),—i.e., a high voltage may be applied to their gate controls which switch the cells into a conductive state. The conductance of all the other cells in the string may allow a current to follow and charge the selected cell. The application of voltage on the un-selected cells might cause unintentional programming of these cells. This behavior is called a programming disturb. A high Vpass may cause column programming disturbs while a low Vpass might cause row programming disturbs.
A LSB cell may be very sensitive to program disturbs, therefore the LSB of a given row may be written after programming the MSB and CSB pages of the consecutive rows. The same applies for CSB pages: a CSB page may be programmed only after all MSB pages of consecutive rows are programmed to reduce program disturbs for the CSB page(s).
The following table illustrates this concept:
The numbers 0-23 indicate the sequence order of the rows being programmed (in this example there are 8 rows and each row is programmed to 3 bits per cells). Note that for any given LSB page, MSB and CSB pages of neighboring rows are programmed before that LSB page. For example, to decrease and/or reduce programming disturbs, the LSB page number 14 in row number 3 is programmed after MSB and CSB pages of row number 3 are programmed (pages 6 and 10) and not before the MSB and CSB pages of row number 4 are programmed This type of programming can be referred to as “Type 1” programming, since the LSB is written after MSB and CSB pages of the next row (+1 rows) are programmed Similarly, other types of programming may be defined (e.g., Type 2, Type 3, etc.). Type 0 may be a horizontal programming type, where the first page is the MSB page of row 0, the second page is the CSB page of row 0, the third page is the LSB page of row 0, the fourth page is the MSB page of row 1, etc.
For flash arrays with even/odd rows in each block the same concept may be used, where the even rows and the odd rows are ordered as shown in the following table:
Again, the numbers indicates the page ordering. The left part of the table applies for even rows and the right part applies for odd rows. As shown, the same concept is applied here, where each LSB page may be programmed only after all MSB/CSB pages of consecutive rows were programmed.
The following examples refer to a three-bit per cells but the method, devices and computer readable medium that embody the invention may be applied mutatis mutandis to cells that can store more than three bits per cell and to cells that can store a pair of bits.
A method in accordance with an embodiment of the invention may program a nonvolatile memory block by one or more programming phases of decreasing bit significance, where each programming phase programs all pages having the same bit significance. The programming method can start by performing a MSB programming phase in which all MSB pages of the nonvolatile memory block are programmed, then performing a CSB programming phase in which all CSB pages of the nonvolatile memory block are programmed, and finally performing a LSB programming phase in which all LSB pages of the nonvolatile memory block are programmed.
The terms “MSB pages”, “CSB pages” and “LSB pages” are logical notions and these different types of pages can be programmed to the same nonvolatile memory rows. It is also noted that partially programmed nonvolatile memory rows can also exist—for example, some nonvolatile memory rows can be programmed only as MSB pages, and/or only by another type of programming.
Table 3 illustrates three programming phases of a nonvolatile memory block that includes eight rows. The values included in Table 3 illustrate the programming order. The leftmost column of Table 3 illustrates a MSB programming phase (in which all pages may be programmed by MSB programming) that may be followed by a CSB programming phase (in which all pages may be programmed by CSB programming) that in turn is followed by a LSB programming phase (in which all pages may be programmed according to LSB programming).
Each of these programming phases exhibits a descending row programming order—e.g., starting from the last row (e.g., row 7) of the nonvolatile memory block and ending at the first row (e.g., row 0) of the nonvolatile memory block.
This programming order can be referred to as “type ∞” (type infinity) or “type n”, where n is a number of rows in the block.
The row programming order in which the nonvolatile memory block is programmed per each programming phase—e.g., for each page type of programming (MSB/CSB/LSB)—can be arbitrary. For example, Table 4 illustrates an ascending row programming order of the MSB programming phase, a descending programming order for the CSB programming phase, and an ascending programming order for the LSB programming phase.
Table 5 illustrates an interleaved row programming order where within the MSB programming phase, the CSB programming phase, and the LSB programming phase even rows may be programmed in an ascending manner, and then followed by the odd rows programmed in an ascending manner.
Table 6 illustrates an interleaved row programming order between odd and even nonvolatile memory blocks. Table 6 illustrates a MSB programming phase in which odd and even rows are MSB programmed in an interleaved manner starting from the first odd and even row pair and ending at the last odd and even row pair. The MSB programming phase may be followed by a CSB programming phase in which odd and even rows are CSB programmed in an interleaved manner starting from the first odd and even row pair and ending at the last odd and even row pair. The CSB programming phase may be followed by a LSB programming phase in which odd and even rows are LSB programmed in an interleaved manner starting from the first odd and even row pair and ending at the last odd and even row pair. Accordingly, all of the programming phases of Table 6 exhibit an ascending interleaved row programming order.
Table 7 illustrates an interleaved row programming order between odd and even nonvolatile memory blocks. Table 7 illustrates a MSB programming phase that may be followed by a CSB programming phase, and then a LSB programming phase. Within each of these (MSB, CSB, and/or LSB) programming phases odd and even rows may be programmed in an interleaved manner where the odd rows may be programmed in an ascending order and the even rows may be programmed in a descending manner.
The programming phases shown in Table 7 may reduce programming disturbs to LSB pages, since all MSB and CSB pages in the nonvolatile memory block are programmed, using coarse incremental-step-pulse programming (ISPP) pluses, prior to LSB programming.
The above-mentioned interleaved programming schemes can be applied in cases where different nonvolatile memory blocks reside on different integrated circuits.
A non-limiting example of a programming order in accordance with an embodiment of the invention is illustrated in Table 8. Table 8 illustrates an interleaved programming scheme in which three integrated circuit dies may be programmed so that parallel programming can be applied on different integrated circuits. For example, while rows of one integrated circuit may be programmed by a MSB programming phase, rows of another integrated circuit is programmed by a CSB programming phase and rows of a further integrated circuit is programmed by a LSB programming phase. Other combinations of programming phases may be implemented among the integrated circuit dies. In Table 8, the notation IP refers to individual programming as some cells may be individually programmed when the process is initiated and ended.
According to an embodiment of the invention, programming disturbs can be reduced for other page types—e.g., CSB pages and LSB pages. This can be achieved by applying different values of Vpass depending on the bit type currently being programmed. The MSB and CSB pages may suffer less programming disturbs due to a high Vpass.
Applying a different value Vpass on type 1 row programming order (or any order smaller than the number of rows in a block) may not be done, since for most MSB and CSB pages in a given row there may be a preceding programmed row with an LSB page.
Experiment shows that applying a different Vpass while using the proposed page order can reduce programming disturbs. When using programming ordering as illustrated in Table 7, the first even rows may be disturbed due to the programming of the odd rows, while the last odd rows may be disturbed due to the programming of even rows. In this way, the even/odd rows may behave similarly in terms of programming disturbs. When applying the programming order illustrated in Table 5, even rows may experience slightly higher programming disturbs due to odd rows programming, however, odd rows may experience lower programming disturbs since no neighboring rows are subsequently programmed.
Different Vpass values may be applied during read operations. Different Vpass values can be applied to nonvolatile memory blocks which are not programmed with LSB/CSB pages. A lower Vpass may reduce unintentional read disturbs to already programmed pages and to erased cells.
A method in accordance with an embodiment of the invention can be utilized to reduce block erase duration along with reduction in reliability failures due to erase. An erase process may be performed by charging all the cells in the block to the highest charge value and then erasing (discharging) all the cells together. The programming phase may ensure that cells are discharged starting the same charge value. In three bit per cell (e.g., eight-level) devices, a high charge voltage may be applied to accommodate the seven cell programming levels. When erasing a block, a very high voltage may be applied in the programming phase of the erase process. This high voltage stress may cause the flash to wear out. Moreover, the programming phase may prolong the erase process.
In accordance with an embodiment of the invention the erase operation (programming to an erase value) may be preceded by programming to a pre-erase value, which may differ per type of programming phase. The erasing (programming to an erase value) can be executed by three different erase operations according to the block state where a state is defined by the maximum number of bits programmed to any physical row on the block (e.g., a TLC block may have three states: MSB, CSB and LSB) each erase operation may include programming to a different pre-erase value and then programming to an erase value.
For example, to erase an MSB blocks, i.e., nonvolatile memory blocks which may be programmed only with MSB pages, we can apply an “MSB erase” operation. During the programming phase of the erase operation, the cells of the nonvolatile memory blocks may be programmed to a voltage that may be slightly above the highest probable MSB voltage. Similar erase operations can be defined to CSB blocks and LSB blocks.
The programming to a lower voltage prior to the erase may decrease the stress on the cells which in turn may reduce reliability failures. This technique may also be applied to blocks that may be programmed only with CSB and/or MSB pages.
The type of erase command to be applied can be managed by a flash controller, which may track which bit type was programmed lately, or can be done internally by a flash microcontroller. When using a different erase operation on the blocks, a flash controller can apply a different program/erase (P/E) cycle wear count according to the specific erase operation which was done. The different P/E cycle counts of different erase operations can be united to a single count value where each erase operation has a different count weight. For example, a MSB (SLC) erase can have a weight=1, CSB (MLC) erase can have a weight=10, and LSB (TLC) erase can have a weight=1000. The counter can be advanced using the different weights of the different erase operations.
According to an embodiment of the invention the information stored in multiple nonvolatile memory blocks of a single bit per cell (source blocks) can be jointly programmed into a single nonvolatile memory block of multiple bit per cell (destination block). The programming may include the programming phases discussed above. The information in each target block may be programmed by a programming phase, in which the programming phases may differ from each other by their bit significance.
For example, in an embodiment according to the present invention, a memory controller can “pack” three SLC nonvolatile memory blocks to one three-bit per cell (“3 bpc”) nonvolatile memory block by programming the information of the first SLC nonvolatile memory block by a MSB programming phase, programming the information of the second SLC nonvolatile memory block by a CSB programming phase, and finally programming the information of the third SLC nonvolatile memory block by a LSB programming phase. This programming scheme can be performed without an additional buffer for temporarily storing the content of three SCL nonvolatile memory blocks.
The method in accordance with an embodiment of the invention can be utilized when a stream of data is to be programmed rapidly as a SLC nonvolatile memory block, while later these SLC nonvolatile memory blocks can be packed up to 3 bpc nonvolatile memory blocks. A flash controller which may utilize the proposed ordering can dynamically hold a pool of SLC/MLC and 3 pbc blocks and change the partition dynamically with a lower penalty compared to standard programming order.
A memory controller may program information, stage 420, to a nonvolatile memory block by performing a sequence of programming phases of descending bit significances. The sequence of programming phases of descending bit significances can start from a most significant bit programming phase and can end at a least significant bit programming phase.
Step 420 can include programming all the nonvolatile memory rows of the nonvolatile memory block during each programming phase of the sequence. The programming can include at least one of the following: (i) performing a programming order where at least two programming phases of the sequence differ from each other; (ii) performing one programming phase of the sequence that may exhibit an ascending row programming order and performing another programming phase of the sequence that may exhibit a descending row programming order; (iii) performing at least one programming phase of the sequence that may exhibit an interleaved row programming order; (iv) performing at least one programming phase of the sequence that may exhibit an interleaved row programming order between odd and even nonvolatile memory blocks; and (v) performing at least two programming phases of the sequence that may have the same row programming order.
Programming information of step 420 can include providing a pass voltage to idle nonvolatile memory rows—e.g., rows that are not being filed. At least two programming phases of the sequence can differ in a level of pass voltage that is supplied to the idle nonvolatile memory rows. Step 420 can include supplying a low level Vpass during MSB page programming, a moderate level Vpass during CSB programming, and a higher level Vpass during LSB programming (e.g., the level of Vpass may increase as a bit significance of a programming phase decreases). With reference to
Method 400 can include programming the nonvolatile memory block to erase values, thereby erasing the nonvolatile memory block. In accordance with one embodiment of the invention, step 420 can include performing a sequence of programming phases of descending bit significances, step 424. Each of these programming phases of step 424 may include programming the nonvolatile memory block to a pre-erase value, and programming the nonvolatile memory block to an erase value that may be higher than the pre-erase value. At least two programming phases of stage 424 can differ in the pre-erase value. A level of pre-erase value can decrease with a decrement of a bit significance of a programming phase during step 424. An erase operation may be adapted according to the block programming state. If only MSB pages are programmed, an MSB erase operation may be done. If only MSB and CSB pages are programmed, then a CSB erase operation may be carried out. If there are some LSB pages programmed, a full erase operation may be done. In a MSB erase operation, the maximum pre-erase program voltage can be low in comparison to the full erase operation. There may be a set of different erase operations when each operation is employed according to the block program state.
In accordance with an embodiment of the invention, step 420 can include a memory controller programming information to multiple nonvolatile memory blocks, step 426, where each nonvolatile memory block may be programmed by performing a sequence of programming phases of descending bit significances. At least two of the nonvolatile memory blocks can belong to different integrated circuits.
Method 400 may continue with the memory controller reading the information, step 430, from the nonvolatile memory block by performing a sequence of read phases of descending bit significances, starting from a most significant bit programming phase and ending at a least significant bit programming phase.
Method 400 can calculate, step 450, a wear attribute of the nonvolatile memory block by associating different count weights to different programming phases that program the nonvolatile memory block to the erase value.
Method 400 can be applied to a nonvolatile memory block that can be programmed to include multiple pages, starting from a MSB page and ending at a CSB page. Method 400 can be applied on partially programmed nonvolatile memory blocks, e.g., those programmed according to a subset of the possible programming types.
Method 400 can be applied to partially programmed nonvolatile memory blocks where it may be that not all of the programming types (MSB, CSB, LSB) exist. Method 400 can be applied to these partially programmed blocks.
Method 500 may erase, step 520, the nonvolatile memory block by performing at least one erase phase. The erase phase may include programming the nonvolatile memory block to an erase value that may be higher than the pre-erase value. The erase value and the pre-erase value can be selected based on the bit significance level of the nonvolatile memory block.
Device 600 can execute any of the methods in accordance with one or more embodiments of the invention, including methods 400, 500, 600, or any of their steps.
Memory controller 610 can be configured to perform each of the following and/or a combination thereof: (i) perform a sequence of programming phases of descending bit significances that may start from a most significant bit programming phase and may end at a least significant bit programming phase; (ii) program the nonvolatile memory rows of the nonvolatile memory block during each programming phase of the sequence; (iii) perform the sequence of programming phases of descending bit significances where at least two programming phases of the sequence may differ by row programming order from each other; (iv) perform a sequence of programming phases of descending bit significances where one programming phase of the sequence may exhibit an ascending row programming order and another programming phase of the sequence may exhibit a descending row programming order; (v) perform a sequence of programming phases of descending bit significances where at least one programming phase of the sequence may exhibit an interleaved row programming order; (vi) perform a sequence of programming phases of descending bit significances where at least one programming phase of the sequence may exhibit an interleaved row programming order between odd and even nonvolatile memory blocks; (vii) perform a sequence of programming phases of descending bit significances where at least two programming phases of the sequence may have the same row programming order; (viii) perform a sequence of programming phases of descending bit significances where at least two programming phases of the sequence may differ in a level of pass voltage that may be supplied to idle nonvolatile memory rows; (ix) perform a sequence of programming phases of descending bit significances where a level of the pass voltage may decrease as a bit significance of a programming phase decreases; (x) perform a sequence of programming phases of descending bit significances to program information retrieved from a set of nonvolatile single level memory blocks to a single nonvolatile memory block; (xi) perform a sequence of programming phases of descending bit significances where each programming phase may include programming the nonvolatile memory block to a pre-erase value; and programming the nonvolatile memory block to an erase value that may be higher than the pre-erase value; (xii) perform a sequence of programming phases of descending bit significances where at least two programming phases may differ in the pre-erase value; (xiii) perform a sequence of programming phases of descending bit significances where a level of pre-erase value may decrease with a decrement of a bit significant of a programming phase; (xiv) perform a sequence of programming phases of descending bit significances where the memory controller may be configured to calculate a wear attribute of the nonvolatile memory block by associating different count weights to different programming phases that program the nonvolatile memory block to the erase value; (xv) perform a sequence of programming phases of descending bit significances where the memory controller may be configured to determine a bit significance level of the nonvolatile memory block; and start the sequence of programming phases from a programming phase that may correspond to the bit significance level of the nonvolatile memory block; (xvi) read the information from the nonvolatile memory block by a performing a sequence of read phases of descending bit significances, starting from a most significant bit programming phase and ending at a least significant bit programming phase; (xvii) perform a sequence of programming phases of descending bit significances of multiple nonvolatile memory blocks, where each nonvolatile memory block may be programmed by performing a sequence of programming phases of descending bit significances; (xviii) perform a sequence of programming phases of descending bit significances of multiple nonvolatile memory blocks, where each nonvolatile memory block may be programmed by performing a sequence of programming phases of descending bit significances, where at least two nonvolatile memory blocks belong to different integrated circuits.
In accordance with an embodiment of the invention, memory controller 620 may be configured to determine a bit significance level of the nonvolatile memory block; program the nonvolatile memory block by performing at least one programming phase; and program the nonvolatile memory block to an erase value that may be higher than the pre-erase value; where the erase value and the pre-erase value may be selected based on the bit significance level of the nonvolatile memory block.
Any of the mentioned above methods can be executed by a memory controller that can execute instructions that are stored on a computer readable medium. The computer readable medium can be a tape, a cassette, a disk, a diskette, an integrated circuit, and the like. For example, the computer readable medium can store instructions for: determining a bit significance level of a nonvolatile memory block; programming the nonvolatile memory block by performing at least one programming phase; and programming the nonvolatile memory block to an erase value that is higher than the pre-erase value; wherein the erase value and the pre-erase value are selected based on the bit significance level of the memory pages. Yet for another example, the computer readable medium can store instructions for programming information, by a memory controller, to a nonvolatile memory block by performing a sequence of programming phases of descending bit significances.
While there have been shown and described fundamental novel features of the invention as applied to several embodiments, it will be understood that various omissions, substitutions, and changes in the form, detail, and operation of the illustrated embodiments may be made by those skilled in the art without departing from the spirit and scope of the invention. Substitutions of elements from one embodiment to another are also fully intended and contemplated. The invention is defined solely with regard to the claims appended hereto, and equivalents of the recitations therein.
This application claims the benefit of priority, under 35 U.S.C. §119, of U.S. Provisional Patent Application No. 61/288,875, filed Dec. 22, 2009, titled “A System and Method To Reduce Program/Read Disturb in Flash Arrays While Enhancing Flash Management,” which is hereby incorporated in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
4430701 | Christian et al. | Feb 1984 | A |
4463375 | Macovski | Jul 1984 | A |
4584686 | Fritze | Apr 1986 | A |
4589084 | Fling et al. | May 1986 | A |
4777589 | Boettner et al. | Oct 1988 | A |
4866716 | Weng | Sep 1989 | A |
5003597 | Merkle | Mar 1991 | A |
5077737 | Leger et al. | Dec 1991 | A |
5297153 | Baggen et al. | Mar 1994 | A |
5305276 | Uenoyama | Apr 1994 | A |
5592641 | Doyle et al. | Jan 1997 | A |
5623620 | Alexis et al. | Apr 1997 | A |
5640529 | Hasbun | Jun 1997 | A |
5657332 | Auclair et al. | Aug 1997 | A |
5663901 | Harari et al. | Sep 1997 | A |
5724538 | Morris et al. | Mar 1998 | A |
5729490 | Calligaro et al. | Mar 1998 | A |
5740395 | Wells et al. | Apr 1998 | A |
5745418 | Hu et al. | Apr 1998 | A |
5778430 | Ish et al. | Jul 1998 | A |
5793774 | Usui et al. | Aug 1998 | A |
5920578 | Zook et al. | Jul 1999 | A |
5926409 | Engh et al. | Jul 1999 | A |
5933368 | Hu et al. | Aug 1999 | A |
5956268 | Lee | Sep 1999 | A |
5956473 | Hu et al. | Sep 1999 | A |
5968198 | Balachandran | Oct 1999 | A |
5982659 | Irrinki et al. | Nov 1999 | A |
6011741 | Harari et al. | Jan 2000 | A |
6016275 | Han | Jan 2000 | A |
6038634 | Ji et al. | Mar 2000 | A |
6081878 | Estakhri et al. | Jun 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 |
6272052 | Miyauchi | Aug 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 |
6675281 | Oh 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 |
6968421 | Conley | 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 |
7188228 | Chang et al. | Mar 2007 | B1 |
7191379 | Adelmann et al. | Mar 2007 | B2 |
7196946 | Chen et al. | Mar 2007 | B2 |
7203874 | Roohparvar | Apr 2007 | B2 |
7212426 | Park et al | May 2007 | B2 |
7290203 | Emma et al. | Oct 2007 | B2 |
7292365 | Knox | Nov 2007 | B2 |
7301928 | Nakabayashi et al. | Nov 2007 | B2 |
7315916 | Bennett et al. | Jan 2008 | B2 |
7388781 | Litsyn et al. | Jun 2008 | B2 |
7395404 | Gorobets et al. | Jul 2008 | B2 |
7441067 | Gorobets et al. | Oct 2008 | B2 |
7443729 | Li et al. | Oct 2008 | B2 |
7450425 | Aritome | Nov 2008 | B2 |
7454670 | Kim et al. | Nov 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 |
7610433 | Randell et al. | Oct 2009 | B2 |
7613043 | Cornwell et al. | Nov 2009 | B2 |
7619922 | Li et al. | Nov 2009 | B2 |
7697326 | Sommer et al. | Apr 2010 | B2 |
7706182 | Shalvi et al. | Apr 2010 | B2 |
7716538 | Gonzalez et al. | May 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 |
7911848 | Eun et al. | Mar 2011 | B2 |
7961797 | Yang et al. | Jun 2011 | B1 |
7975192 | Sommer et al. | Jul 2011 | B2 |
8020073 | Emma et al. | Sep 2011 | B2 |
8108590 | Chow et al. | Jan 2012 | B2 |
8122328 | Liu et al. | Feb 2012 | B2 |
8159881 | Yang | Apr 2012 | B2 |
8190961 | Yang et al. | May 2012 | B1 |
8250324 | Haas et al. | Aug 2012 | B2 |
8300823 | Bojinov et al. | Oct 2012 | B2 |
8305812 | Levy et al. | Nov 2012 | B2 |
8327246 | Weingarten et al. | Dec 2012 | B2 |
8407560 | Ordentlich et al. | Mar 2013 | B2 |
8417893 | Khmelnitsky et al. | Apr 2013 | B2 |
20010034815 | Dugan et al. | Oct 2001 | A1 |
20020063774 | Hillis et al. | May 2002 | A1 |
20020085419 | Choi et al. | Jul 2002 | A1 |
20020154769 | Petersen et al. | Oct 2002 | A1 |
20020156988 | Sekibe et al. | Oct 2002 | A1 |
20020174156 | Birru et al. | Nov 2002 | A1 |
20030014582 | Nakanishi | Jan 2003 | A1 |
20030065876 | Lasser | Apr 2003 | A1 |
20030101404 | Zhao et al. | May 2003 | A1 |
20030105620 | Bowen | Jun 2003 | A1 |
20030177300 | Jeong et al. | Sep 2003 | A1 |
20030192007 | Miller et al. | Oct 2003 | A1 |
20040015771 | Lasser et al. | Jan 2004 | A1 |
20040030971 | Shibata et al. | Feb 2004 | A1 |
20040059768 | Denk et al. | Mar 2004 | A1 |
20040080985 | Chang et al. | Apr 2004 | A1 |
20040153722 | Lee | Aug 2004 | A1 |
20040153817 | Chevallier et al. | Aug 2004 | A1 |
20040181735 | Xin | Sep 2004 | A1 |
20040203591 | Lee | Oct 2004 | A1 |
20040210706 | In et al. | Oct 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 |
20050243626 | Ronen | Nov 2005 | A1 |
20060059406 | Micheloni et al. | Mar 2006 | A1 |
20060059409 | Lee | Mar 2006 | A1 |
20060064537 | Oshima | Mar 2006 | A1 |
20060101193 | Murin | May 2006 | A1 |
20060195651 | Estakhri et al. | Aug 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 |
20060282411 | Fagin et al. | Dec 2006 | A1 |
20060284244 | Forbes et al. | Dec 2006 | A1 |
20060294312 | Walmsley | Dec 2006 | A1 |
20070025157 | Wan et al. | Feb 2007 | A1 |
20070063180 | Asano et al. | Mar 2007 | A1 |
20070081388 | Joo | Apr 2007 | A1 |
20070098069 | Gordon | May 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 |
20070140006 | Chen et al. | Jun 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 |
20070297226 | Mokhlesi | Dec 2007 | A1 |
20080010581 | Alrod et al. | Jan 2008 | A1 |
20080028014 | Hilt et al. | Jan 2008 | A1 |
20080049497 | Mo | Feb 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 |
20080137414 | Park et al. | Jun 2008 | A1 |
20080141043 | Flynn et al. | Jun 2008 | A1 |
20080148115 | Sokolov et al. | Jun 2008 | A1 |
20080158958 | Sokolov 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 |
20080201620 | Gollub | Aug 2008 | A1 |
20080209114 | Chow et al. | Aug 2008 | A1 |
20080219050 | Shalvi et al. | Sep 2008 | A1 |
20080225599 | Chae | Sep 2008 | A1 |
20080250195 | Chow et al. | Oct 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 |
20080310230 | Kim et al. | Dec 2008 | A1 |
20090024905 | Shalvi et al. | Jan 2009 | A1 |
20090027961 | Park et al. | Jan 2009 | A1 |
20090043951 | Shalvi et al. | Feb 2009 | A1 |
20090046507 | Aritome | 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 | May 2009 | A1 |
20090132755 | Radke | May 2009 | A1 |
20090144598 | Yoon et al. | Jun 2009 | A1 |
20090144600 | Perlmutter et al. | Jun 2009 | A1 |
20090150599 | Bennett | 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 |
20090282185 | Van Cauwenbergh | Nov 2009 | A1 |
20090282186 | Mokhlesi et al. | Nov 2009 | A1 |
20090287930 | Nagaraja | Nov 2009 | A1 |
20090300269 | Radke et al. | Dec 2009 | A1 |
20090323942 | Sharon et al. | Dec 2009 | A1 |
20100005270 | Jiang | Jan 2010 | A1 |
20100025811 | Bronner et al. | Feb 2010 | A1 |
20100030944 | Hinz | Feb 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 |
20100174853 | Lee 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 |
20100246265 | Moschiano et al. | Sep 2010 | A1 |
20100251066 | Radke | Sep 2010 | A1 |
20100253555 | Weingarten et al. | Oct 2010 | A1 |
20100257309 | Barsky et al. | Oct 2010 | A1 |
20100269008 | Leggette et al. | Oct 2010 | A1 |
20100293321 | Weingarten | Nov 2010 | A1 |
20100318724 | Yeh | Dec 2010 | A1 |
20110051521 | Levy et al. | Mar 2011 | A1 |
20110055461 | Steiner et al. | Mar 2011 | A1 |
20110093650 | Kwon et al. | Apr 2011 | A1 |
20110096612 | Steiner et al. | Apr 2011 | A1 |
20110099460 | Dusija et al. | Apr 2011 | A1 |
20110119562 | Steiner et al. | May 2011 | A1 |
20110153919 | Sabbag | Jun 2011 | A1 |
20110161775 | Weingarten | Jun 2011 | A1 |
20110194353 | Hwang et al. | Aug 2011 | A1 |
20110209028 | Post et al. | Aug 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 |
20120017136 | Ordentlich 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 |
20120124273 | Goss et al. | May 2012 | A1 |
20120246391 | Meir et al. | Sep 2012 | A1 |
Number | Date | Country |
---|---|---|
WO2009053963 | Apr 2009 | WO |
WO 2009053963 | Apr 2009 | WO |
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 2009/072100 A3. |
Search Report of PCT Patent Application WO 2009/053963 A3. |
Search Report of PCT Patent Application WO 2009/053962 A3. |
Search Report of PCT Patent Application WO 2009/053961 A3. |
Search Report of PCT Patent Application WO 2009/037697 A3. |
Yani Chen, Kcshab K. Parhi, “Small Area Parallel Chien Search Architectures for Long BCH Codes”, Ieee 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-II-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”, Ieee 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 | |
---|---|---|---|
20110153919 A1 | Jun 2011 | US |
Number | Date | Country | |
---|---|---|---|
61288875 | Dec 2009 | US |