Memory system for data storage and retrieval

Information

  • Patent Grant
  • 7917709
  • Patent Number
    7,917,709
  • Date Filed
    Tuesday, December 15, 2009
    16 years ago
  • Date Issued
    Tuesday, March 29, 2011
    15 years ago
Abstract
According to a first aspect of an embodiment of the invention, there is provided a method of data storage and retrieval for use in a solid state memory system, having a non-volatile memory, wherein data is written to the non-volatile memory in the form of at least one logical sector the method comprising: monitoring the logical sector data which is to be written to the non-volatile memory, detecting the presence of a pattern in the logical sector data, upon detecting a repetitive pattern recording the repetitive pattern of the logical sector in a sector address table in the non-volatile memory without making a record of the logical sector data in the nonvolatile memory.
Description
FIELD OF THE INVENTION

The present invention relates generally to a solid state memory system for a data storage and retrieval having a memory controller for controlling access to a non-volatile memory of the solid state memory system and particularly to a method and apparatus for accessing data stored within the non-volatile memory of the solid state memory system at an increased speed when the data has a repetitive pattern.


DESCRIPTION OF THE PRIOR ART

It is known to use solid state memory systems to try to emulate magnetic disk storage devices in computer systems. In particular, it is an aim of the industry to try to increase the speed of operation of solid state memory systems to better emulate magnetic disc storage.


A typical memory system comprises a non-volatile memory, such as a Flash memory, and a controller. The flash memory has individually addressable sectors wherein a memory sector is a group of flash memory locations which is allocated for storage of one Logical Sector. A memory sector need not be a physical partition within Flash memory, nor need it be contiguous Flash memory locations, so the memory sector address may be a virtual address conveniently used by the controller. The controller writes data structures to and reads data structures from the memory, and translates logical addresses received from the host to physical, or virtual addresses, of the memory sectors in the memory.


When a logical sector write command is received from the host, the controller translates a logical address received from the host and allocates a memory sector for the logical sector to be written to. The controller is also responsible for maintaining a table of logical addresses with respective physical addresses which have been allocated by the controller. The table is referred to as the Sector Allocation Table or SAT. There is also, in some cases, a system or hierarchy of SATs to provide improved ease of access and to reduce the update frequency required.


The physical or virtual, sector addresses in the SAT are typically ordered by logical sector address, where the Nth SAT entry includes the physical address of a sector to which data having logical address N has been written. When a sector read command is received from the host, the controller looks up a logical sector address received from the host in the SAT in order to obtain the physical sector address which the controller previously allocated to the logical sector. On some occasions one SAT entry is used to define the address of a group of contiguous memory sectors containing a group of contiguous logical sectors.


A feature of the flash memory is that the flash memory must be pre-erased before the data can be written. This means that, in general, in the flash memory system, when a logical sector is written, the obsolete copy of the logical sector should be erased before or after. Here, the term erased memory sector will be used for a memory sector which has all the cells erased. Quite often the memory sectors are not individually erasable, but, grouped to be erasable in units or blocks. The controller can use various methods to maintain the flash memory. Any memory sector which has been written to will be treated by the controller as a memory sector which has not been erased.


The host can issue a sector erase command to erase the logical sector in the memory in order to delete all the sector data and pre-erase the card for a faster sector write operation in the future. This results in the sector write operation consisting of Flash memory writes only and no erases. The term erased logical sector is generally used not only for a logical sector which has been erased, but, also for a sector which has not yet been written. Due to the complexity of flash memory organization and complexity of its maintenance, various algorithms can be used which allows an erased logical sector to be temporarily marked in the SAT as obsolete, but, the memory sector containing the logical sector can be erased later. The example of such a memory system is illustrated in the “Memory System” detailed in patent application WO 00/49488 PCT/GB00,00550). FIG. 1 (prior art) illustrates the address translation algorithm of the Memory System of WO 00/49488. FIG. 2 illustrates the sector read operation of the Memory System of WO 00/49488. WO 00/49488 describes the technique of using the SAT Table not only to define physical locations of the written logical sectors, but, also to mark them as deleted or bad. In the case of the deleted or never written sector the corresponding SAT entry includes the virtual address value showing that the sector includes no data the controller sets all the bytes of the sector data buffer to all 1s and the sector then will be output to the host.


Thus, a need arises to obviate or mitigate at least one of the aforementioned problems.





IN THE DRAWINGS


FIG. 1 shows an address translation algorithm of a prior art memory system;



FIG. 2 shows a sector read operation of a prior art memory system;



FIG. 3 shows a flash memory system in accordance with an embodiment of the present invention;



FIG. 4
a shows a first embodiment of the hardware architecture of the controller of the flash memory of FIG. 3;



FIG. 4
b shows a second embodiment of the hardware architecture of the controller of the flash memory of FIG. 3;



FIG. 5 shows a graphical representation of the virtual blocks into which the flash memory of the flash memory system is organized; and



FIG. 6 shows a schematic representation of the data write operation used in FIG. 5.





DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

