US 8,068,360 B2Grant
Reading analog memory cells using built-in multi-threshold commands
Issue Date:2011-11-29
•26 Claims
•8 Drawing Sheets
Abstract
A method for data storage includes storing data in a memory that includes multi-bit analog memory cells, each of which stores at least first and second data bits by assuming one of a predefined plurality of programming levels associated with respective storage values. The memory has at least a first built-in command for reading the first data bits of the memory cells by comparing the storage values of the memory cells to a first number of first thresholds, and a second built-in command for reading the second data bits of the memory cells by comparing the storage values of the memory cells to a second number of second thresholds, such that the first number is less than the second number. After storing the data, the first data bits are read from the memory cells by executing at least the second built-in command.
Metadata
Assignee
- Anobit Technologies Ltd.
Inventor
- Micha Anholt
Application Information
Application Number:US 12/178,318
Filing Date:2008-07-23
Priority Date:2007-10-19
Art Unit:2827
Classifications
IPC:
G11C16/04
Patent Drawings (8 sheets)
Description
CROSS-REFERENCE TO RELATED APPLICATIONS
[0001] This application claims the benefit of U.S. Provisional Patent Application 60/981,113, filed Oct. 19, 2007, and U.S. Provisional Patent Application 60/989,129, filed Nov. 20, 2007, whose disclosures are incorporated herein by reference.
FIELD OF THE INVENTION
[0002] The present invention relates generally to memory devices, and particularly to methods and systems for retrieving data from multi-level analog memory cells.
BACKGROUND OF THE INVENTION
[0003] Several types of memory devices, such as Flash memories, use arrays of analog memory cells for storing data. Each analog memory cell stores a quantity of an analog value, also referred to as a storage value, such as an electrical charge or voltage. The storage value represents the information stored in the cell. In Flash memories, for example, each analog memory cell holds a certain amount of electrical charge. The range of possible storage values is typically divided into regions, each region corresponding to one or more data bit values. Data is written to an analog memory cell by writing a nominal storage value that corresponds to the desired bit or bits.
[0004] Some memory devices, which are commonly referred to as Single-Level Cell (SLC) devices, store a single bit of information in each memory cell, i.e., each memory cell can be programmed to assume two possible memory states. Higher-density devices, often referred to as Multi-Level Cell (MLC) devices, store two or more bits per memory cell, i.e., can be programmed to assume more than two possible memory states.
[0005] Flash memory devices are described, for example, by Bez et al., in “Introduction to Flash Memory,” Proceedings of the IEEE, volume 91, number 4, April, 2003, pages 489-502, which is incorporated herein by reference. Multi-level Flash cells and devices are described, for example, by Eitan et al., in “Multilevel Flash Cells and their Trade-Offs,” Proceedings of the 1996 IEEE International Electron Devices Meeting (IEDM), New York, N.Y., pages 169-172, which is incorporated herein by reference. The paper compares several kinds of multilevel Flash cells, such as common ground, DINOR, AND, NOR and NAND cells.
[0006] Eitan et al., describe another type of analog memory cell called Nitride Read Only Memory (NROM) in “Can NROM, a 2-bit, Trapping Storage NVM Cell, Give a Real Challenge to Floating Gate Cells?” Proceedings of the 1999 International Conference on Solid State Devices and Materials (SSDM), Tokyo, Japan, Sep. 21-24, 1999, pages 522-524, which is incorporated herein by reference. NROM cells are also described by Maayan et al., in “A 512 Mb NROM Flash Data Storage Memory with 8 MB/s Data Rate”, Proceedings of the 2002 IEEE International Solid-State Circuits Conference (ISSCC 2002), San Francisco, Calif., Feb. 3-7, 2002, pages 100-101, which is incorporated herein by reference. Other exemplary types of analog memory cells are Floating Gate (FG) cells, Ferroelectric RAM (FRAM) cells, magnetic RAM (MRAM) cells, Charge Trap Flash (CTF) and phase change RAM (PRAM, also referred to as Phase Change Memory—PCM) cells. FRAM, MRAM and PRAM cells are described, for example, by Kim and Koh in “Future Memory Technology including Emerging New Memories,” Proceedings of the 24th International Conference on Microelectronics (MIEL), Nis, Serbia and Montenegro, May 16-19, 2004, volume 1, pages 377-384, which is incorporated herein by reference.
[0007] Analog memory cells are commonly read by comparing their storage values to one or more read thresholds. Some known methods and systems read analog memory cells using multiple read thresholds. For example, PCT International Publication WO 2007/132457, whose disclosure is incorporated herein by reference, describes a method for operating a memory device. The method includes encoding data using an Error Correction Code (ECC) and storing the encoded data as first analog values in respective analog memory cells of the memory device. Second analog values are then read from the respective memory cells. A distortion present in the second analog values is estimated, and error correction metrics are computed responsively to the estimated distortion. The second analog values are processed using the error correction metrics in an ECC decoding process, so as to reconstruct the data. In some embodiments, the error correction metrics are computed by combining multiple instances of the second storage values, which are obtained by using respective different sets of read thresholds.
[0008] PCT International Publication WO 2008/053472, whose disclosure is incorporated herein by reference, describes a method for operating a memory. The method includes storing data, which is encoded with an ECC, in analog memory cells of the memory by writing respective analog input values selected from a set of nominal values to the analog memory cells. The stored data is read by performing multiple read operations that compare analog output values of the analog memory cells to different, respective read thresholds. At least two of the read thresholds are positioned between a pair of the nominal values that are adjacent to one another in the set of the nominal values.
[0009] The two PCT Publications cited above are assigned to the assignee of the present patent application and were published after the priority date of the present patent application.
SUMMARY OF THE INVENTION
[0010] An embodiment of the present invention provides a method for data storage, including:
[0011] storing data in a memory that includes multi-bit analog memory cells, each of which stores at least first and second data bits by assuming one of a predefined plurality of programming levels associated with respective storage values, the memory having at least a first built-in command for reading the first data bits of the memory cells by comparing the storage values of the memory cells to a first number of first thresholds, and a second built-in command for reading the second data bits of the memory cells by comparing the storage values of the memory cells to a second number of second thresholds, such that the first number is less than the second number; and
[0012] after storing the data, reading the first data bits from the memory cells by executing at least the second built-in command.
[0013] In some embodiments, reading the first data bits by executing at least the second built-in command includes reading multiple instances of the first data bits using the respective second thresholds. In an embodiment, the multiple instances of the first data bits are processed so as to adjust the first thresholds. Additionally or alternatively, the multiple instances of the first data bits are processed so as to cancel interference in the analog memory cells. Further additionally or alternatively, storing the data includes encoding the data with an Error Correction Code (ECC), and the method includes processing the multiple instances of the first data bits so as to compute soft decoding metrics for decoding the ECC.
[0014] In a disclosed embodiment, reading the first data bits by executing at least the second built-in command includes making an attempt to read the first data bits using the first built-in command, and reverting to read the first data bits using the second built-in command responsively to a failure of the attempt.
[0015] In another embodiment, each of the analog memory cells further stores a third data bit, the memory has a third built-in command for reading the third data bits of the memory cells by comparing the storage values of the memory cells to a third number of third thresholds, such that the third number is larger than the second number, and reading the first data bits includes executing both the second and the third built-in commands.
[0016] In yet another embodiment, storing the data includes writing to the memory cells nominal storage values selected from a group of possible nominal storage values corresponding to the respective programming levels, and executing at least the second built-in command includes positioning the second thresholds between a pair of the nominal storage values that are adjacent to one another in the group of the possible nominal storage values. In still another embodiment, the storage values of the memory cells that assume a given programming level are distributed over a range, and executing at least the second built-in command includes positioning at least one of the second thresholds within the range. In an embodiment, the second built-in command reads the second data bits independently of the first data bits.
[0017] There is additionally provided, in accordance with an embodiment of the present invention, a method for data storage, including:
[0018] storing data in a memory that includes multi-bit analog memory cells, each of which stores at least first and second data bits by assuming one of a predefined plurality of programming levels associated with respective storage values, the memory having at least a first built-in command for reading the first data bits of the memory cells by comparing the storage values of the memory cells to one or more first thresholds, and a second built-in command for reading the second data bits of the memory cells independently of the first data bits by comparing the storage values of the memory cells to a plurality of second thresholds; and
[0019] after storing the data, reading the first data bits from the memory cells by executing at least the second built-in command.
[0020] There is also provided, in accordance with an embodiment of the present invention, apparatus for data storage, including:
[0021] an interface, which is operative to communicate with a memory that includes multi-bit analog memory cells, each of which stores at least first and second data bits by assuming one of a predefined plurality of programming levels associated with respective storage values, the memory having at least a first built-in command for reading the first data bits of the memory cells by comparing the storage values of the memory cells to a first number of first thresholds, and a second built-in command for reading the second data bits of the memory cells by comparing the storage values of the memory cells to a second number of second thresholds, such that the first number is less than the second number; and
[0022] a processor, which is coupled to store data in the memory cells and, after storing the data, to read the first data bits from the memory cells by executing at least the second built-in command.
[0023] There is further provided, in accordance with an embodiment of the present invention, apparatus for data storage, including:
[0024] a memory including multi-bit analog memory cells, each of which stores at least first and second data bits by assuming one of a predefined plurality of programming levels associated with respective storage values, the memory having at least a first built-in command for reading the first data bits of the memory cells by comparing the storage values of the memory cells to a first number of first thresholds, and a second built-in command for reading the second data bits of the memory cells by comparing the storage values of the memory cells to a second number of second thresholds, such that the first number is less than the second number; and
[0025] a processor, which is coupled to store data in the memory cells and, after storing the data, to read the first data bits from the memory cells by executing at least the second built-in command.
[0026] There is additionally provided, in accordance with an embodiment of the present invention, apparatus for data storage, including:
[0027] an interface, which is operative to communicate with a memory that includes multi-bit analog memory cells, each of which stores at least first and second data bits by assuming one of a predefined plurality of programming levels associated with respective storage values, the memory having at least a first built-in command for reading the first data bits of the memory cells by comparing the storage values of the memory cells to one or more first thresholds, and a second built-in command for reading the second data bits of the memory cells independently of the first data bits by comparing the storage values of the memory cells to a plurality of second thresholds; and
[0028] a processor, which is coupled to store data in the memory cells and, after storing the data, to read the first data bits from the memory cells by executing at least the second built-in command.
[0029] There is also provided, in accordance with an embodiment of the present invention, apparatus for data storage, including:
[0030] a memory including multi-bit analog memory cells, each of which stores at least first and second data bits by assuming one of a predefined plurality of programming levels associated with respective storage values, the memory having at least a first built-in command for reading the first data bits of the memory cells by comparing the storage values of the memory cells to one or more first thresholds, and a second built-in command for reading the second data bits of the memory cells independently of the first data bits by comparing the storage values of the memory cells to a plurality of second thresholds; and
[0031] a processor, which is coupled to store data in the memory cells and, after storing the data, to read the first data bits from the memory cells by executing at least the second built-in command.
[0032] The present invention will be more fully understood from the following detailed description of the embodiments thereof, taken together with the drawings in which:
BRIEF DESCRIPTION OF THE DRAWINGS
[0033] FIG. 1 is a block diagram that schematically illustrates a memory system, in accordance with an embodiment of the present invention;
[0034] FIG. 2 is a graph showing storage value distributions and read thresholds in a group of multi-level analog memory cells, in accordance with an embodiment of the present invention;
[0035] FIG. 3 is a graph showing read thresholds used for reading data from multi-level analog memory cells, in accordance with an embodiment of the present invention;
[0036] FIG. 4 is a flow chart that schematically illustrates a method for reading data from multi-level analog memory cells, in accordance with an embodiment of the present invention;
[0037] FIG. 5 is a graph showing storage value distributions and read thresholds in a group of multi-level analog memory cells, in accordance with another embodiment of the present invention;
[0038] FIG. 6 is a flow chart that schematically illustrates a method for reading data from multi-level analog memory cells, in accordance with an embodiment of the present invention; and
[0039] FIGS. 7-9 are graphs showing storage value distributions and read thresholds in a group of multi-level analog memory cells, in accordance with alternative embodiments of the present invention.
DETAILED DESCRIPTION OF EMBODIMENTS
Overview
[0040] In many MLC device configurations, different bits are read from the memory cells using respective, different sets of read thresholds. For example, in an eight-level MLC configuration, each memory cell stores three bits, which are referred to as a Least Significant Bit (LSB), a Central Significance Bit (CSB) and a Most Significant Bit (MSB). In a common reading scheme, the LSB is read using a single threshold, the CSB is read using a set of two thresholds, and the MSB is read using a different set that includes four thresholds.
[0041] Some MLC devices support composite built-in read commands for reading a certain bit from a group of memory cells. For example, in the 3 bits/cell configuration described above, the memory device may support three built-in commands (e.g., “read the LSBs from the group of cells X,” “read the CSBs from the group of cells X,” and “read the MSBs from the group of cells X,”). Typically, the threshold values to be used by the memory device are specified in the command. In response to receiving one of these commands, the memory device automatically sets the appropriate read thresholds for reading the requested bit, performs the appropriate threshold comparison operations and outputs the read results.
[0042] When using such built-in commands, the entire operation sequence for reading a given bit (which often involves multiple read operations that use multiple thresholds) is triggered by a single instruction. Thus, the use of built-in commands reduces the memory access overhead and the communication throughput to and from the memory device, in comparison with single-threshold read commands.
[0043] In various situations and applications, there is a need to re-read a given bit in a group of memory cells multiple times using multiple different thresholds. Reading a given bit using different thresholds may be carried out, for example, in order to adjust or optimize the read threshold values, in order to estimate and cancel interference and/or in order to compute soft metrics for decoding an Error Correction Code (ECC) that encodes the data. Embodiments of the present invention that are described hereinbelow provide highly-efficient methods and systems for re-reading analog memory cells using different thresholds, by utilizing built-in multiple-threshold commands supported by the memory device.
[0044] In some embodiments, a Memory Signal Processor (MSP) stores data in a memory device, which comprises an array of multi-bit analog memory cells. The memory device supports one or more built-in read commands for reading respective data bits from the cells. Each built-in read command uses a respective set of one or more read thresholds.
[0045] In order to read a given bit using multiple thresholds, the MSP sends the memory device a built-in read command specifying the desired multiple thresholds. The memory device executes the command, and thus re-reads the given bit using the desired multiple thresholds. Using this technique, the MSP re-reads a given bit multiple times by issuing only a single instruction, rather than using multiple single-threshold commands. As a result, the number of memory access operations performed by the MSP and the data throughput over the interface between the memory device and the MSP are reduced considerably. Typically, the re-reading functionality is transparent to the memory device and may be applied to legacy memory devices.
[0046] In some embodiments, the command issued for re-reading a given bit has a number of thresholds that is higher than the number of thresholds normally used for reading this bit. For example, the memory device typically comprises a built-in command that is predefined for reading the LSB using a single threshold. When using the disclosed methods, the LSB can be read four times from a group of cells by (1) issuing a built-in read command that is predefined for reading the MSB, and (2) specifying the four desired re-reading thresholds in the command.
[0047] In some embodiments, the MSP initially reads a given bit using the built-in command that is predefined for reading this bit, and reverts to a built-in command having a higher number of thresholds if the initial reading attempt fails. In some embodiments, the multiple thresholds used for re-reading are positioned between adjacent programming levels. Alternatively, one or more of the thresholds can be positioned within a storage value interval that is occupied by a programming level. This sort of threshold setting is useful, for example, for obtaining statistical information regarding the storage value distribution.
System Description
[0048] FIG. 1 is a block diagram that schematically illustrates a memory system 20, in accordance with an embodiment of the present invention. System 20 can be used in various host systems and devices, such as in computing devices, cellular phones or other communication terminals, removable memory modules (“disk-on-key” devices), Solid State Disks (SSD), digital cameras, music and other media players and/or any other system or device in which data is stored and retrieved.
[0049] System 20 comprises a memory device 24, which stores data in a memory cell array 28. The memory cell array comprises multiple analog memory cells 32. In the context of the present patent application and in the claims, the term “analog memory cell” is used to describe any memory cell that holds a continuous, analog value of a physical parameter, such as an electrical voltage or charge. Array 28 may comprise analog memory cells of any kind, such as, for example, NAND, NOR and CTF Flash cells, PCM, NROM, FRAM, MRAM and DRAM cells. Memory cells 32 comprise Multi-Level Cells (MLC, also referred to as multi-bit cells), each storing multiple data bits.
[0050] The charge levels stored in the cells and/or the analog voltages or currents written into and read out of the cells are referred to herein collectively as analog values or storage values. Although the embodiments described herein mainly address threshold voltages, the methods and systems described herein may be used with any other suitable kind of storage values.
[0051] System 20 stores data in the analog memory cells by programming the cells to assume respective memory states, which are also referred to as programming levels. The programming levels are selected from a finite set of possible levels, and each level corresponds to a certain nominal storage value. For example, a 2 bit/cell MLC can be programmed to assume one of four possible programming levels by writing one of four possible nominal storage values to the cell.
[0052] Memory device 24 comprises a reading/writing (R/W) unit 36, which converts data for storage in the memory device to storage values and writes them into memory cells 32. In alternative embodiments, the R/W unit does not perform the conversion, but is provided with voltage samples, i.e., with the storage values for storage in the cells. The R/W unit typically (although not necessarily) programs the cells using an iterative Program and Verify (P&V) process, as is known in the art. When reading data out of array 28, R/W unit 36 converts the storage values of memory cells 32 into digital samples having a resolution of one or more bits. Data is typically written to and read from the memory cells in groups that are referred to as pages. Memory device 24 comprises one or more page buffers 38, which are used for caching data pages during data storage and retrieval.
[0053] The storage and retrieval of data in and out of memory device 24 is performed by a Memory Signal Processor (MSP) 40. MSP 40 comprises an interface 44 for communicating with memory device 24, and a signal processing unit 48, which processes the data that is written into and read from device 24. In some embodiments, unit 48 produces the storage values for storing in the memory cells and provides these values to R/W unit 36. Alternatively, unit 48 provides the data for storage, and the conversion to storage values is carried out by the R/W unit internally to the memory device. In some embodiments, unit 48 encodes the data for storage using an Error Correction Code (ECC) or Error Detection Code (EDC), and decodes the ECC or EDC of the data retrieved from the memory.
[0054] MSP 40 communicates with a host 52, for accepting data for storage in the memory device and for outputting data retrieved from the memory device. MSP 40, and in particular unit 48, may be implemented in hardware. Alternatively, MSP 40 may comprise a microprocessor that runs suitable software, or a combination of hardware and software elements.
[0055] The configuration of FIG. 1 is an exemplary system configuration, which is shown purely for the sake of conceptual clarity. Any other suitable memory system configuration can also be used. Elements that are not necessary for understanding the principles of the present invention, such as various interfaces, addressing circuits, timing and sequencing circuits and debugging circuits, have been omitted from the figure for clarity.
[0056] In the exemplary system configuration shown in FIG. 1 , memory device 24 and MSP 40 are implemented as two separate Integrated Circuits (ICs). In alternative embodiments, however, the memory device and MSP may be integrated on separate semiconductor dies in a single Multi-Chip Package (MCP) or System on Chip (SoC). Further alternatively, some or all of the MSP circuitry may reside on the same die on which the memory array is disposed. Further alternatively, some or all of the functionality of MSP 40 can be implemented in software and carried out by a processor or other element of the host system, or by a suitable memory controller. In some implementations, a single MSP 40 may be connected to multiple memory devices 24. In yet another embodiment, some or all of the MSP functionality may be carried out by a separate unit, referred to as a memory extension, which acts as a slave of memory device 24.
[0057] Typically, the MSP (or any other controller or processor that carries out some or all of the methods described herein) comprises a general-purpose processor, which is programmed in software to carry out the functions described herein. The software may be downloaded to the processor in electronic form, over a network, for example, or it may, alternatively or additionally, be provided and/or stored on tangible media, such as magnetic, optical, or electronic memory.
[0058] In a typical configuration, memory cells 32 of array 28 are arranged in a grid having multiple rows and columns, commonly referred to as word lines and bit lines, respectively. The array is typically partitioned into multiple pages, i.e., groups of memory cells that are programmed and read simultaneously. Word lines are typically erased in blocks, referred to as erasure blocks, which are erased simultaneously.
[0059] The storage values read from memory cells 32 often vary from the nominal values, such as because of programming inaccuracies, reading inaccuracies and various distortion mechanisms. Thus, the storage values of the cells in a given programming level are distributed over a certain range in accordance with a certain statistical distribution. Typically, R/W unit 36 reads data from cells 32 by comparing the storage values of the cells to one or more read thresholds, in order to determine the programming level assumed by each cell. Such read operations are applied simultaneously to a group of memory cells within a certain word line.
[0060] Memory cells 32 comprise Multi-Level Cells (MLC), with each cell 32 storing two or more bits of data. For N bits/cell memory cells, each programming level represents a certain combination of N bit values. Determining the programming level assumed by a given cell is therefore equivalent to decoding the N data bits stored in the cell.
[0061] FIG. 2 is a graph showing storage value distributions and read thresholds in a group of multi-level analog memory cells 32, in accordance with an embodiment of the present invention. The example of FIG. 2 refers to an array of eight-level multi-level cells, with each cell storing three bits of data. The eight programming levels are denoted L1 . . . L8, and each level represents a unique combination of three bit values. For example, as marked in the figure, level L1 represents “111” data, level L2 represents “110” data, etc. In the notation used throughout this patent application, the left-most bit in the triplet is referred to as BIT1, the next bit is referred to as BIT2, and so on.
[0062] The storage values in each programming level are distributed in accordance with a certain statistical distribution 60. In some cases, such as when the level of distortion in the cells is particularly high, adjacent distributions 60 may overlap one another. R/W unit reads the data from the memory cells by comparing their storage values to a set of read thresholds 64A . . . 64G.
[0063] Although the description that follows refers mainly to the eight-level cell configuration of FIG. 2 , the methods and systems described herein can be used with any other suitable kind of memory cells (e.g., four-level or sixteen-level cells), with any other suitable mapping of bit combinations to programming levels, and with any other suitable threshold arrangement.
Built-In Multi-Threshold Read Commands
[0064] In some embodiments, R/W unit 36 reads each bit of memory cells 32 (e.g., BIT1, BIT2 and BIT3 in FIG. 2 ) using a certain subset of the read thresholds. In the configuration of FIG. 2 , for example, BIT1 is read by comparing the storage values to threshold 64D. As can be seen in the figure, all programming levels whose storage values are lower than threshold 64D have BIT1=“1”, and all programming levels whose storage values are higher than this threshold have BIT1=“0”. BIT2 is read by comparing the storage values of the cells to two thresholds 64B and 64F. Storage values falling between the two thresholds indicate that BIT2=“0”, and storage values falling below threshold 64B or above threshold 64F indicate that BIT2=“1”. Similarly, BIT3 is read by comparing the storage values of the cells to four read thresholds 64A, 64C, 64E and 64G.
[0065] Some memory devices support built-in read commands for retrieving given bits from a group of memory cells. In such memory devices, the R/W unit automatically sets the appropriate read thresholds for reading the requested bit, performs the appropriate threshold comparison operations, processes the comparison results (interim read results) to determine the bit values of the cells, and sends the bit values (final read results) to the MSP or controller.
[0066] For example, in the configuration of FIGS. 1 and 2 , memory device 24 supports three built-in read commands—a first command for reading BIT1 from a group of memory cells, a second command for reading BIT2 from a group of memory cells, and a third command for reading BIT3 from a group of cells. In order to retrieve a certain bit from a certain group of memory cells, the MSP (or other controller) sends one of these commands to memory device 24. In response to receiving the request, R/W unit 36 in memory device 24 sets the (one or more) thresholds associated with the requested bit, performs the appropriate comparison operations, processes the interim read results of each cell, and returns the final read results to the MSP. In the present example, each built-in command reads a certain bit (e.g., BIT1, BIT2 or BIT3) independently of other bits of the memory cells.
[0067] The use of such built-in read commands is advantageous over simpler commands that perform only a single threshold comparison since it (1) reduces the number of memory device access operations and (2) reduces the amount of data transferred from the memory device to the MSP considerably. For example, reading BIT3 from a group of 8192 cells using single-threshold read commands would cause 4.8192=32768 interim read results to be transferred to the MSP. The MSP would then process these 32768 results (four single-threshold read results for every cell), to produce the requested 8192 final read results. Using built-in multi-threshold read commands, on the other hand, the 32768 interim read results are obtained and processed internally to the memory device, and only the final 8192 read results are transferred to the MSP. Using single-threshold read commands, the memory device is accessed seven times. Using the built-in multi-threshold commands, on the other hand, the memory device is accessed only once.
Efficient Multi-Threshold Reading Schemes Using Built-In Read Commands
[0068] In various situations and applications, MSP 40 performs multiple re-read operations of a given bit in a group of memory cells, using multiple different thresholds. Embodiments of the present invention, which are explained and demonstrated below, provide methods and systems that perform such re-read operations efficiently, by utilizing the built-in multiple-threshold commands supported by the memory device.
[0069] MSP 40 may re-read a given bit (i.e., read multiple instances of the given bit) with different thresholds for various purposes. For example, distributions 60 may drift, widen or otherwise change over time, such as because of aging or interference. When distributions 60 change, the optimal positions of the read thresholds often change, as well. In some embodiments, the MSP re-reads a given bit using multiple thresholds, and processes the multiple read results of this bit to optimize the threshold positions. Such techniques are described, for example, in PCT International Publications WO 2007/132457 and WO 2008/053472, cited above.
[0070] As another example, the MSP may re-read a given bit in a group of memory cells with different thresholds in order to cancel cross-coupling interference from other cells. In some embodiments, the MSP selects the least-interfered read results on a cell-by-cell basis. Some cross-coupling cancellation methods, which use multiple read results that are obtained using multiple read thresholds, are described in PCT International Publications WO 2007/132457 and WO 2008/053472, cited above.
[0071] As yet another example, the MSP may employ an ECC scheme that uses soft decoding metrics. In these embodiments, the MSP computes soft metrics of a given bit in a group of memory cells, and decodes the ECC using the soft metrics. The MSP computes the soft metrics by re-reading the bits in question using multiple different thresholds, and processes the multiple read results to produce the metrics. Soft metric computation techniques of this sort are described, for example, in PCT International Publications WO 2007/132457 and WO 2008/053472, cited above.
[0072] FIG. 3 is a graph showing read thresholds 68 used for reading data from multi-level analog memory cells 32, in accordance with an embodiment of the present invention. In the example of FIG. 3 , system 20 performs re-read operations using a set of seven thresholds 68, which are positioned between programming levels L4 and L5. This scenario may occur, for example, when the MSP attempts to optimize the position of the read threshold that differentiates between levels L4 and L5, or when the MSP computes soft ECC decoding metrics.
[0073] In some embodiments, the MSP instructs R/W unit 36 to perform the seven re-read operations using the built-in multi-threshold read operations supported by the memory device. In the present example, the MSP sends three read commands to the memory device:
-
- [0074] A BIT1 read command specifying a single threshold (denoted “BIT1 TH” in the figure).
- [0075] A BIT2 read command specifying two thresholds (denoted “BIT2 THRESHOLDS” in the figure), one threshold on either side of the BIT1 threshold.
- [0076] A BIT3 read command specifying four thresholds (denoted “BIT3 THRESHOLDS” in the figure), interleaved among the BIT1 and BIT2 thresholds.
[0077] By executing these three multi-threshold read commands, the R/W unit compares the storage values of the cells to seven thresholds and transfers three sets of read results to the MSP. The read results can be used by the MSP for adjusting threshold positions, for performing interference cancellation, for computing soft metrics or for any other purpose.
[0078] In the present example, the built-in commands supported by the memory device are predefined to read BIT1 using a single threshold, BIT2 using two thresholds and BIT3 using four thresholds. In the process described above, however, BIT1 is read using the built-in commands that are predefined for reading BIT2 and BIT3. These commands have a higher number of thresholds than the number that is predefined for reading BIT1.
[0079] In some embodiments, the values of the thresholds to be used are specified as part of the built-in read command. Alternatively, the values can be provided to the memory device in a separate command that is sent adjacently to the built-in read command, or using any other suitable means.
[0080] FIG. 4 is a flow chart that schematically illustrates the method described above for reading data from multi-level analog memory cells, in accordance with an embodiment of the present invention. The method begins with system 20 storing data in multi-level analog memory cells 32 of array 28, at a storage step 70. In the present example, cells 32 comprise eight-level (3 bits/cell) MLC, as shown in FIG. 2 .
[0081] At some point in time, MSP 40 initiates a process of reading BIT1 from a group of memory cells 32 using multiple thresholds. The process may be initiated in order to adjust read threshold positions, in order to cancel cross-coupling interference, in order to compute soft metrics, or for any other reason.
[0082] The MSP sets the values of the read thresholds in the BIT1, BIT2 and BIT3 built-in read commands, at a threshold setting step 74. The MSP positions the seven thresholds to fall between programming levels L4 and L5, as shown in FIG. 3 above. The MSP sends the three commands to the memory device.
[0083] R/W unit 36 in memory device 24 executes the three commands. The R/W unit executes the BIT1 command at a first bit reading step 78, the BIT2 command at a second bit reading step 82, and the BIT3 command at a third bit reading step 86. The BIT1, BIT2 and BIT3 commands use one, two and four thresholds, respectively. Since, as noted above, each read command reads a given bit independently of the other bits, steps 78-86 can be executed in any order.
[0084] Device 24 sends the BIT1 read results produced by the three built-in read operations (which comprise results originating from seven thresholds) to the MSP, at a result reporting step 90. The MSP applies the desired processing (e.g., threshold adjustment, cross-coupling interference cancellation or soft metric computation) to the returned read results.
Increasing the Number of Thresholds in Response to Decoding Failure
[0085] In some embodiments, the MSP initially reads a given bit using the built-in command that is originally predefined for reading this bit, and reverts to a command having a higher number of thresholds if the initial reading attempt fails. The command that the MSP reverts to comprises a command that is originally predefined for reading another bit of the memory cells, and is referred to herein as an alternative command.
[0086] The MSP may use any suitable criteria for determining read failures, such as a failure to decode an ECC that decodes the retrieved data, an error indication of an EDC, an intolerable error level in the reconstructed data or a distortion level that exceeds a certain tolerable level.
[0087] In some embodiments, the MSP sets the thresholds of the alternative command to fall in the vicinity of the threshold used in the initial unsuccessful attempt. For example, the MSP may apply the method of FIGS. 3 and 4 above in a gradual manner. In this implementation, the MSP first reads BIT1 using the single “BIT1 TH” threshold. If the initial attempt fails, the MSP re-reads BIT1 using the BIT2 read command, specifying the two “BIT2 THRESHOLDS” shown in FIG. 3 . If this attempt fails too, the MSP re-reads BIT1 once again using the four BIT3 thresholds. At all stages, the read thresholds are positioned between programming levels L4 and L5, as shown in FIG. 3 .
[0088] In some embodiments, the MSP comprises logic (in hardware or software) for converting the read results of one built-in command to the format of another built-in command, so that the read results can be interpreted correctly. For example, when reading BIT1 using the BIT2 built-in command, the MSP may comprise logic for separating the read results of the BIT2 read command into two single-bit read results having two different thresholds, so as to appear to subsequent processes as read results of two BIT1 read commands.
[0089] As another example, the MSP may comprise logic that generates, in response to the read results of the BIT2 read command, a BIT1-equivalent stream having different thresholds for different cells. As noted above, using different thresholds for different cells is useful, for example, in interference cancellation processes. Alternatively, the MSP may carry out interference cancellation computations directly on the read results of the BIT1 and BIT2 built-in commands.
[0090] In some embodiments, one or more of the thresholds in the alternative command are set to fall in the vicinity of the initial threshold, while one or more other thresholds are set to fall in any other suitable region of the storage value axis. Unlike the previous example, in which the number of thresholds was increased to improve the reading performance of BIT1, in the present embodiment the added threshold or thresholds are used to sample the storage value distribution at an additional point. The additional thresholds may be positioned between programming levels and thus assist in subsequently reading other bits from the memory cells. Alternatively, the additional thresholds may be positioned within the distribution of a given programming level, and therefore improve the statistical information of the MSP regarding this distribution.
[0091] FIG. 5 is a graph showing storage value distributions and read thresholds in a group of multi-level analog memory cells, in accordance with another embodiment of the present invention. In the present example, the MSP initially attempts to read BIT1 using the BIT1 read command. The initial read attempt uses an initial threshold 94. As can be seen in the figure, the initial threshold is not positioned properly, since it falls inside the distribution of level L5 instead of between levels L4 and L5. Therefore, this initial attempt is likely to fail.
[0092] Upon a failure of the initial attempt, the MSP makes a second attempt to read BIT1. In the second attempt, the MSP instructs the R/W unit to use the BIT2 read commands that compares the storage values of the cells to two thresholds 98. In the example of FIG. 5 , one of thresholds 98 is set between levels L4 and L5 by correcting the non-optimal position of threshold 94. The second threshold 98 is set to the middle of the distribution of level L6. The MSP may use the read results corresponding to the second threshold for constructing histograms or other statistical functions of the storage values of the cells, for obtaining better resolution in future read operations, or for any other purpose.
[0093] FIG. 6 is a flow chart that schematically illustrates a method for reading data from multi-level analog memory cells 32, in accordance with an embodiment of the present invention. The method demonstrates the features of (1) reading a given bit using a built-in command that is originally predefined for reading another bit, and (2) reverting to this built-in command only upon a failure in the default reading process.
[0094] The method of FIG. 6 begins with system 20 reading BIT1 from a group of memory cells 32 using a single threshold, at an initial reading step 100. Referring to FIG. 5 above, BIT1 is initially read using threshold 94 by executing the built-in BIT1 read command.
[0095] The MSP then checks whether the initial read attempt was successful, at a success checking step 104. As noted above, the success criterion may depend on successful ECC or EDC decoding, on distortion measurement or on any other factor. If the initial attempt was successful, the MSP reconstructs the read data, outputs the result and terminates, at a termination step 108.
[0096] Otherwise, i.e., if the initial read attempt failed, the system re-reads BIT1 using the built-in BIT2 read command. The MSP specifies two thresholds for this command, at a threshold setting step 112. The two thresholds comprise (1) a corrected or adjusted threshold for reading BIT1, and (2) a second threshold positioned within another distribution. The first threshold is used for re-reading BIT1, while the second threshold is used for improving the statistical knowledge of the MSP regarding the storage value distributions in the memory cells. Referring to FIG. 5 , the built-in BIT2 read command uses thresholds 98.
[0097] The MSP sends the command to the memory device, and R/W unit 36 executes the command, at an execution step 116. The R/W unit sends the read results to the MSP. The MSP reconstructs the data, outputs the result and terminates at step 108.
Additional Examples
[0098] The principles of the present invention can be used to define and execute various sequences of read operations that use the built-in read commands supported by the memory device. Such read sequences may improve the reading speed and/or quality under different scenarios.
[0099] FIG. 7 is a graph showing storage value distributions and read thresholds in a group of multi-level analog memory cells, in accordance with yet another embodiment of the present invention. In the present example, the MSP initially reads BIT1 using a single threshold 120, by sending the built-in BIT1 read command to the memory device. As can be seen in the figure, threshold 120 is positioned incorrectly, and therefore the initial read attempt is likely to fail. In a second read operation, the MSP reads BIT2 using the built-in BIT2 read command, which uses two thresholds 124. In this case too, thresholds 124 are positioned incorrectly and the read attempt fails.
[0100] In response to the two failures, the MSP makes a third attempt to read both BIT1 and BIT2 by issuing a single BIT3 read command, which uses four thresholds 128. Thresholds 128 are positioned so that the results of the BIT3 command, when combined with the results of the failed BIT1 and BIT2 commands, enable successful decoding of BIT1 and BIT2. This scheme is thus able to decode BIT1 and BIT2 after a failure by issuing only a single additional read command. In comparison with known methods, this scheme provides smaller read latency and less communication throughput between the MSP and the memory device.
[0101] FIG. 8 is a graph showing storage value distributions and read thresholds in a group of multi-level analog memory cells, in accordance with another embodiment of the present invention. The example of FIG. 8 demonstrates a scenario in which BIT1 and BIT2 are read successfully using the respective predefined commands. Reading of BIT3, on the other hand, fails. The single threshold used for reading BIT1 is denoted “I” in the figure. The two thresholds used for reading BIT2 are denoted “II”, and the four thresholds used for reading BIT3 are denoted “III”. The failure in reading BIT3 in this example is caused by the left-most threshold of the BIT3 read command, i.e., the “III” threshold between levels L1 and L2.
[0102] In order to adjust this ill-positioned threshold and successfully read BIT3, the MSP carries out a fourth read attempt. The MSP sends another BIT3 read command, this time with four thresholds denoted “IV” in the figure. Two thresholds of the new command are positioned around the failed threshold. Thus, the thresholds of the BIT3 read commands can be adjusted using the additional information obtained by the fourth read attempt.
[0103] FIG. 9 is a graph showing storage value distributions and read thresholds in a group of multi-level analog memory cells, in accordance with yet another embodiment of the present invention. The example of FIG. 9 shows a scenario in which the MSP reads BIT1 . . . BIT3 using a sequence of four read commands. The first command comprises a single-threshold command with a threshold denoted “I”. The second command comprises a dual-threshold command with thresholds denoted “II”. The third command comprises a four-threshold command with thresholds denoted “III”. The fourth command comprises another four-threshold command with thresholds denoted “IV”.
[0104] In this example, it is known a-priori that the left-most threshold used for reading BIT3 (the threshold between levels L1 and L2) is ill-positioned or unknown. Consequently, the entire read sequence is designed a-priori to provide additional resolution in the vicinity of this threshold. The combined results of the four read attempts enable successful decoding of BIT1 . . . BIT3, regardless of the actual optimal position of the left-most threshold.
[0105] Although the embodiments described herein mainly address read operations in solid-state memory devices, the principles of the present invention can also be used for storing and retrieving data in Hard Disk Drives (HDD) and other data storage media and devices.
[0106] It will thus be appreciated that the embodiments described above are cited by way of example, and that the present invention is not limited to what has been particularly shown and described hereinabove. Rather, the scope of the present invention includes both combinations and sub-combinations of the various features described hereinabove, as well as variations and modifications thereof which would occur to persons skilled in the art upon reading the foregoing description and which are not disclosed in the prior art.
Claims
The invention claimed is:
1. A method for data storage, comprising:
storing data in a memory that includes multi-bit analog memory cells, each of which stores at least first and second data bits by assuming one of a predefined plurality of programming levels associated with respective storage values, the memory having at least a first built-in command for reading the first data bits of the memory cells by comparing the storage values of the memory cells to a first number of first thresholds, and a second built-in command for reading the second data bits of the memory cells by comparing the storage values of the memory cells to a second number of second thresholds, such that the first number is less than the second number; and
after storing the data, reading the first data bits from the memory cells by executing at least the second built-in command,
wherein reading the first data bits by executing at least the second built-in command comprises reading multiple instances of the first data bits using the respective second thresholds.
2. The method according to claim 1, and comprising processing the multiple instances of the first data bits so as to adjust the first thresholds.
3. The method according to claim 1, and comprising processing the multiple instances of the first data bits so as to cancel interference in the analog memory cells.
4. The method according to claim 1, wherein storing the data comprises encoding the data with an Error Correction Code (ECC), and comprising processing the multiple instances of the first data bits so as to compute soft decoding metrics for decoding the ECC.
5. A method for data storage, comprising:
storing data in a memory that includes multi-bit analog memory cells, each of which stores at least first and second data bits by assuming one of a predefined plurality of programming levels associated with respective storage values, the memory having at least a first built-in command for reading the first data bits of the memory cells by comparing the storage values of the memory cells to a first number of first thresholds, and a second built-in command for reading the second data bits of the memory cells by comparing the storage values of the memory cells to a second number of second thresholds, such that the first number is less than the second number; and
after storing the data, reading the first data bits from the memory cells by executing at least the second built-in command,
wherein reading the first data bits by executing at least the second built-in command comprises making an attempt to read the first data bits using the first built-in command, and reverting to read the first data bits using the second built-in command responsively to a failure of the attempt.
6. The method according to claim 1, wherein each of the analog memory cells further stores a third data bit, wherein the memory has a third built-in command for reading the third data bits of the memory cells by comparing the storage values of the memory cells to a third number of third thresholds, such that the third number is larger than the second number, and wherein reading the first data bits comprises executing both the second and the third built-in commands.
7. The method according to claim 1, wherein storing the data comprises writing to the memory cells nominal storage values selected from a group of possible nominal storage values corresponding to the respective programming levels, and wherein executing at least the second built-in command comprises positioning the second thresholds between a pair of the nominal storage values that are adjacent to one another in the group of the possible nominal storage values.
8. The method according to claim 1, wherein the storage values of the memory cells that assume a given programming level are distributed over a range, and wherein executing at least the second built-in command comprises positioning at least one of the second thresholds within the range.
9. The method according to claim 1, wherein the second built-in command reads the second data bits independently of the first data bits.
10. A method for data storage, comprising:
storing data in a memory that includes multi-bit analog memory cells, each of which stores at least first and second data bits by assuming one of a predefined plurality of programming levels associated with respective storage values, the memory having at least a first built-in command for reading the first data bits of the memory cells by comparing the storage values of the memory cells to one or more first thresholds, and a second built-in command for reading the second data bits of the memory cells independently of the first data bits by comparing the storage values of the memory cells to a plurality of second thresholds; and
after storing the data, reading the first data bits from the memory cells by executing at least the second built-in command,
wherein reading the first data bits by executing at least the second built-in command comprises reading multiple instances of the first data bits using the respective second thresholds.
11. Apparatus for data storage, comprising:
an interface, which is operative to communicate with a memory that includes multi-bit analog memory cells, each of which stores at least first and second data bits by assuming one of a predefined plurality of programming levels associated with respective storage values, the memory having at least a first built-in command for reading the first data bits of the memory cells by comparing the storage values of the memory cells to a first number of first thresholds, and a second built-in command for reading the second data bits of the memory cells by comparing the storage values of the memory cells to a second number of second thresholds, such that the first number is less than the second number; and
a processor, which is coupled to store data in the memory cells and, after storing the data, to read the first data bits from the memory cells by executing at least the second built-in command,
wherein the processor is coupled to read multiple instances of the first data bits using the respective second thresholds by executing at least the second built-in command.
12. The apparatus according to claim 11, wherein the processor is coupled to process the multiple instances of the first data bits so as to adjust the first thresholds.
13. The apparatus according to claim 11, wherein the processor is coupled to process the multiple instances of the first data bits so as to cancel interference in the analog memory cells.
14. The apparatus according to claim 11, wherein the processor is coupled to encode the stored data with an Error Correction Code (ECC), and to process the multiple instances of the first data bits so as to compute soft decoding metrics for decoding the ECC.
15. Apparatus for data storage, comprising:
an interface, which is operative to communicate with a memory that includes multi-bit analog memory cells, each of which stores at least first and second data bits by assuming one of a predefined plurality of programming levels associated with respective storage values, the memory having at least a first built-in command for reading the first data bits of the memory cells by comparing the storage values of the memory cells to a first number of first thresholds, and a second built-in command for reading the second data bits of the memory cells by comparing the storage values of the memory cells to a second number of second thresholds, such that the first number is less than the second number; and
a processor, which is coupled to store data in the memory cells and, after storing the data, to read the first data bits from the memory cells by executing at least the second built-in command,
wherein the processor is coupled to make an attempt to read the first data bits using the first built-in command, and to revert to read the first data bits using the second built-in command responsively to a failure of the attempt.
16. The apparatus according to claim 11, wherein each of the analog memory cells further stores a third data bit, wherein the memory has a third built-in command for reading the third data bits of the memory cells by comparing the storage values of the memory cells to a third number of third thresholds, such that the third number is larger than the second number, and wherein the processor is coupled to read the first data bits by executing both the second and the third built-in commands.
17. The apparatus according to claim 11, wherein the processor is coupled to store the data by writing to the memory cells nominal storage values selected from a group of possible nominal storage values corresponding to the respective programming levels, and to position the second thresholds, which are used in executing the second built-in command, between a pair of the nominal storage values that are adjacent to one another in the group of the possible nominal storage values.
18. The apparatus according to claim 11, wherein the storage values of the memory cells that assume a given programming level are distributed over a range, and wherein the processor is coupled to position at least one of the second thresholds, which are used in executing the second built-in command, within the range.
19. The apparatus according to claim 11, wherein the second built-in command reads the second data bits independently of the first data bits.
20. Apparatus for data storage, comprising:
a memory comprising multi-bit analog memory cells, each of which stores at least first and second data bits by assuming one of a predefined plurality of programming levels associated with respective storage values, the memory having at least a first built-in command for reading the first data bits of the memory cells by comparing the storage values of the memory cells to a first number of first thresholds, and a second built-in command for reading the second data bits of the memory cells by comparing the storage values of the memory cells to a second number of second thresholds, such that the first number is less than the second number; and
a processor, which is coupled to store data in the memory cells and, after storing the data, to read the first data bits from the memory cells by executing at least the second built-in command,
wherein the processor is coupled to read multiple instances of the first data bits using the respective second thresholds by executing at least the second built-in command.
21. Apparatus for data storage, comprising:
an interface, which is operative to communicate with a memory that includes multi-bit analog memory cells, each of which stores at least first and second data bits by assuming one of a predefined plurality of programming levels associated with respective storage values, the memory having at least a first built-in command for reading the first data bits of the memory cells by comparing the storage values of the memory cells to one or more first thresholds, and a second built-in command for reading the second data bits of the memory cells independently of the first data bits by comparing the storage values of the memory cells to a plurality of second thresholds; and
a processor, which is coupled to store data in the memory cells and, after storing the data, to read the first data bits from the memory cells by executing at least the second built-in command,
wherein the processor is coupled to read multiple instances of the first data bits using the respective second thresholds by executing at least the second built-in command.
22. Apparatus for data storage, comprising:
a memory comprising multi-bit analog memory cells, each of which stores at least first and second data bits by assuming one of a predefined plurality of programming levels associated with respective storage values, the memory having at least a first built-in command for reading the first data bits of the memory cells by comparing the storage values of the memory cells to one or more first thresholds, and a second built-in command for reading the second data bits of the memory cells independently of the first data bits by comparing the storage values of the memory cells to a plurality of second thresholds; and
a processor, which is coupled to store data in the memory cells and, after storing the data, to read the first data bits from the memory cells by executing at least the second built-in command,
wherein the processor is coupled to read multiple instances of the first data bits using the respective second thresholds by executing at least the second built-in command.
23. A method for data storage, comprising:
storing data in a memory that includes analog memory cells, each of which stores one or more data bits by assuming one of a predefined plurality of programming levels associated with respective storage values, such that the data is readable from the memory cells by comparing the storage values to a first number of thresholds; and
after storing the data, issuing to the memory a single read command, which causes the memory to compare the storage values to a second number of thresholds, larger than the first number,
wherein issuing the single read command comprises causing the memory to read multiple instances of each of the data bits.
24. The method according to claim 23, wherein storing the data comprises encoding the data with an Error Correction Code (ECC), and comprising processing the read multiple instances of the data bits so as to compute soft decoding metrics for decoding the ECC.
25. Apparatus for data storage, comprising:
an interface, which is operative to communicate with a memory that includes analog memory cells, each of which stores one or more data bits by assuming one of a predefined plurality of programming levels associated with respective storage values, such that the data is readable from the memory cells by comparing the storage values to a first number of thresholds; and
a processor, which is configured to store data in the memory cells, and, after storing the data, to issue to the memory a single read command, which causes the memory to compare the storage values to a second number of thresholds, larger than the first number,
wherein the single read command causes the memory to read multiple instances of each of the data bits.
26. The apparatus according to claim 25, wherein the processor is configured to encode the stored data with an Error Correction Code (ECC), and to process the read multiple instances of the data bits so as to compute soft decoding metrics for decoding the ECC.
Patent Citations (462)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4556961(A) | 1985-12-01 | Iwahashi et al. | Applicant |
| US4558431(A) | 1985-12-01 | Satoh | Applicant |
| US4661929(A) | 1987-04-01 | Aoki et al. | Applicant |
| US4768171(A) | 1988-08-01 | Tada | Applicant |
| US4811285(A) | 1989-03-01 | Walker et al. | Applicant |
| US4899342(A) | 1990-02-01 | Potter et al. | Applicant |
| US4910706(A) | 1990-03-01 | Hyatt | Applicant |
| US4993029(A) | 1991-02-01 | Galbraith et al. | Applicant |
| US5056089(A) | 1991-10-01 | Furuta et al. | Applicant |
| US5077722(A) | 1991-12-01 | Geist et al. | Applicant |
| US5126808(A) | 1992-06-01 | Montalvo et al. | Applicant |
| US5163021(A) | 1992-11-01 | Mehrotra et al. | Applicant |
| US5172338(A) | 1992-12-01 | Mehrotta et al. | Applicant |
| US5191584(A) | 1993-03-01 | Anderson | Applicant |
| US5200959(A) | 1993-04-01 | Gross et al. | Applicant |
| US5237535(A) | 1993-08-01 | Mielke et al. | Applicant |
| US5272669(A) | 1993-12-01 | Samachisa et al. | Applicant |
| US5276649(A) | 1994-01-01 | Hoshita et al. | Applicant |
| US5287469(A) | 1994-02-01 | Tsuboi | Applicant |
| US5365484(A) | 1994-11-01 | Cleveland et al. | Applicant |
| US5388064(A) | 1995-02-01 | Khan | Applicant |
| US5416646(A) | 1995-05-01 | Shirai | Applicant |
| US5416782(A) | 1995-05-01 | Wells et al. | Applicant |
| US5473753(A) | 1995-12-01 | Wells et al. | Applicant |
| US5479170(A) | 1995-12-01 | Cauwenberghs et al. | Applicant |
| US5508958(A) | 1996-04-01 | Fazio et al. | Applicant |
| US5519831(A) | 1996-05-01 | Holzhammer | Applicant |
| US5532962(A) | 1996-07-01 | Auclair et al. | Applicant |
| US5541886(A) | 1996-07-01 | Hasbun | Applicant |
| US5600677(A) | 1997-02-01 | Citta et al. | Applicant |
| US5638320(A) | 1997-06-01 | Wong et al. | Applicant |
| US5657332(A) | 1997-08-01 | Auclair et al. | Applicant |
| US5675540(A) | 1997-10-01 | Roohparvar | Applicant |
| US5682352(A) | 1997-10-01 | Wong et al. | Applicant |
| US5687114(A) | 1997-11-01 | Khan | Applicant |
| US5696717(A) | 1997-12-01 | Koh | Applicant |
| US5726649(A) | 1998-03-01 | Tamaru et al. | Applicant |
| US5726934(A) | 1998-03-01 | Tran et al. | Applicant |
| US5742752(A) | 1998-04-01 | De Koning | Applicant |
| US5748533(A) | 1998-05-01 | Dunlap et al. | Applicant |
| US5748534(A) | 1998-05-01 | Dunlap et al. | Applicant |
| US5751637(A) | 1998-05-01 | Chen et al. | Applicant |
| US5761402(A) | 1998-06-01 | Kaneda et al. | Applicant |
| US5798966(A) | 1998-08-01 | Keeney | Applicant |
| US5801985(A) | 1998-09-01 | Roohparvar et al. | Applicant |
| US5838832(A) | 1998-11-01 | Barnsley | Applicant |
| US5860106(A) | 1999-01-01 | Domen et al. | Applicant |
| US5867114(A) | 1999-02-01 | Barbir | Applicant |
| US5867429(A) | 1999-02-01 | Chen et al. | Applicant |
| US5877986(A) | 1999-03-01 | Harari et al. | Applicant |
| US5889937(A) | 1999-03-01 | Tamagawa | Applicant |
| US5901089(A) | 1999-05-01 | Korsh et al. | Applicant |
| US5909449(A) | 1999-06-01 | So et al. | Applicant |
| US5912906(A) | 1999-06-01 | Wu et al. | Applicant |
| US5930167(A) | 1999-07-01 | Lee et al. | Applicant |
| US5937424(A) | 1999-08-01 | Leak et al. | Applicant |
| US5942004(A) | 1999-08-01 | Cappelletti | Applicant |
| US5969986(A) | 1999-10-01 | Wong et al. | Applicant |
| US5991517(A) | 1999-11-01 | Harari et al. | Applicant |
| US5995417(A) | 1999-11-01 | Chen et al. | Applicant |
| US6009014(A) | 1999-12-01 | Hollmer et al. | Applicant |
| US6034891(A) | 2000-03-01 | Norman | Applicant |
| US6040993(A) | 2000-03-01 | Chen et al. | Applicant |
| US6041430(A) | 2000-03-01 | Yamauchi | Applicant |
| US6073204(A) | 2000-06-01 | Lakhani et al. | Applicant |
| US6101614(A) | 2000-08-01 | Gonzales et al. | Applicant |
| US6128237(A) | 2000-10-01 | Shirley et al. | Applicant |
| US6134140(A) | 2000-10-01 | Tanaka et al. | Applicant |
| US6134143(A) | 2000-10-01 | Norman | Applicant |
| US6134631(A) | 2000-10-01 | Jennings | Applicant |
| US6141261(A) | 2000-10-01 | Patti | Applicant |
| US6166962(A) | 2000-12-01 | Chen et al. | Applicant |
| US6178466(B1) | 2001-01-01 | Gilbertson et al. | Applicant |
| US6185134(B1) | 2001-02-01 | Tanaka et al. | Applicant |
| US6209113(B1) | 2001-03-01 | Roohparvar | Applicant |
| US6212654(B1) | 2001-04-01 | Lou et al. | Applicant |
| US6219276(B1) | 2001-04-01 | Parker | Applicant |
| US6219447(B1) | 2001-04-01 | Lee et al. | Applicant |
| US6222762(B1) | 2001-04-01 | Guterman et al. | Applicant |
| US6230233(B1) | 2001-05-01 | Lofgren et al. | Applicant |
| US6240458(B1) | 2001-05-01 | Gilbertson | Applicant |
| US6275419(B1) | 2001-08-01 | Guterman et al. | Applicant |
| US6279069(B1) | 2001-08-01 | Robinson et al. | Applicant |
| US6288944(B1) | 2001-09-01 | Kawamura | Applicant |
| US6292394(B1) | 2001-09-01 | Cohen et al. | Applicant |
| US6301151(B1) | 2001-10-01 | Engh et al. | Applicant |
| US6304486(B1) | 2001-10-01 | Yano | Applicant |
| US6307776(B1) | 2001-10-01 | So et al. | Applicant |
| US6317363(B1) | 2001-11-01 | Guterman et al. | Applicant |
| US6317364(B1) | 2001-11-01 | Guterman et al. | Applicant |
| US6345004(B1) | 2002-02-01 | Omura et al. | Applicant |
| US6360346(B1) | 2002-03-01 | Miyauchi et al. | Applicant |
| US6363008(B1) | 2002-03-01 | Wong | Applicant |
| US6363454(B1) | 2002-03-01 | Lakhani et al. | Applicant |
| US6366496(B1) | 2002-04-01 | Torelli et al. | Applicant |
| US6396742(B1) | 2002-05-01 | Korsh et al. | Applicant |
| US6397364(B1) | 2002-05-01 | Barkan | Applicant |
| US6405323(B1) | 2002-06-01 | Lin et al. | Applicant |
| US6418060(B1) | 2002-07-01 | Yong et al. | Applicant |
| US6442585(B1) | 2002-08-01 | Dean et al. | Applicant |
| US6456528(B1) | 2002-09-01 | Chen | Applicant |
| US6466476(B1) | 2002-10-01 | Wong et al. | Applicant |
| US6467062(B1) | 2002-10-01 | Barkan | Applicant |
| US6469931(B1) | 2002-10-01 | Ban et al. | Applicant |
| US6522580(B2) | 2003-02-01 | Chen et al. | Applicant |
| US6525952(B2) | 2003-02-01 | Araki et al. | Applicant |
| US6532556(B1) | 2003-03-01 | Wong et al. | Applicant |
| US6538922(B1) | 2003-03-01 | Khalid et al. | Applicant |
| US6558967(B1) | 2003-05-01 | Wong | Applicant |
| US6560152(B1) | 2003-05-01 | Cernea | Applicant |
| US6577539(B2) | 2003-06-01 | Iwahashi | Applicant |
| US6584012(B2) | 2003-06-01 | Banks | Applicant |
| US6615307(B1) | 2003-09-01 | Roohparvar | Applicant |
| US6621739(B2) | 2003-09-01 | Gonzales et al. | Applicant |
| US6643169(B2) | 2003-11-01 | Rudelic et al. | Applicant |
| US6646913(B2) | 2003-11-01 | Micheloni et al. | Applicant |
| US6678192(B2) | 2004-01-01 | Gongwer et al. | Applicant |
| US6687155(B2) | 2004-02-01 | Nagasue | Applicant |
| US6707748(B2) | 2004-03-01 | Lin et al. | Applicant |
| US6708257(B2) | 2004-03-01 | Bao | Applicant |
| US6714449(B2) | 2004-03-01 | Khalid | Applicant |
| US6717847(B2) | 2004-04-01 | Chen | Applicant |
| US6731557(B2) | 2004-05-01 | Beretta | Applicant |
| US6738293(B1) | 2004-05-01 | Iwahashi | Applicant |
| US6751766(B2) | 2004-06-01 | Guterman et al. | Applicant |
| US6757193(B2) | 2004-06-01 | Chen et al. | Applicant |
| US6774808(B1) | 2004-08-01 | Hibbs et al. | Applicant |
| US6781877(B2) | 2004-08-01 | Cernea et al. | Applicant |
| US6807095(B2) | 2004-10-01 | Chen et al. | Applicant |
| US6809964(B2) | 2004-10-01 | Moschopoulos et al. | Applicant |
| US6829167(B2) | 2004-12-01 | Tu et al. | Applicant |
| US6845052(B1) | 2005-01-01 | Ho et al. | Applicant |
| US6851018(B2) | 2005-02-01 | Wyatt et al. | Applicant |
| US6856546(B2) | 2005-02-01 | Guterman et al. | Applicant |
| US6862218(B2) | 2005-03-01 | Guterman et al. | Applicant |
| US6870767(B2) | 2005-03-01 | Rudelic et al. | Applicant |
| US6894926(B2) | 2005-05-01 | Guterman et al. | Applicant |
| US6907497(B2) | 2005-06-01 | Hosono et al. | Applicant |
| US6930925(B2) | 2005-08-01 | Guo et al. | Applicant |
| US6934188(B2) | 2005-08-01 | Roohparvar | Applicant |
| US6937511(B2) | 2005-08-01 | Hsu et al. | Applicant |
| US6963505(B2) | 2005-11-01 | Cohen | Applicant |
| US6972993(B2) | 2005-12-01 | Conley et al. | Applicant |
| US6988175(B2) | 2006-01-01 | Lasser | Applicant |
| US6992932(B2) | 2006-01-01 | Cohen | Applicant |
| US7002843(B2) | 2006-02-01 | Guterman et al. | Applicant |
| US7012835(B2) | 2006-03-01 | Gonzales et al. | Applicant |
| US7020017(B2) | 2006-03-01 | Chen et al. | Applicant |
| US7023735(B2) | 2006-04-01 | Ban et al. | Applicant |
| US7031210(B2) | 2006-04-01 | Park et al. | Applicant |
| US7031214(B2) | 2006-04-01 | Tran | Applicant |
| US7031216(B2) | 2006-04-01 | You | Applicant |
| US7039846(B2) | 2006-05-01 | Hewitt et al. | Applicant |
| US7042766(B1) | 2006-05-01 | Wang et al. | Applicant |
| US7054193(B1) | 2006-05-01 | Wong | Applicant |
| US7054199(B2) | 2006-05-01 | Lee et al. | Applicant |
| US7057958(B2) | 2006-06-01 | So et al. | Applicant |
| US7065147(B2) | 2006-06-01 | Ophir et al. | Applicant |
| US7068539(B2) | 2006-06-01 | Guterman et al. | Applicant |
| US7071849(B2) | 2006-07-01 | Zhang | Applicant |
| US7079555(B2) | 2006-07-01 | Baydar et al. | Applicant |
| US7088615(B2) | 2006-08-01 | Guterman et al. | Applicant |
| US7099194(B2) | 2006-08-01 | Tu et al. | Applicant |
| US7102924(B2) | 2006-09-01 | Chen et al. | Applicant |
| US7113432(B2) | 2006-09-01 | Mokhlesi | Applicant |
| US7130210(B2) | 2006-10-01 | Bathul et al. | Applicant |
| US7139192(B1) | 2006-11-01 | Wong | Applicant |
| US7139198(B2) | 2006-11-01 | Guterman et al. | Applicant |
| US7151692(B2) | 2006-12-01 | Wu | Applicant |
| US7170802(B2) | 2007-01-01 | Cernea et al. | Applicant |
| US7173859(B2) | 2007-02-01 | Hemink | Applicant |
| US7177184(B2) | 2007-02-01 | Chen | Applicant |
| US7177195(B2) | 2007-02-01 | Gonzales et al. | Applicant |
| US7177199(B2) | 2007-02-01 | Chen et al. | Applicant |
| US7177200(B2) | 2007-02-01 | Ronen et al. | Applicant |
| US7184338(B2) | 2007-02-01 | Nakagawa et al. | Applicant |
| US7187195(B2) | 2007-03-01 | Kim | Applicant |
| US7187592(B2) | 2007-03-01 | Guterman et al. | Applicant |
| US7190614(B2) | 2007-03-01 | Wu | Applicant |
| US7193898(B2) | 2007-03-01 | Cernea | Applicant |
| US7193921(B2) | 2007-03-01 | Choi et al. | Applicant |
| US7196928(B2) | 2007-03-01 | Chen | Applicant |
| US7197594(B2) | 2007-03-01 | Raz et al. | Applicant |
| US7200062(B2) | 2007-04-01 | Kinsely et al. | Applicant |
| US7221592(B2) | 2007-05-01 | Nazarian | Applicant |
| US7224613(B2) | 2007-05-01 | Chen et al. | Applicant |
| US7231474(B1) | 2007-06-01 | Helms et al. | Applicant |
| US7231562(B2) | 2007-06-01 | Ohlhoff et al. | Applicant |
| US7243275(B2) | 2007-07-01 | Gongwer et al. | Applicant |
| US7254690(B2) | 2007-08-01 | Rao | Applicant |
| US7257027(B2) | 2007-08-01 | Park | Applicant |
| US7259987(B2) | 2007-08-01 | Chen et al. | Applicant |
| US7266026(B2) | 2007-09-01 | Gongwer et al. | Applicant |
| US7274611(B2) | 2007-09-01 | Roohparvar | Applicant |
| US7277355(B2) | 2007-10-01 | Tanzana | Applicant |
| US7280398(B1) | 2007-10-01 | Lee et al. | Applicant |
| US7280409(B2) | 2007-10-01 | Misumi et al. | Applicant |
| US7289344(B2) | 2007-10-01 | Chen | Applicant |
| US7301807(B2) | 2007-11-01 | Khalid et al. | Applicant |
| US7301817(B2) | 2007-11-01 | Li et al. | Applicant |
| US7308525(B2) | 2007-12-01 | Lasser et al. | Applicant |
| US7310255(B2) | 2007-12-01 | Chan | Applicant |
| US7310272(B1) | 2007-12-01 | Mokhlesi et al. | Applicant |
| US7310347(B2) | 2007-12-01 | Lasser | Applicant |
| US7321509(B2) | 2008-01-01 | Chen et al. | Applicant |
| US7342831(B2) | 2008-03-01 | Mokhlesi et al. | Applicant |
| US7345928(B2) | 2008-03-01 | Li | Applicant |
| US7349263(B2) | 2008-03-01 | Kim et al. | Applicant |
| US7356755(B2) | 2008-04-01 | Fackenthal | Applicant |
| US7363420(B2) | 2008-04-01 | Lin et al. | Applicant |
| US7388781(B2) | 2008-06-01 | Litsyn et al. | Applicant |
| US7397697(B2) | 2008-07-01 | So et al. | Applicant |
| US7408804(B2) | 2008-08-01 | Hemink et al. | Applicant |
| US7408810(B2) | 2008-08-01 | Aritome et al. | Applicant |
| US7409473(B2) | 2008-08-01 | Conley et al. | Applicant |
| US7420847(B2) | 2008-09-01 | Li | Applicant |
| US7433231(B2) | 2008-10-01 | Aritome | Applicant |
| US7437498(B2) | 2008-10-01 | Ronen | Applicant |
| US7440324(B2) | 2008-10-01 | Mokhlesi | Applicant |
| US7441067(B2) | 2008-10-01 | Gorobetz et al. | Applicant |
| US7453737(B2) | 2008-11-01 | Ha | Applicant |
| US7460410(B2) | 2008-12-01 | Nagai et al. | Applicant |
| US7460412(B2) | 2008-12-01 | Lee et al. | Applicant |
| US7466592(B2) | 2008-12-01 | Mitani et al. | Applicant |
| US7468907(B2) | 2008-12-01 | Kang et al. | Examiner |
| US7468911(B2) | 2008-12-01 | Lutze et al. | Applicant |
| US7471581(B2) | 2008-12-01 | Tran et al. | Applicant |
| US7492641(B2) | 2009-02-01 | Hosono et al. | Applicant |
| US7508710(B2) | 2009-03-01 | Mokhlesi | Applicant |
| US7539062(B2) | 2009-05-01 | Doyle | Applicant |
| US7551492(B2) | 2009-06-01 | Kim | Applicant |
| US7568135(B2) | 2009-07-01 | Cornwell et al. | Applicant |
| US7570520(B2) | 2009-08-01 | Kamei et al. | Applicant |
| US7593259(B2) | 2009-09-01 | Kim et al. | Applicant |
| US7596707(B1) | 2009-09-01 | Vemula | Applicant |
| US7631245(B2) | 2009-12-01 | Lasser | Applicant |
| US7633798(B2) | 2009-12-01 | Sarin et al. | Applicant |
| US7633802(B2) | 2009-12-01 | Mokhlesi | Applicant |
| US7656734(B2) | 2010-02-01 | Thorp et al. | Applicant |
| US7660158(B2) | 2010-02-01 | Aritome | Applicant |
| US7660183(B2) | 2010-02-01 | Ware et al. | Applicant |
| US7742351(B2) | 2010-06-01 | Inoue et al. | Applicant |
| US7761624(B2) | 2010-07-01 | Karamcheti et al. | Applicant |
| US7810017(B2) | 2010-10-01 | Radke | Applicant |
| US7848149(B2) | 2010-12-01 | Gonzalez et al. | Applicant |
| US7885119(B2) | 2011-02-01 | Li | Applicant |
| US2001/0002172(A1) | 2001-05-01 | Tanaka et al. | Applicant |
| US2001/0006479(A1) | 2001-07-01 | Ikehashi et al. | Applicant |
| US2002/0038440(A1) | 2002-03-01 | Barkan | Applicant |
| US2002/0118574(A1) | 2002-08-01 | Gongwer et al. | Applicant |
| US2002/0133684(A1) | 2002-09-01 | Anderson | Applicant |
| US2002/0174295(A1) | 2002-11-01 | Ulrich et al. | Applicant |
| US2002/0196510(A1) | 2002-12-01 | Hietala et al. | Applicant |
| US2003/0002348(A1) | 2003-01-01 | Chen et al. | Applicant |
| US2003/0103400(A1) | 2003-06-01 | Van Tran | Applicant |
| US2003/0161183(A1) | 2003-08-01 | Van Tran | Applicant |
| US2003/0189856(A1) | 2003-10-01 | Cho et al. | Applicant |
| US2004/0057265(A1) | 2004-03-01 | Mirabel et al. | Applicant |
| US2004/0057285(A1) | 2004-03-01 | Cernea et al. | Applicant |
| US2004/0083333(A1) | 2004-04-01 | Chang et al. | Applicant |
| US2004/0083334(A1) | 2004-04-01 | Chang et al. | Applicant |
| US2004/0105311(A1) | 2004-06-01 | Cernea et al. | Applicant |
| US2004/0114437(A1) | 2004-06-01 | Li | Applicant |
| US2004/0160842(A1) | 2004-08-01 | Fukiage | Applicant |
| US2004/0223371(A1) | 2004-11-01 | Roohparvar | Applicant |
| US2005/0007802(A1) | 2005-01-01 | Gerpheide | Applicant |
| US2005/0013165(A1) | 2005-01-01 | Ban | Applicant |
| US2005/0024941(A1) | 2005-02-01 | Lasser et al. | Applicant |
| US2005/0024978(A1) | 2005-02-01 | Ronen | Applicant |
| US2005/0086574(A1) | 2005-04-01 | Fackenthal | Applicant |
| US2005/0121436(A1) | 2005-06-01 | Kamitani et al. | Applicant |
| US2005/0157555(A1) | 2005-07-01 | Ono et al. | Applicant |
| US2005/0162913(A1) | 2005-07-01 | Chen | Applicant |
| US2005/0169051(A1) | 2005-08-01 | Khalid et al. | Applicant |
| US2005/0189649(A1) | 2005-09-01 | Maruyama et al. | Applicant |
| US2005/0213393(A1) | 2005-09-01 | Lasser | Applicant |
| US2005/0224853(A1) | 2005-10-01 | Ohkawa | Applicant |
| US2005/0240745(A1) | 2005-10-01 | Iyer et al. | Applicant |
| US2005/0243626(A1) | 2005-11-01 | Ronen | Applicant |
| US2006/0004952(A1) | 2006-01-01 | Lasser | Applicant |
| US2006/0028875(A1) | 2006-02-01 | Avraham et al. | Applicant |
| US2006/0028877(A1) | 2006-02-01 | Meir | Applicant |
| US2006/0101193(A1) | 2006-05-01 | Murin | Applicant |
| US2006/0107136(A1) | 2006-05-01 | Gongwer et al. | Applicant |
| US2006/0129750(A1) | 2006-06-01 | Lee et al. | Applicant |
| US2006/0133141(A1) | 2006-06-01 | Gorobets | Applicant |
| US2006/0156189(A1) | 2006-07-01 | Tomlin | Applicant |
| US2006/0179334(A1) | 2006-08-01 | Brittain et al. | Applicant |
| US2006/0190699(A1) | 2006-08-01 | Lee | Applicant |
| US2006/0203546(A1) | 2006-09-01 | Lasser | Applicant |
| US2006/0218359(A1) | 2006-09-01 | Sanders et al. | Applicant |
| US2006/0221692(A1) | 2006-10-01 | Chen | Applicant |
| US2006/0221705(A1) | 2006-10-01 | Hemink et al. | Applicant |
| US2006/0221714(A1) | 2006-10-01 | Li et al. | Applicant |
| US2006/0239077(A1) | 2006-10-01 | Park et al. | Applicant |
| US2006/0239081(A1) | 2006-10-01 | Roohparvar | Applicant |
| US2006/0256620(A1) | 2006-11-01 | Nguyen et al. | Applicant |
| US2006/0256626(A1) | 2006-11-01 | Werner et al. | Applicant |
| US2006/0256891(A1) | 2006-11-01 | Yuan et al. | Applicant |
| US2006/0271748(A1) | 2006-11-01 | Jain et al. | Applicant |
| US2006/0285392(A1) | 2006-12-01 | Incarnati et al. | Applicant |
| US2006/0285396(A1) | 2006-12-01 | Ha | Applicant |
| US2007/0006013(A1) | 2007-01-01 | Moshayedi et al. | Applicant |
| US2007/0019481(A1) | 2007-01-01 | Park | Applicant |
| US2007/0033581(A1) | 2007-02-01 | Tomlin et al. | Applicant |
| US2007/0047314(A1) | 2007-03-01 | Goda et al. | Applicant |
| US2007/0047326(A1) | 2007-03-01 | Nguyen et al. | Applicant |
| US2007/0050536(A1) | 2007-03-01 | Kolokowsky | Applicant |
| US2007/0058446(A1) | 2007-03-01 | Hwang et al. | Applicant |
| US2007/0061502(A1) | 2007-03-01 | Lasser et al. | Applicant |
| US2007/0067667(A1) | 2007-03-01 | Ikeuchi et al. | Applicant |
| US2007/0074093(A1) | 2007-03-01 | Lasser | Applicant |
| US2007/0086239(A1) | 2007-04-01 | Litsyn et al. | Applicant |
| US2007/0086260(A1) | 2007-04-01 | Sinclair | Applicant |
| US2007/0089034(A1) | 2007-04-01 | Litsyn et al. | Applicant |
| US2007/0091677(A1) | 2007-04-01 | Lasser et al. | Applicant |
| US2007/0091694(A1) | 2007-04-01 | Lee et al. | Applicant |
| US2007/0103978(A1) | 2007-05-01 | Conley et al. | Applicant |
| US2007/0103986(A1) | 2007-05-01 | Chen | Applicant |
| US2007/0109845(A1) | 2007-05-01 | Chen | Applicant |
| US2007/0109849(A1) | 2007-05-01 | Chen | Applicant |
| US2007/0115726(A1) | 2007-05-01 | Cohen et al. | Applicant |
| US2007/0118713(A1) | 2007-05-01 | Guterman et al. | Applicant |
| US2007/0143378(A1) | 2007-06-01 | Gorobetz | Applicant |
| US2007/0143531(A1) | 2007-06-01 | Atri | Applicant |
| US2007/0159889(A1) | 2007-07-01 | Kang et al. | Applicant |
| US2007/0159892(A1) | 2007-07-01 | Kang et al. | Applicant |
| US2007/0159907(A1) | 2007-07-01 | Kwak | Applicant |
| US2007/0168837(A1) | 2007-07-01 | Murin | Applicant |
| US2007/0171714(A1) | 2007-07-01 | Wu et al. | Applicant |
| US2007/0183210(A1) | 2007-08-01 | Choi et al. | Applicant |
| US2007/0189073(A1) | 2007-08-01 | Aritome | Applicant |
| US2007/0195602(A1) | 2007-08-01 | Fong et al. | Applicant |
| US2007/0206426(A1) | 2007-09-01 | Mokhlesi | Applicant |
| US2007/0208904(A1) | 2007-09-01 | Hsieh et al. | Applicant |
| US2007/0226599(A1) | 2007-09-01 | Motwani | Applicant |
| US2007/0236990(A1) | 2007-10-01 | Aritome | Applicant |
| US2007/0253249(A1) | 2007-11-01 | Kang et al. | Applicant |
| US2007/0256620(A1) | 2007-11-01 | Viggiano et al. | Applicant |
| US2007/0263455(A1) | 2007-11-01 | Cornwell et al. | Applicant |
| US2007/0266232(A1) | 2007-11-01 | Rodgers et al. | Applicant |
| US2007/0271424(A1) | 2007-11-01 | Lee et al. | Applicant |
| US2007/0280000(A1) | 2007-12-01 | Fujiu et al. | Applicant |
| US2007/0291571(A1) | 2007-12-01 | Balasundaram | Applicant |
| US2007/0297234(A1) | 2007-12-01 | Cernea et al. | Applicant |
| US2008/0010395(A1) | 2008-01-01 | Mylly et al. | Applicant |
| US2008/0025121(A1) | 2008-01-01 | Tanzawa | Applicant |
| US2008/0043535(A1) | 2008-02-01 | Roohparvar | Applicant |
| US2008/0049504(A1) | 2008-02-01 | Kasahara et al. | Applicant |
| US2008/0049506(A1) | 2008-02-01 | Guterman | Applicant |
| US2008/0052446(A1) | 2008-02-01 | Lasser et al. | Applicant |
| US2008/0055993(A1) | 2008-03-01 | Lee | Applicant |
| US2008/0080243(A1) | 2008-04-01 | Edahiro et al. | Applicant |
| US2008/0082730(A1) | 2008-04-01 | Kim et al. | Applicant |
| US2008/0089123(A1) | 2008-04-01 | Chae et al. | Applicant |
| US2008/0104309(A1) | 2008-05-01 | Cheon et al. | Applicant |
| US2008/0104312(A1) | 2008-05-01 | Lasser | Applicant |
| US2008/0109590(A1) | 2008-05-01 | Jung et al. | Applicant |
| US2008/0115017(A1) | 2008-05-01 | Jacobson | Applicant |
| US2008/0123420(A1) | 2008-05-01 | Brandman et al. | Applicant |
| US2008/0126686(A1) | 2008-05-01 | Sokolov et al. | Applicant |
| US2008/0130341(A1) | 2008-06-01 | Shalvi et al. | Applicant |
| US2008/0148115(A1) | 2008-06-01 | Sokolov et al. | Applicant |
| US2008/0151618(A1) | 2008-06-01 | Sharon et al. | Applicant |
| US2008/0151667(A1) | 2008-06-01 | Miu et al. | Applicant |
| US2008/0158958(A1) | 2008-07-01 | Sokolov et al. | Applicant |
| US2008/0181001(A1) | 2008-07-01 | Shalvi | Applicant |
| US2008/0198650(A1) | 2008-08-01 | Shalvi et al. | Applicant |
| US2008/0198654(A1) | 2008-08-01 | Toda | Applicant |
| US2008/0209116(A1) | 2008-08-01 | Caulkins | Applicant |
| US2008/0209304(A1) | 2008-08-01 | Winarski et al. | Applicant |
| US2008/0215798(A1) | 2008-09-01 | Sharon et al. | Applicant |
| US2008/0219050(A1) | 2008-09-01 | Shalvi et al. | Applicant |
| US2008/0239093(A1) | 2008-10-01 | Easwar et al. | Applicant |
| US2008/0239812(A1) | 2008-10-01 | Abiko et al. | Applicant |
| US2008/0253188(A1) | 2008-10-01 | Aritome | Applicant |
| US2008/0263262(A1) | 2008-10-01 | Sokolov et al. | Applicant |
| US2008/0270730(A1) | 2008-10-01 | Lasser et al. | Applicant |
| US2008/0282106(A1) | 2008-11-01 | Shalvi et al. | Applicant |
| US2009/0013233(A1) | 2009-01-01 | Radke | Applicant |
| US2009/0024905(A1) | 2009-01-01 | Shalvi et al. | Applicant |
| US2009/0034337(A1) | 2009-02-01 | Aritome | Applicant |
| US2009/0043831(A1) | 2009-02-01 | Antonopoulos et al. | Applicant |
| US2009/0043951(A1) | 2009-02-01 | Shalvi et al. | Applicant |
| US2009/0049234(A1) | 2009-02-01 | Oh et al. | Applicant |
| US2009/0073762(A1) | 2009-03-01 | Lee et al. | Applicant |
| US2009/0086542(A1) | 2009-04-01 | Lee et al. | Applicant |
| US2009/0089484(A1) | 2009-04-01 | Chu | Applicant |
| US2009/0091979(A1) | 2009-04-01 | Shalvi | Applicant |
| US2009/0094930(A1) | 2009-04-01 | Schwoerer | Applicant |
| US2009/0106485(A1) | 2009-04-01 | Anholt | Applicant |
| US2009/0112949(A1) | 2009-04-01 | Ergan et al. | Applicant |
| US2009/0132755(A1) | 2009-05-01 | Radke | Applicant |
| US2009/0144600(A1) | 2009-06-01 | Perlmutter et al. | Applicant |
| US2009/0150894(A1) | 2009-06-01 | Huang et al. | Applicant |
| US2009/0157950(A1) | 2009-06-01 | Selinger | Applicant |
| US2009/0157964(A1) | 2009-06-01 | Kasorla et al. | Applicant |
| US2009/0158126(A1) | 2009-06-01 | Perlmutter et al. | Applicant |
| US2009/0168524(A1) | 2009-07-01 | Golov et al. | Applicant |
| US2009/0172257(A1) | 2009-07-01 | Prins et al. | Applicant |
| US2009/0172261(A1) | 2009-07-01 | Prins et al. | Applicant |
| US2009/0199074(A1) | 2009-08-01 | Sommer et al. | Applicant |
| US2009/0204824(A1) | 2009-08-01 | Lin et al. | Applicant |
| US2009/0204872(A1) | 2009-08-01 | Yu et al. | Applicant |
| US2009/0213653(A1) | 2009-08-01 | Perlmutter et al. | Applicant |
| US2009/0213654(A1) | 2009-08-01 | Perlmutter et al. | Applicant |
| US2009/0225595(A1) | 2009-09-01 | Kim | Applicant |
| US2009/0265509(A1) | 2009-10-01 | Klein | Applicant |
| US2009/0300227(A1) | 2009-12-01 | Nochimowski et al. | Applicant |
| US2009/0323412(A1) | 2009-12-01 | Mokhlesi et al. | Applicant |
| US2009/0327608(A1) | 2009-12-01 | Eschmann | Applicant |
| US2010/0017650(A1) | 2010-01-01 | Chin et al. | Applicant |
| US2010/0034022(A1) | 2010-02-01 | Dutta et al. | Applicant |
| US2010/0057976(A1) | 2010-03-01 | Lasser | Applicant |
| US2010/0061151(A1) | 2010-03-01 | Miwa et al. | Applicant |
| US2010/0110580(A1) | 2010-05-01 | Takashima | Applicant |
| US2010/0131697(A1) | 2010-05-01 | Alrod et al. | Applicant |
| US2010/0142268(A1) | 2010-06-01 | Aritome | Applicant |
| US2010/0142277(A1) | 2010-06-01 | Yang et al. | Applicant |
| US2010/0169743(A1) | 2010-07-01 | Vogan et al. | Applicant |
| EP783754(B1) | 1997-07-01 | Applicant | |
| EP1434236(B1) | 2004-06-01 | Applicant | |
| EP1605509(A1) | 2005-12-01 | Applicant | |
| WO9610256(A1) | 1996-04-01 | Applicant | |
| WO9828745(A1) | 1998-07-01 | Applicant | |
| WO2100112(A1) | 2002-12-01 | Applicant | |
| WO3100791(A1) | 2003-12-01 | Applicant | |
| WO2007046084(A2) | 2007-04-01 | Applicant | |
| WO2007132452(A2) | 2007-11-01 | Applicant | |
| WO2007132453(A2) | 2007-11-01 | Applicant | |
| WO2007132456(A2) | 2007-11-01 | Applicant | |
| WO2007132458(A2) | 2007-11-01 | Applicant | |
| WO-2007132457 | 2007-11-01 | Applicant | |
| WO2007146010(A2) | 2007-12-01 | Applicant | |
| WO2008026203(A2) | 2008-03-01 | Applicant | |
| WO2008053473(A2) | 2008-05-01 | Applicant | |
| WO-2008053472 | 2008-05-01 | Applicant | |
| WO2008068747(A2) | 2008-06-01 | Applicant | |
| WO2008077284(A1) | 2008-07-01 | Applicant | |
| WO2008083131(A2) | 2008-07-01 | Applicant | |
| WO2008099958(A1) | 2008-08-01 | Applicant | |
| WO2008111058(A2) | 2008-09-01 | Applicant | |
| WO2008124760(A2) | 2008-10-01 | Applicant | |
| WO2008139441(A2) | 2008-11-01 | Applicant | |
| WO2009037691(A2) | 2009-03-01 | Applicant | |
| WO2009037697(A2) | 2009-03-01 | Applicant | |
| WO2009038961(A2) | 2009-03-01 | Applicant | |
| WO2009050703(A2) | 2009-04-01 | Applicant | |
| WO2009053961(A2) | 2009-04-01 | Applicant | |
| WO2009053962(A2) | 2009-04-01 | Applicant | |
| WO2009053963(A2) | 2009-04-01 | Applicant | |
| WO2009063450(A2) | 2009-05-01 | Applicant | |
| WO2009072100(A2) | 2009-06-01 | Applicant | |
| WO2009072101(A2) | 2009-06-01 | Applicant | |
| WO2009072102(A2) | 2009-06-01 | Applicant | |
| WO2009072103(A2) | 2009-06-01 | Applicant | |
| WO2009072104(A2) | 2009-06-01 | Applicant | |
| WO2009072105(A2) | 2009-06-01 | Applicant | |
| WO2009074978(A2) | 2009-06-01 | Applicant | |
| WO2009074979(A2) | 2009-06-01 | Applicant | |
| WO2009078006(A2) | 2009-06-01 | Applicant | |
| WO2009095902(A2) | 2009-08-01 | Applicant |
Non-Patent Literature (102)
- US 7,161,836, 01/2007, Wan et al. (withdrawn)Applicant
- U.S. Appl. No. 11/995,814 Official Action dated Dec. 17, 2010.Applicant
- U.S. Appl. No. 12/388,528 Official Action dated Nov. 29, 2010.Applicant
- U.S. Appl. No. 12/251,471 Official Action dated Jan. 3, 2011.Applicant
- Engineering Windows 7, “Support and Q&A for Solid-State Drives”, e7blog, May 5, 2009.Applicant
- Micron Technology Inc., “Memory Management in NAND Flash Arrays”, Technical Note, year 2005.Applicant
- Kang et al., “A Superblock-based Flash Translation Layer for NAND Flash Memory”, Proceedings of the 6th ACM & IEEE International Conference on Embedded Software, pp. 161-170, Seoul, Korea, Oct. 22-26, 2006.Applicant
- Park et al., “Sub-Grouped Superblock Management for High-Performance Flash Storages”, IEICE Electronics Express, vol. 6, No. 6, pp. 297-303, Mar. 25, 2009.Applicant
- “How to Resolve “Bad Super Block: Magic Number Wrong” in BSD”, Free Online Articles Director Article Base, posted Sep. 5, 2009.Applicant
- Ubuntu Forums, “Memory Stick Failed IO Superblock”, posted Nov. 11, 2009.Applicant
- Super User Forums, “SD Card Failure, can't read superblock”, posted Aug. 8, 2010.Applicant
- U.S. Appl. No. 12/987,174 “Redundant Data Storage in Multi-Die Memory Systems”, filed Jan. 10, 2011.Applicant
- U.S. Appl. No. 12/987,175 “Redundant Data Storage Schemes for Multi-Die Memory Systems” filed Jan. 10, 2011.Applicant
- U.S. Appl. No. 12/963,649 “Memory Management Schemes for Non-Volatile Memory Devices” filed Dec. 9, 2010.Applicant
- U.S. Appl. No. 13/021,754 “Reducing Peak Current in Memory Systems” filed Feb. 6, 2011.Applicant
- U.S. Appl. No. 12/019,011 Official Action dated Nov. 20, 2009.Applicant
- Takeuchi et al., “A Multipage Cell Architecture for High-Speed Programming Multilevel NAND Flash Memories”, IEEE Journal of Solid State Circuits, vol. 33, No. 8, Aug. 1998.Applicant
- U.S. Appl. No. 12/534,898 Official Action dated Mar. 23, 2011.Applicant
- U.S. Appl. No. 13/047,822, filed Mar. 15, 2011.Applicant
- U.S. Appl. No. 13/069,406, filed Mar. 23, 2011.Applicant
- U.S. Appl. No. 13/088,361, filed Apr. 17, 2011.Applicant
- Jedec Standard JESD84-C44, “Embedded MultiMediaCard (e•MMC) Mechanical Standard, with Optional Reset Signal”, Jedec Solid State Technology Association, USA, Jul. 2009.Applicant
- Jedec, “UFS Specification”, version 0.1, Nov. 11, 2009.Applicant
- SD Group and SD Card Association, “SD Specifications Part 1 Physical Layer Specification”, version 3.01, draft 1.00, Nov. 9, 2009.Applicant
- Compaq et al., “Universal Serial Bus Specification”, revision 2.0, Apr. 27, 2000.Applicant
- Serial ATA International Organization, “Serial ATA Revision 3.0 Specification”, Jun. 2, 2009.Applicant
- Gotou, H., “An Experimental Confirmation of Automatic Threshold Voltage Convergence in a Flash Memory Using Alternating Word-Line Voltage Pulses”, IEEE Electron Device Letters, vol. 18, No. 10, pp. 503-505, Oct. 1997.Applicant
- Huffman, A., “Non-Volatile Memory Host Controller Interface (NVMHCI)”, Specification 1.0, Apr. 14, 2008.Applicant
- Panchbhai et al., “Improving Reliability of NAND Based Flash Memory Using Hybrid SLC/MLC Device”, Project Proposal for CSci 8980—Advanced Storage Systems, University of Minnesota, USA, Spring 2009.Applicant
- U.S. Appl. No. 11/957,970 Official Action dated May 20, 2010.Applicant
- Shalvi et al., U.S. Appl. No. 12/822,207 “Adaptive Over-Provisioning in Memory Systems” filed Jun. 24, 2010.Applicant
- Agrell et al., “Closest Point Search in Lattices”, IEEE Transactions on Information Theory, vol. 48, No. 8, pp. 2201-2214, Aug. 2002.Applicant
- Blahut, R.E., “Theory and Practice of Error Control Codes,” Addison-Wesley, May 1984, section 3.2, pp. 47-48.Applicant
- Chang, L., “Hybrid Solid State Disks: Combining Heterogeneous NAND Flash in Large SSDs”, ASPDAC, Jan. 2008.Applicant
- Cho et al., “Multi-Level NAND Flash Memory with Non-Uniform Threshold Voltage Distribution,” IEEE International Solid-State Circuits Conference (ISSCC), San Francisco, CA, Feb. 5-7, 2001, pp. 28-29 and 424.Applicant
- Databahn™, “Flash memory controller IP”, Denali Software, Inc., 1994 https://www.denali.com/en/products/databahn—flash.jsp.Applicant
- Datalight, Inc., “FlashFX Pro 3.1 High Performance Flash Manager for Rapid Development of Reliable Products”, Nov. 16, 2006.Applicant
- Duann, N., Silicon Motion Presentation “SLC & MLC Hybrid”, Flash Memory Summit, Santa Clara, USA, Aug. 2008.Applicant
- Engh et al., “A self adaptive programming method with 5 mV accuracy for multi-level storage in FLASH”, pp. 115-118, Proceedings of the IEEE 2002 Custom Integrated Circuits Conference, May 12-15, 2002.Applicant
- Goodman et al., “On-Chip ECC for Multi-Level Random Access Memories,” Proceedings of the IEEE/CAM Information Theory Workshop, Ithaca, USA, Jun. 25-29, 1989.Applicant
- Han et al., “An Intelligent Garbage Collection Algorithm for Flash Memory Storages”, Computational Science and Its Applications—ISSCA 2006, vol. 3980/2006, pp. 1019-1027, Springer Berlin / Heidelberg, Germany, May 11, 2006.Applicant
- Han et al., “CATA: A Garbage Collection Scheme for Flash Memory File Systems”, Ubiquitous Intelligence and Computing, vol. 4159/2006, p. 103-112, Springer Berlin / Heidelberg, Aug. 25, 2006.Applicant
- Horstein, “On the Design of Signals for Sequential and Nonsequential Detection Systems with Feedback,” IEEE Transactions on Information Theory IT-12:4 (Oct. 1966), pp. 448-455.Applicant
- Jung et al., in “A 117 mm.sup.2 3.3V Only 128 Mb Multilevel NAND Flash Memory for Mass Storage Applications,” IEEE Journal of Solid State Circuits, (11:31), Nov. 1996, pp. 1575-1583.Applicant
- Kawaguchi et al. 1995. A flash-memory based file system. In Proceedings of the USENIX 1995 Technical Conference , New Orleans, Louisiana. 155-164.Applicant
- Lee et al., “Effects of Floating Gate Interference on NAND Flash Memory Cell Operation”, IEEE Electron Device Letters, vol. 23, No. 5, pp. 264-266, May 2002.Applicant
- Mielke et al., “Recovery Effects in the Distributed Cycling of Flash Memories”, IEEE 44th Annual International Reliability Physics Symposium, pp. 29-35, San Jose, USA, Mar. 2006.Applicant
- Onfi, “Open NAND Flash Interface Specification,” revision 1.0, Dec. 28, 2006.Applicant
- Phison Electronics Corporation, “PS8000 Controller Specification (for SD Card)”, revision 1.2, Document No. S-07018, Mar. 28, 2007.Applicant
- Shalvi, et al., “Signal Codes,” Proceedings of the 2003 IEEE Information Theory Workshop (ITW'2003), Paris, France, Mar. 31-Apr. 4, 2003.Applicant
- Shiozaki, A., “Adaptive Type-II Hybrid Broadcast ARQ System”, IEEE Transactions on Communications, vol. 44, Issue 4, pp. 420-422, Apr. 1996.Applicant
- Suh et al., “A 3.3V 32Mb NAND Flash Memory with Incremental Step Pulse Programming Scheme”, IEEE Journal of Solid-State Circuits, vol. 30, No. 11, pp. 1149-1156, Nov. 1995.Applicant
- ST Microelectronics, “Bad Block Management in NAND Flash Memories”, Application note AN-1819, Geneva, Switzerland, May 2004.Applicant
- ST Microelectronics, “Wear Leveling in Single Level Cell NAND Flash Memories,” Application note AN-1822 Geneva, Switzerland, Feb. 2007.Applicant
- Takeuchi et al., “A Double Level VTH Select Gate Array Architecture for Multi-Level NAND Flash Memories”, Digest of Technical Papers, 1995 Symposium on VLSI Circuits, pp. 69-70, Jun. 8-10, 1995.Applicant
- Wu et al., “eNVy: A non-Volatile, Main Memory Storage System”, Proceedings of the 6th International Conference on Architectural support for programming languages and operating systems, pp. 86-87, San Jose, USA, 1994.Applicant
- International Application PCT/IL2007/000575 Patentability report dated Mar. 26, 2009.Applicant
- International Application PCT/IL2007/000575 Search Report dated May 30, 2008.Applicant
- International Application PCT/IL2007/000576 Patentability Report dated Mar. 19, 2009.Applicant
- International Application PCT/IL2007/000576 Search Report dated Jul. 7, 2008.Applicant
- International Application PCT/IL2007/000579 Patentability report dated Mar. 10, 2009.Applicant
- International Application PCT/IL2007/000579 Search report dated Jul. 3, 2008.Applicant
- International Application PCT/IL2007/000580 Patentability Report dated Mar. 10, 2009.Applicant
- International Application PCT/IL2007/000580 Search Report dated Sep. 11, 2008.Applicant
- International Application PCT/IL2007/000581 Patentability Report dated Mar. 26, 2009.Applicant
- International Application PCT/IL2007/000581 Search Report dated Aug. 25, 2008.Applicant
- International Application PCT/IL2007/001059 Patentability report dated Apr. 19, 2009.Applicant
- International Application PCT/IL2007/001059 Search report dated Aug. 7, 2008.Applicant
- International Application PCT/IL2007/001315 search report dated Aug. 7, 2008.Applicant
- International Application PCT/IL2007/001315 Patentability Report dated May 5, 2009.Applicant
- International Application PCT/IL2007/001316 Search report dated Jul. 22, 2008.Applicant
- International Application PCT/IL2007/001316 Patentability Report dated May 5, 2009.Applicant
- International Application PCT/IL2007/001488 Search report dated Jun. 20, 2008.Applicant
- International Application PCT/IL2008/000329 Search report dated Nov. 25, 2008.Applicant
- International Application PCT/IL2008/000519 Search report dated Nov. 20, 2008.Applicant
- International Application PCT/IL2008/001188 Search Report dated Jan. 28, 2009.Applicant
- International Application PCT/IL2008/001356 Search Report dated Feb. 3, 2009.Applicant
- International Application PCT/IL2008/001446 Search report dated Feb. 20, 2009.Applicant
- Sommer, N., U.S. Appl. No. 12/171,797 “Memory Device with Non-Uniform Programming Levels” filed Jul. 11, 2008.Applicant
- U.S. Appl. No. 11/949,135 Official Action dated Oct. 2, 2009.Applicant
- U.S. Appl. No. 12/880,101 “Reuse of Host Hibernation Storage Space by Memory Controller”, filed Sep. 12, 2010.Applicant
- U.S. Appl. No. 12/890,724 “Error Correction Coding Over Multiple Memory Pages”, filed Sep. 27, 2010.Applicant
- U.S. Appl. No. 12/171,797 Official Action dated Aug. 25, 2010.Applicant
- U.S. Appl. No. 12/497,707 Official Action dated Sep. 15, 2010.Applicant
- U.S. Appl. No. 11/995,801 Official Action dated Oct. 15, 2010.Applicant
- Numonyx, “M25PE16: 16-Mbit, page-erasable serial flash memory with byte-alterability, 75 MHz SPI bus, standard pinout”, Apr. 2008.Applicant
- Hong et al., “NAND Flash-based Disk Cache Using SLC/MLC Combined Flash Memory”, 2010 International Workshop on Storage Network Architecture and Parallel I/Os, pp. 21-30, USA, May 3, 2010.Applicant
- U.S. Appl. No. 11/945,575 Official Action dated Aug. 24, 2010.Applicant
- U.S. Appl. No. 12/045,520 Official Action dated Nov. 16, 2010.Applicant
- Ankolekar et al., “Multibit Error-Correction Methods for Latency-Constrained Flash Memory Systems”, IEEE Transactions on Device and Materials Reliability, vol. 10, No. 1, pp. 33-39, Mar. 2010.Applicant
- U.S. Appl. No. 12/344,233 Official Action dated Jun. 24, 2011.Applicant
- U.S. Appl. No. 11/995,813 Official Action dated Jun. 16, 2011.Applicant
- Berman et al., “Mitigating Inter-Cell Coupling Effects in MLC NAND Flash via Constrained Coding”, Flash Memory Summit, Santa Clara, USA, Aug. 19, 2010.Applicant
- CM Patent Application # 200780026181.3 Official Action dated Apr. 8, 2011.Applicant
- Bez et al., “Introduction to Flash Memory,” Proceedings of the IEEE, vol. 91, No. 4, Apr. 2003, pp. 489-502.Applicant
- Eitan et al., “Multilevel Flash Cells and their Trade-Offs,” Proceedings of the 1996 IEEE International Electron Devices Meeting (IEDM), New York, NY pp. 169-172.Applicant
- Eitan, et al., “Can NROM, a 2-bit, Trapping Storage NVM Cell, Give a Real Challenge to Floating Gate Cells?” Proceedings of the 1999 International Conference on Solid State Devices and Materials (SSDM), Tokyo, Japan, Sep. 21-24, 1999, pp. 522-524.Applicant
- Maayan et al., “A 512 Mb NROM Flash Data Storage Memory with 8 MB/s Data Rate”, Proceedings of the 2002 IEEE International Solid-State Circuits Conference (ISSCC 2002), San Francisco, California, Feb. 3-7, 2002, pp. 100-101.Applicant
- Kim et al., “Future Memory Technology including Emerging New Memories,” Proceedings of the 24th International Conference on Microelectronics (MIEL), Nis, Serbia and Montenegro, May 16-19, 2004, vol. 1, pp. 377-384.Applicant
- Wei, L., “Trellis-Coded Modulation With Multidimensional Constellations”, IEEE Transactions on Information Theory, vol. IT-33, No. 4, pp. 483-501, Jul. 1987.Applicant
- U.S. Appl. No. 13/114,049 Official Action dated Sep. 12, 2011.Applicant
- U.S. Appl. No. 12/405,275 Official Action dated Jul. 29, 2011.Applicant