With reference to FIG. 3, there is shown a flash memory system 10 in which a method of achieving faster access of the data in the memory system is adopted. The memory system 10 comprises a controller 16 and flash memory 20 which are connected by physical interface 18. The memory system 10 is connected to an associated host system 12 by logical interface 14. The logical interface 14 connects to the controller 16 of the memory system 10 and reads from, and writes data to the host system 12 in logical sectors of 512 bytes of data. Each logical sector is identified by a logical address which in this case is a sequential logical block address (LBA) and may be accessed randomly for either reading or writing data. Data is written to and read from the flash memory 20 in physical sectors each of which typically has sufficient capacity for 512 bytes of data from the host system, plus 16 bytes of overhead data appended by the controller 16. Each physical sector is identified by a physical sector address which normally has separate components identifying the flash chip within the memory subsystem, the flash block within the flash chip and the physical sector within the flash block. Data may only be written to a physical sector if the sector has previously been erased, and erasure takes place in response to a command at the physical interface 18 in units of a flash block which typically includes 32 physical sectors. Physical sectors may be randomly accessed for reading data. In the present arrangement, wherein the memory comprises NAND Flash chips, a physical sector is equivalent to a physical page within the flash array and has a capacity of 528 bytes. In this case, each flash chip is considered to comprise four arrays, each of which can be programmed with one sector at any time.


The controller 16 provides a method of detecting the pattern of the logical sector data which is due to be written to the flash memory 20 when a sector write command is issued by the host 12. If the sector data has a flat repetitive pattern, for example, if all the bytes of the sector data are the same, then the controller 16 may use the corresponding sector address table (SAT) entry to record the pattern, which in this case is a content of any one byte of sector data, and mark the logical sector as being erased. It is therefore, not necessary to write the sector data to the flash memory 20 in order to record the sector data, instead it is enough to keep the information about the sector pattern in the SAT. The obsolete copy of the sector data must then be erased in flash memory, as is the case when any new sector data is written to the flash memory system. However, in this case, the new valid sector data is stored in a SAT entry instead of in a memory sector in flash memory.


When it is desired that the sector data be read, a logical sector read command is sent by the host 12 and the controller 16 looks up the SAT and checks the virtual address value provided by the SAT shows that the sector data is deleted, the controller 16 takes the sector data pattern value from the entry within the SAT to output the sector data as if it was being retrieved from the flash memory 20.


This operation results in the speed of the access to the flash data by the host 12 being greatly improved as the sector write operation no longer comprises the step of sector data write to the flash memory 20 and the sector read operation does not comprise the step of sector data read from the flash memory 20.


Some hosts may write a large number of flat data sectors which can be a part of large uncompressed data base files. It is also the case that the host 12 can deliberately ‘precondition’ or format the memory system by writing all 0's or 1's in order to delete all the information (which is a standard security feature). The ATA standard Format Track command can also be treated as the flat sector write command.


With reference to FIGS. 4a and 4b there is shown the hardware architecture of the controller 16 of flash memory system 10. The controller comprises memory access control, or system bus 28, host interface control block 22 to which logical interface 14 connects, microprocessor 24, flash interface control block 26 to which physical interface 18 connects, Read Only Memory (ROM) 30, and synchronous random access memory (SRAM) 32.


The host interface control block 22 provides the path to the controller 16 for data flow to and from host system 12.


With reference to FIG. 4a there is shown a first embodiment of the hardware architecture of controller 16 in which the host interface control block 22 has, embedded within itself, a pattern detection circuit 23a which compares all the data portions of incoming data when the host 12 issues a sector write command and sends sector data to the memory system 10. The pattern detection circuit 23a then indicates to the microprocessor whether the incoming data has a flat pattern. The pattern detection circuit 23a compares all the sector data portions (1, 2 or 4 bytes) with each other. This can be done, for example, by fetching the first data portion and XOR-ing it with all other data portions, at least one non-zero result triggers signaling of a non-flat pattern. Flat pattern can also be detected by XOR-ing every incoming data portion with the previous one. The pattern value of the incoming data then can be obtained by the microprocessor 24 from the pattern detection circuit 23a or by reading any data portion from the sector buffer SRAM 32.


The host interface 22 has pattern output circuit 23b which can be programmed by the microprocessor 24 to output a certain pattern to the host 22 when the sector read command is received from the host, instead of transferring the sector data from the sector buffer SRAM 32. The pattern value is obtained by the microprocessor 24 from the corresponding SAT entry when the sector is marked there as erased.


With reference to FIG. 4b there is shown a second embodiment of the hardware architecture of controller 16 in which firmware 25 of the microprocessor 24 provides a pattern detection facility which can compare all the data portions of the sector data by reading the sector buffer in SRAM 32. Firmware 25 is instruction code for the microprocessor and is normally stored in one of the memories (ROM, SRAM or Flash memory).


In this arrangement the pattern output can also be provided by the firmware of microprocessor 24 which can simply fill up all the data portions in the sector buffer in SRAM 32 by the pattern values.


With reference to FIG. 5 the flash memory 20 is organized into virtual blocks each of which includes a number of virtual pages. Each virtual page is of the size of a memory sector (such as “sector 2”) which in this case is 528 bytes. Every logical sector, including control over head, is stored in a memory sector, including control overhead, is stored in a memory sector the location of which is defined by the virtual block address and the virtual page address within the virtual block. The memory sector and virtual page need not be a physical partition within Flash memory 20, nor contiguous Flash memory locations, so that the memory sector address may be a virtual address conveniently used by the controller 16.


In the first embodiment of this arrangement the SAT is a table of 3-byte entries, and each entry is called a SAT Entry. Sat Entry i includes the virtual address of the sector with logical address i.


In a second embodiment the SAT has a different structure which is, for example, divided into smaller blocks hierarchically organized in order to provide faster SAT update.


Temporary copies of SAR blocks used as a cache may also have the same entry format as either of the above SAT structure arrangements.


Each SAT Entry virtual address, as with all virtual addresses, comprises two components the first of which is a virtual block number and the second of which is a memory sector offset within the virtual block. The virtual block number comprises all except the least significant byte of the three byte entries. The least significant byte includes the memory sector offset. By restricting to relatively small blocks having a size of not more than 128 memory sectors the maximum sector offset only requires the least significant 7 bits of the Byte.


In a SAT entry, some illegal addresses may be entered to represent special cases. Four such cases are illustrated in Table 1.













TABLE 1






Virtual
Memory
Memory



Case
Block Address
Sector Offset
Sector Offset


Number
Field
Illegal Bit
Legal Bits
Description


















1
0
Constant Pattern Data
Constant





Data Sector





(including





Erased Sector)


2
1
X (don't care)
Bad Sector











3
B > 1
0
S
Valid Written






Sector


4
B > 1
1
S
Sector Marked






as Erased









In cases 1 and 2, that is the cases in which the sector is a constant data sector (including erased sector) or a bad sector, the virtual block address correspond to reserved locations. This means virtual block addresses 0 and 1 belong to special control blocks used by the controller and can therefore never map onto valid data sectors. The values 0-1 may thus be used to indicate these special cases.


In case 1 the sector includes constant data, so that the whole of the sector offset byte including the illegal bit includes the pattern data which is repeated through the sector. This technique is also used for erased sectors—wherein the constant data pattern is set to all 1s.


In case 2 the sector is marked as bad, and therefore any values in the sector offset byte are immaterial and therefore the sector is set as X=don't care. In this case when the host accesses the sector marked as bad, no operation is performed and error status is returned to the host.


Case 3 represents the valid written sector address recorded in the SAT entry and in this case the virtual block address field word B is set as being greater than 1 and therefore a valid data block number.


In case 4, the extra illegal sector offset-bit in the sector has been erased, but the actual memory sector may not yet have been erased physically. The virtual address of the memory sector is obtained from the entry by setting the extra illegal sector offset bit to zero. This means the word B is a valid data block number, and the legal sector offset bits S yield a valid sector offset. The obsolete copy of such a sector is due to the physically erased and data pattern is due to be set to all 1s. This technique can be used to postpone the physical erase operation in order to do it more efficiently by erasing a large group of memory sectors at a time.


The implementation of the write sector command, normally by the controller microprocessor firmware may be implemented in many ways examples of which will now be given. Each of the detailed examples is for multiple sector commands when the host sends a group of sectors by one command.


In a first embodiment of the implementation of the write sector command the SAT is updated immediately after a repetitive data sector is detected. In this case the logical sector is not written to the flash memory 20, instead the logical sector pattern is recorded in the corresponding SAT entry. The immediate up date of the SAT or, as mentioned, a temporary SAT copy is essential to ensure the contents of the sector are not lost if the command is terminated and power is turned off.


Typically upon implementation of the write sector command the controller 16 checks the pattern of a series of the incoming sectors. The series may include all the logical sectors to be written by the write command or a limited number of sectors written in response to the command (in order to simplify the algorithm). In this case, the series is limited either by the sector count of the write command or until the write-pointer, or W-pointer, reaches end of the block whichever is shorter. The service can also be cancelled when the write-pointer reaches the end of the virtual block as well as when the actual memory write is postponed as detailed in the second and third embodiments respectively. This means that sectors belonging to the same write command can be split to several group. The benefit of this is that it significantly reduces the number of SAT updates and therefore improves performance.


The controller 16 may additionally incorporate a media management operation which is implemented by algorithms which embody the principle that data is written at physical sector locations in Flash memory 20 which follow the same order as the sequence in which the data is written. This is achieved by writing each logical data sector at a physical sector location defined by a cyclic write pointer.


A schematic representation of such a write operation is shown in FIG. 6. The data write pointer 46 moves sequentially through the memory sector positions of a virtual block in Flash memory, and therefore through a chain of blocks, such as block X, block Y and block Z from which the virtual block is formed, in a manner defined by a block sequencing algorithm. Each of block S, block Y, and block Z is a physical structure in flash memory 20 which, in this case comprises sixteen sector locations which can be erased a single operation.


In a second embodiment of the implementation of the write sector command the controller 16 checks the pattern of a series of the incoming sectors without writing them to the flash memory 20 if the data of the sectors is same, i.e. the data pattern is flat. If all the sectors of the series are of the same flat pattern then the SAT is updated. The case when all the sectors have repetitive data, but, are different from each other can be handled similarly until the SAT is updated, the record of the sectors' pattern being kept in the controller's volatile memory that is the SRAM 32. If a non-flat sector is detected then the series is terminated and a group of previously received flat sectors is written to the flash memory in the original order prior to the last received, first non-flat, write. Although those sectors may no longer exist in the sector buffer they can be recreated by the controller 16 which has information about their data pattern. Having done that, there is no need to mark those sectors as erased in the SAT and the SAT will be updated with their virtual memory addresses as in the prior art system. An alternative process is marking all the flat sectors as erased in SAT without writing them to flash 20. In this case not all the logical sectors written by the same command will be written or erased so they will be handled differently in future write and read commands. However, normally the sectors sent by the same command belong to the same file and it is preferable therefore to handle them all in uniform manner to simplify the operation and improve performance.


In a third embodiment of the implementation of the write sector command the controller 16 checks the pattern of a series of the informing sectors and writes them to flash 20 in the normal way.


When all the sectors of the series are of the same flat pattern then the sectors are erased and the SAT is updated by their patterns. The case when all the sectors have repetitive data, but different from each other is handled similarly. This method is slow as the sectors are written and then erased, but, is more reliable as the latest copies of the sectors would not be lost if the write command is terminated and the power is turned off.


In each of the above embodiments of the implementation of the write sector command the obsolete copies of the sectors rewritten or erased by the write command should be marked obsolete in a Current Obsolete Block list (COB) which is maintained by the controller for subsequent bulk erasure and erased upon the issuing of an erase sector command sent from the host 12. The erasure process is performed as a foreground operation during the sector write process. At the end of the write command the SAT must be updated in flash 20 to record the latest change of the sectors erased or marked as erased, as well as this the control data structures in flash should be updated to record the latest COB. Recording the latest COB is particularly important, as upon erasing a sector the controller has no record of whether the latest existing copy of the sector was written before or after the sector was erased. The updated COB will therefore contain the correct information about obsolete sector copies. In the context of the system being described, the read operation is implemented similarly to that shown in FIG. 2 (prior art) which illustrates by the read operation of the “Memory System”, detailed in patent application WO 00/49488.


If the sector to be read from the flash memory 20 is found to marked as erased in the SAT then the controller 16 programs the pattern output circuit 23b located in host interface control 22 (FIG. 4a) by the repetitive sector pattern. The host then receives the original sector data generated by the pattern output circuit 23b instead of being read from flash 20.


When the erase sector command is issued by the host the sectors are marked as erased in the SAT with the default pattern. The obsolete copies of the sectors, if there are any not erased previously, must also be erased.


As the erasure of flash memory 20 is often a relatively long operation the controller 16 uses a technique of marking the sectors as erased in SAT without physically erasing them, as described above in case 3 of the SAT entry format. Having collected a group of such sectors the controller 20 is then able to erase many memory sectors at once by a single flash erase operation. This ability to perform block erasure is defined by flash memory architecture.


Various modifications may be made, for example, the ROM and the expansion port included in the controller of FIGS. 4a and 4b are optional components only. The logical address identifying each sector has been described as a sequential Logical Block Address, however, an address in the Cylinder/Head/Sector (CHS) format originally used with magnetic disk devices may be used. It should also be noted that pages within the flash array have been described as being equivalent to a sector; however, in some AND flash memory chips a page may comprise four sectors and have a capacity of 211 bytes.


Although the present invention has been described in terms of specific embodiments it is anticipated that alterations and modifications thereof will no doubt become apparent to those skilled in the art. It is therefore intended that the following claims be interpreted as covering all such alterations and modification as fall within the true spirit and scope of the invention.

Claims
  • 1. A method of operating a memory device, the method comprising: assigning one or more logical sector addresses to one or more physical sector addresses of a non-volatile portion of the memory device and maintaining a sector allocation table comprising the assigned logical sector to physical sector addresses;receiving a logical sector of data having two or more data portions to be stored in the memory device;checking the logical sector of data to detect a presence of repetitive data in the logical sector of data prior to writing the logical sector of data to the memory device; andstoring a single portion of the logical sector of data in the sector allocation table without writing any portion of the logical sector of data to a physical sector of the non-volatile portion of the memory device when repetitive data is detected in the logical sector of data.
  • 2. The method of claim 1, further comprising writing the logical sector of data to an assigned physical sector of the non-volatile portion of the memory device when repetitive data is not detected in the logical sector of data.
  • 3. The method of claim 1, wherein storing the single portion of the logical sector of data in the sector allocation table further comprises storing the single portion of the logical sector of data in the sector allocation table where the single portion comprises a single portion of a pattern of the repetitive data detected in the logical sector of data.
  • 4. The method of claim 1, wherein checking the logical sector of data to detect a presence of repetitive data further comprises checking the logical sector of data to detect a presence of repetitive data where repetitive data is detected if each portion of the two or more data portions is equal to each other data portion of the logical sector of data.
  • 5. The method of claim 1, wherein receiving a logical sector of data having two or more data portions further comprises receiving a logical sector of data having two or more data portions where each data portion comprises a byte of data.
  • 6. The method of claim 1, wherein storing a single portion of the logical sector of data in the sector allocation table without writing any portion of the logical sector of data to a physical sector of a non-volatile portion of the memory device further comprises storing the single portion of the logical of data in the sector allocation table and marking the associated logical sector address as erased.
  • 7. The method of claim 6, further comprising performing a read operation in response to a received logical sector read command where the logical sector read command comprises a read command and a logical read address.
  • 8. The method of claim 7, wherein performing a read operation further comprises performing a read operation by accessing a logical address of the sector allocation table comprising the logical read address.
  • 9. The method of claim 8, wherein performing a read operation by accessing a logical address of the sector allocation table comprising the logical read address further comprises retrieving the single portion of data stored along with its associated logical sector address stored in the sector allocation table if the associated logical sector address is marked as erased.
  • 10. The method of claim 1, wherein checking the logical sector of data to detect a presence of repetitive data in the logical sector of data further comprises detecting a presence of repetitive data in the logical sector of data by XOR-ing each of the two or more data portions with each other data portion comprising the two or more data portions to determine the presence of a flat repetitive pattern in the logical sector of data.
  • 11. A method of maintaining a sector allocation table for a memory device where the sector allocation table comprises logical sector address fields and associated physical sector address fields corresponding to physical addresses of a non-volatile portion of the memory device, the method comprising: receiving one or more logical sectors of data to be stored in the memory device, each logical sector of data having an associated logical sector address;checking the one or more logical sectors of data to detect the presence of repetitive data in the one or more logical sectors of data prior to storing the one or more logical sectors of data in the non-volatile portion of the memory device; andstoring a portion of the one or more logical sectors of data in the sector allocation table along with an associated logical sector address without storing any portion of the one or more logical sectors of data in associated physical sectors of the memory device when repetitive data is detected.
  • 12. The method of claim 11, further comprising storing each of the one or more logical sectors of data in one or more physical sectors of memory associated with each of the logical sector addresses when repetitive data is not detected.
  • 13. The method of claim 11, wherein storing a portion of the one or more logical sectors of data in the sector allocation table further comprises storing a portion of the one or more logical sectors of data in the sector allocation table where the portion of the one or more logical sectors of data comprises a single portion of a pattern of data comprising the detected repetitive data.
  • 14. A method of maintaining a sector allocation table for a memory device comprising an array of non-volatile memory cells, the method comprising: receiving a sector of data having an associated logical sector address;determining if repetitive data is present in the received sector of data prior to storing the sector of data in the array of non-volatile memory cells; andstoring a repeated portion of the sector of data in the sector allocation table along with the associated logical sector address without storing any portion of the sector of data in the array of non-volatile memory cells if repetitive data is determined to be present in the sector of data.
  • 15. The method of claim 14, further comprising programming the received sector of data into a physical address of a location in the array of non-volatile memory cells if repetitive data is not determined to be present in the sector of data, where the physical address of the location in the array of non-volatile memory cells is associated with the logical sector address associated with the received sector of data.
  • 16. The method of claim 14, wherein storing a repeated portion of the sector of data in the sector allocation table along with the associated logical sector address further comprises storing in a volatile memory portion of the memory device.
  • 17. A method of programming a memory device comprising volatile and non-volatile memory portions, the method comprising: determining when a repetitive pattern of data is present in a sector of data to be stored in the memory device; andstoring a portion of the sector of data in a sector allocation table along with an associated logical sector address without storing any portion of the sector of data in the non-volatile portion of the memory device when a repetitive pattern of data is determined to be present in the sector of data;wherein the sector allocation table is stored in the volatile memory portion of the memory device.
  • 18. The method of claim 17, further comprising storing the sector of data in a physical address location of the non-volatile memory portion when a repetitive pattern of data is not determined to be present in the sector of data.
  • 19. The method of claim 18, wherein storing a portion of the sector of data in a sector allocation table along with an associated logical sector address further comprises storing a portion of the sector of data in a sector allocation table along with an associated logical sector address and marking the associated logical address as erased.
  • 20. The method of claim 19, further comprising retrieving a sector of data stored in the memory device and associated with a logical address where the sector of data is retrieved from the sector allocation table when the logical address associated with the sector of data to retrieve is marked as erased.
  • 21. The method of claim 19, further comprising retrieving a sector of data stored in the memory device and associated with a logical address where the sector of data is retrieved from a physical address location of the non-volatile memory portion of the memory device, where the physical address location is associated with the logical address which is associated with the sector of data to be retrieved, and where the associated logical address is not marked as erased.
  • 22. A memory device, comprising: an array of non-volatile memory cells arranged in one or more physical sectors of memory cells;a controller, wherein the controller is configured to maintain a sector allocation table having a plurality of logical sector address fields and a plurality of corresponding physical sector address fields; anda pattern detection circuit, wherein the pattern detection circuit is configured to identify a presence of repetitive data in a logical sector of data to be stored in the memory device;wherein a portion of a logical sector of data identified by the pattern detection circuit to comprise repetitive data is stored in the sector allocation table along with an associated logical sector address without storing any portion of the logical sector of data in a physical sector of memory cells.
  • 23. The memory device of claim 22, wherein a logical sector of data not having been identified by the pattern detection circuit to comprise repetitive data is programmed to a physical sector of non-volatile memory cells associated with a logical sector address associated with the logical sector of data.
  • 24. The memory device of claim 22, wherein the pattern detection circuit comprises XOR logic circuitry.
  • 25. The memory device of claim 22, further comprising a volatile memory device configured to store the sector allocation table.
Priority Claims (1)
Number Date Country Kind
0123410.3 Sep 2001 GB national
CROSS REFERENCE TO RELATED APPLICATION

This application is a Continuation of U.S. application Ser. No. 10/256,891, titled “MEMORY SYSTEM FOR DATA STORAGE AND RETRIEVAL,” filed Sep. 27, 2002 now U.S. Pat. No. 7,634,624, which claims the benefit of the priority date of British Application No. 0123410.3, entitled “MEMORY SYSTEM FOR DATA STORAGE AND RETRIEVAL,” filed on Sep. 28, 2001.

US Referenced Citations (266)
Number Name Date Kind
4099069 Cricchi et al. Jul 1978 A
4130900 Watanabe Dec 1978 A
4210959 Wozniak Jul 1980 A
4309627 Tabata Jan 1982 A
4355376 Gould Oct 1982 A
4398248 Hsia et al. Aug 1983 A
4405952 Slakmon Sep 1983 A
4414627 Nakamura Nov 1983 A
4450559 Bond et al. May 1984 A
4456971 Fukuda et al. Jun 1984 A
4468730 Dodd et al. Aug 1984 A
4473878 Zolnowsky et al. Sep 1984 A
4476526 Dodd Oct 1984 A
4498146 Martinez Feb 1985 A
4525839 Nozawa et al. Jun 1985 A
4532590 Wallach et al. Jul 1985 A
4609833 Gutterman Sep 1986 A
4616311 Sato Oct 1986 A
4654847 Dutton Mar 1987 A
4710871 Belknap et al. Dec 1987 A
4746998 Robinson et al. May 1988 A
4748320 Yorimoto et al. May 1988 A
4757474 Fukushi et al. Jul 1988 A
4774700 Satoh et al. Sep 1988 A
4780855 Iida et al. Oct 1988 A
4788665 Fukuda et al. Nov 1988 A
4797543 Watanabe Jan 1989 A
4800520 Iijima Jan 1989 A
4829169 Watanabe May 1989 A
4843224 Ohta et al. Jun 1989 A
4845662 Tokumitsu Jul 1989 A
4896262 Wayama et al. Jan 1990 A
4914529 Bonke Apr 1990 A
4920518 Nakamura et al. Apr 1990 A
4924331 Robinson et al. May 1990 A
4943745 Watanabe et al. Jul 1990 A
4953122 Williams Aug 1990 A
4970642 Yamamura Nov 1990 A
4970727 Miyawaki et al. Nov 1990 A
5070474 Tuma et al. Dec 1991 A
5093785 Iijima Mar 1992 A
5168465 Harari Dec 1992 A
5198380 Harari Mar 1993 A
5200959 Gross et al. Apr 1993 A
5218695 Noveck et al. Jun 1993 A
5220518 Haq Jun 1993 A
5226168 Kobayashi et al. Jul 1993 A
5227714 Lou Jul 1993 A
5253351 Yamamoto et al. Oct 1993 A
5267218 Elbert Nov 1993 A
5268318 Harari Dec 1993 A
5268870 Harari Dec 1993 A
5270979 Harari et al. Dec 1993 A
5293560 Harari Mar 1994 A
5297148 Harari et al. Mar 1994 A
5303198 Adachi et al. Apr 1994 A
5305276 Uenoyama Apr 1994 A
5305278 Inoue Apr 1994 A
5315541 Harari et al. May 1994 A
5315558 Hag May 1994 A
5329491 Brown et al. Jul 1994 A
5337275 Garner Aug 1994 A
5341330 Wells et al. Aug 1994 A
5341339 Wells Aug 1994 A
5341341 Fukuzo Aug 1994 A
5353256 Fandrich et al. Oct 1994 A
5357475 Hasbun et al. Oct 1994 A
5359569 Fujita et al. Oct 1994 A
5365127 Manley Nov 1994 A
5369615 Harari et al. Nov 1994 A
5371702 Nakai et al. Dec 1994 A
5381539 Yanai et al. Jan 1995 A
5382839 Shinohara Jan 1995 A
5384743 Rouy Jan 1995 A
5388083 Assar et al. Feb 1995 A
5396468 Harari et al. Mar 1995 A
5404485 Ban Apr 1995 A
5406527 Honma Apr 1995 A
5418752 Harari et al. May 1995 A
5422842 Cernea et al. Jun 1995 A
5422856 Sasaki et al. Jun 1995 A
5428621 Mehrotra et al. Jun 1995 A
5430682 Ishikawa et al. Jul 1995 A
5430859 Norman et al. Jul 1995 A
5431330 Wieres Jul 1995 A
5434825 Harari Jul 1995 A
5438573 Mangan et al. Aug 1995 A
5465235 Miyamoto Nov 1995 A
5465338 Clay Nov 1995 A
5471478 Mangan et al. Nov 1995 A
5473765 Gibbons et al. Dec 1995 A
5479638 Assar et al. Dec 1995 A
5485595 Assar et al. Jan 1996 A
5490117 Oda et al. Feb 1996 A
5495442 Cernea et al. Feb 1996 A
5504760 Harari et al. Apr 1996 A
5508971 Cernea et al. Apr 1996 A
5513138 Manabe et al. Apr 1996 A
5515333 Fujita et al. May 1996 A
5519847 Fandrich et al. May 1996 A
5523980 Sakui et al. Jun 1996 A
5524230 Sakaue et al. Jun 1996 A
5530673 Tobita et al. Jun 1996 A
5530828 Kaki et al. Jun 1996 A
5530938 Akasaka et al. Jun 1996 A
5532962 Auclair et al. Jul 1996 A
5532964 Cernea et al. Jul 1996 A
5534456 Yuan et al. Jul 1996 A
5535328 Harari et al. Jul 1996 A
5541551 Brehner et al. Jul 1996 A
5544118 Harari Aug 1996 A
5544356 Robinson et al. Aug 1996 A
5552698 Tai et al. Sep 1996 A
5554553 Harari Sep 1996 A
5563825 Cernea et al. Oct 1996 A
5566314 DeMarco et al. Oct 1996 A
5568439 Harari Oct 1996 A
5572466 Sukegawa Nov 1996 A
5579502 Konishi et al. Nov 1996 A
5581723 Hasbun et al. Dec 1996 A
5583812 Harari Dec 1996 A
5592415 Kato et al. Jan 1997 A
5592420 Cernea et al. Jan 1997 A
5596526 Assar et al. Jan 1997 A
5598370 Niijima et al. Jan 1997 A
5600316 Moll Feb 1997 A
5602987 Harari et al. Feb 1997 A
5603001 Sukegawa et al. Feb 1997 A
5606660 Estakhri et al. Feb 1997 A
5611067 Okamoto et al. Mar 1997 A
5640528 Harney et al. Jun 1997 A
5642312 Harari Jun 1997 A
5648929 Miyamoto Jul 1997 A
5663901 Wallace et al. Sep 1997 A
5693570 Cernea et al. Dec 1997 A
5712819 Harari Jan 1998 A
5719808 Harari et al. Feb 1998 A
5723990 Roohparvar Mar 1998 A
5734567 Griffiths et al. Mar 1998 A
5745418 Ma et al. Apr 1998 A
5754567 Norman May 1998 A
5757712 Nagel et al. May 1998 A
5758100 Odisho May 1998 A
5761117 Uchino et al. Jun 1998 A
5768190 Tanaka et al. Jun 1998 A
5768195 Nakamura et al. Jun 1998 A
5773901 Kantner Jun 1998 A
5778418 Auclair et al. Jul 1998 A
5781478 Takeuchi et al. Jul 1998 A
5787445 Daberko Jul 1998 A
5787484 Norman Jul 1998 A
RE35881 Barrett et al. Aug 1998 E
5799168 Ban Aug 1998 A
5802551 Komatsu et al. Sep 1998 A
5809515 Kaki et al. Sep 1998 A
5809558 Matthews et al. Sep 1998 A
5809560 Schneider Sep 1998 A
5818350 Estakhri et al. Oct 1998 A
5818781 Estakhri et al. Oct 1998 A
5822245 Gupta et al. Oct 1998 A
5822252 Lee et al. Oct 1998 A
5822781 Wells et al. Oct 1998 A
5831929 Manning Nov 1998 A
5835935 Estakhri et al. Nov 1998 A
5838614 Estakhri et al. Nov 1998 A
5845313 Estakhri et al. Dec 1998 A
5847552 Brown Dec 1998 A
5860083 Sukegawa Jan 1999 A
5860124 Matthews et al. Jan 1999 A
5862099 Gannage et al. Jan 1999 A
5890192 Lee et al. Mar 1999 A
5901086 Wang et al. May 1999 A
5907856 Estakhri et al. May 1999 A
5909586 Anderson Jun 1999 A
5920884 Jennings, III et al. Jul 1999 A
5924113 Estakhri et al. Jul 1999 A
5928370 Asnaashari Jul 1999 A
5930815 Estakhri et al. Jul 1999 A
5933368 Ma et al. Aug 1999 A
5933846 Endo Aug 1999 A
5936971 Harari et al. Aug 1999 A
5937425 Ban Aug 1999 A
5953737 Estakhri et al. Sep 1999 A
5956473 Ma et al. Sep 1999 A
5959926 Jones et al. Sep 1999 A
5966727 Nishino Oct 1999 A
5986933 Takeuchi et al. Nov 1999 A
5987563 Itoh et al. Nov 1999 A
5987573 Hiraka Nov 1999 A
5991847 Ballard et al. Nov 1999 A
5991849 Yamada et al. Nov 1999 A
6000006 Bruce et al. Dec 1999 A
6011322 Stumfall et al. Jan 2000 A
6011323 Camp Jan 2000 A
6018265 Keshtbod Jan 2000 A
6021408 Ledain et al. Feb 2000 A
6026020 Matsubara et al. Feb 2000 A
6026027 Terrell, II et al. Feb 2000 A
6034897 Estakhri et al. Mar 2000 A
6035357 Sakaki Mar 2000 A
6040997 Estakhri Mar 2000 A
6041001 Estakhri Mar 2000 A
6047352 Lakhani et al. Apr 2000 A
6055184 Acharya et al. Apr 2000 A
6055188 Takeuchi et al. Apr 2000 A
6069827 Sinclair May 2000 A
6072796 Christensen et al. Jun 2000 A
6076137 Asnaashari Jun 2000 A
6081447 Lofgren et al. Jun 2000 A
6081878 Estakhri et al. Jun 2000 A
6084483 Keshtbod Jul 2000 A
6097666 Sakui et al. Aug 2000 A
6115785 Estakhri et al. Sep 2000 A
6122195 Estakhri et al. Sep 2000 A
6125424 Komatsu et al. Sep 2000 A
6125435 Estakhri et al. Sep 2000 A
6128695 Estakhri et al. Oct 2000 A
6134145 Wong Oct 2000 A
6134151 Estakhri et al. Oct 2000 A
6141249 Estakhri et al. Oct 2000 A
6145051 Estakhri et al. Nov 2000 A
6151247 Estakhri et al. Nov 2000 A
6172906 Estakhri et al. Jan 2001 B1
6173362 Yoda Jan 2001 B1
6181118 Meehan et al. Jan 2001 B1
6182162 Estakhri et al. Jan 2001 B1
6202138 Estakhri et al. Mar 2001 B1
6223308 Estakhri et al. Apr 2001 B1
6226708 McGoldrick et al. May 2001 B1
6230234 Estakhri et al. May 2001 B1
6262918 Estakhri et al. Jul 2001 B1
6272610 Katayama et al. Aug 2001 B1
6275436 Tobita et al. Aug 2001 B1
6279069 Robinson et al. Aug 2001 B1
6279114 Toombs et al. Aug 2001 B1
6285607 Sinclair Sep 2001 B1
6327639 Asnaashari Dec 2001 B1
6345367 Sinclair Feb 2002 B1
6374337 Estakhri Apr 2002 B1
6385667 Estakhri et al. May 2002 B1
6393513 Estakhri et al. May 2002 B2
6397314 Estakhri et al. May 2002 B1
6411546 Estakhri et al. Jun 2002 B1
6467021 Sinclair Oct 2002 B1
6490649 Sinclair Dec 2002 B2
6567307 Estakhri May 2003 B1
6571318 Sander et al. May 2003 B1
6578127 Sinclair Jun 2003 B1
6587382 Estakhri et al. Jul 2003 B1
6711059 Sinclair et al. Mar 2004 B2
6721819 Estakhri et al. Apr 2004 B2
6721843 Estakhri Apr 2004 B1
6725321 Sinclair et al. Apr 2004 B1
6725342 Coulson Apr 2004 B1
6728851 Estakhri et al. Apr 2004 B1
6751155 Gorobets Jun 2004 B2
6757800 Estakhri et al. Jun 2004 B1
6813678 Sinclair et al. Nov 2004 B1
6898662 Gorobets May 2005 B2
6912618 Estakhri et al. Jun 2005 B2
6950918 Estakhri Sep 2005 B1
6957295 Estakhri Oct 2005 B1
6973519 Estakhri et al. Dec 2005 B1
6978342 Estakhri et al. Dec 2005 B1
7000064 Payne et al. Feb 2006 B2
20030033471 Lin et al. Feb 2003 A1
Foreign Referenced Citations (77)
Number Date Country
0 557 723 Jan 1987 AU
0 220 718 May 1987 EP
0 243 503 Nov 1987 EP
0 392 895 Oct 1990 EP
0 424 191 Apr 1991 EP
0 489 204 Jun 1992 EP
0 522 780 Jan 1993 EP
0 522 780 Jan 1993 EP
0 544 252 Jun 1993 EP
0 613 151 Aug 1994 EP
0 617 363 Sep 1994 EP
0 619 541 Oct 1994 EP
0 663 636 Jul 1995 EP
0 686 976 Dec 1995 EP
0 897 579 Jul 2000 EP
0 891 580 Nov 2000 EP
0 896 669 Nov 2000 EP
0 852 766 May 2001 EP
0 852 765 Sep 2001 EP
0 722 585 May 2002 EP
0 910 826 Jun 2002 EP
0 691 008 Nov 2002 EP
0 861 468 Apr 2003 EP
0 978 040 May 2004 EP
1 157 328 May 2005 EP
93 01908 Aug 1993 FR
2 251 323 Jul 1992 GB
2 291 990 Feb 1996 GB
2 291 991 Feb 1996 GB
2 297 637 Jul 1996 GB
2 304 428 Mar 1997 GB
2 348 991 Dec 2002 GB
2 351 822 Jan 2003 GB
2 384 337 Jul 2003 GB
2 384 883 Oct 2005 GB
2 384 338 Nov 2005 GB
2 384 072 Dec 2005 GB
2 411 499 Feb 2006 GB
117881 May 2003 IS
59-45695 Sep 1982 JP
58-21594 Dec 1983 JP
58-21595 Dec 1983 JP
59-162695 Sep 1984 JP
60-212900 Oct 1985 JP
61-96598 May 1986 JP
62-283496 Dec 1987 JP
62-283497 Dec 1987 JP
63-183700 Jul 1988 JP
1-138694 May 1989 JP
3-228377 Oct 1991 JP
4-57295 Feb 1992 JP
4-254994 Sep 1992 JP
4-298284 Sep 1992 JP
4-278297 Oct 1992 JP
4-332999 Nov 1992 JP
5-128877 May 1993 JP
5-282883 Oct 1993 JP
6-36578 Feb 1994 JP
6-124175 May 1994 JP
6-124231 May 1994 JP
6-132747 May 1994 JP
6-149395 May 1994 JP
6-131889 Jun 1994 JP
6-266596 Sep 1994 JP
7-93499 Apr 1995 JP
7-311708 Nov 1995 JP
8-18018 Jan 1996 JP
8-69696 Mar 1996 JP
9-147581 Jun 1997 JP
1388877 Apr 1988 SU
1408439 Jul 1988 SU
1515164 Oct 1989 SU
1541619 Feb 1990 SU
1573458 Jun 1990 SU
1686449 Oct 1991 SU
WO 8400628 Feb 1984 WO
WO 9420906 Sep 1994 WO
Related Publications (1)
Number Date Country
20100095055 A1 Apr 2010 US
Continuations (1)
Number Date Country
Parent 10256891 Sep 2002 US
Child 12638572 US