US 6,914,846 B2Grant
Flash EEprom system
Issue Date:2005-07-05
•12 Claims
•6 Drawing Sheets
Abstract
A system of Flash EEprom memory chips with controlling circuits serves as non-volatile memory such as that provided by magnetic disk drives. Improvements include selective multiple sector erase, in which any combinations of Flash sectors may be erased together. Selective sectors among the selected combination may also be de-selected during the erase operation. Another improvement is the ability to remap and replace defective cells with substitute cells. The remapping is performed automatically as soon as a defective cell is detected. When the number of defects in a Flash sector becomes large, the whole sector is remapped. Yet another improvement is the use of a write cache to reduce the number of writes to the Flash EEprom memory, thereby minimizing the stress to the device from undergoing too many write/erase cycling.
Metadata
Assignee
- SanDisk Corporation
Inventors
- Eliyahou Harari
- Robert D. Norman
- Sanjay Mehrotra
Application Information
Application Number:US 10/331,081
Filing Date:2002-12-26
Priority Date:1989-04-13
Art Unit:2135
Patent Drawings (6 sheets)
Description
Cross-Reference Related Applications
[0001] This is a continuation of application Ser. No. 09/657,482, filed Sep. 8, 2000 U.S. Pat. No. 6,523,132; which in turn is a continuation of application Ser. No. 08/789,421, filed Jan. 29, 1997, now U.S. Pat. No. 6,149,316; which in turn is a continuation of Ser. No. 08/174,768, filed Dec. 29, 1993, now U.S. Pat. No. 5,602,987; which in turn is a continuation of Ser. No. 07/963,838; filed Oct. 20, 1992, now U.S. Pat. No. 5,297,148; which in turn is a divisional of Ser. No. 07/337,566; filed Apr. 13, 1989, now abandoned.
Background of the Invention
[0002] This invention relates generally to semiconductor electrically erasable programmable read only memories (EEprom), and specifically to a system of integrated circuit Flash EEprom chips.
[0003] Computer systems typically use magnetic disk drives for mass storage of data. However, disk drives are disadvantageous in that they are bulky and in their requirement for high precision moving mechanical parts. Consequently they are not rugged and are prone to reliability problems, as well as consuming significant amounts of power. Solid state memory devices such as DRAM's and SRAM's do not suffer from these disadvantages. However, they are much more expensive, and require constant power to maintain their memory (volatile). Consequently, they are typically used as temporary storage.
[0004] EEprom's and Flash EEprom's are also solid state memory devices. Moreover, they are nonvolatile, and retain their memory even after power is shut down. However, conventional Flash EEprom's have a limited lifetime in terms of the number of write (or program)/erase cycles they can endure. Typically the devices are rendered unreliable after 102 to 103 write/erase cycles. Traditionally, they are typically used in applications where semi-permanent storage of data or program is required but with a limited need for reprogramming.
[0005] Accordingly, it is an object of the present invention to provide a Flash EEprom memory system with enhanced performance and which remains reliable after enduring a large number of write/erase cycles.
[0006] It is another object of the present invention to provide an improved Flash EEprom system which can serve as non-volatile memory in a computer system.
[0007] It is another object of the present invention to provide an improved Flash EEprom system that can replace magnetic disk storage devices in computer systems.
[0008] It is another object of the present invention to provide a Flash EEprom system with improved erase operation.
[0009] It is another object of the present invention to provide a Flash EEprom system with improved error correction.
[0010] It is yet another object of the present invention to provide a Flash EEprom with improved write operation that minimizes stress to the Flash EEprom device.
[0011] It is still another object of the present invention to provide a Flash EEprom system with enhanced write operation.
Summary of the Invention
[0012] These and additional objects are accomplished by improvements in the architecture of a system of EEprom chips, and the circuits and techniques therein.
[0013] According to one aspect of the present invention, an array of Flash EEprom cells on a chip is organized into sectors such that all cells within each sector are erasable at once. A Flash EEprom memory system comprises one or more Flash EEprom chips under the control of a controller. The invention allows any combination of sectors among the chips to be selected and then erased simultaneously. This is faster and more efficient than prior art schemes where all the sectors must be erased every time or only one sector at a time can be erased. The invention further allows any combination of sectors selected for erase to be deselected and prevented from further erasing during the erase operation. This feature is important for stopping those sectors that are first to be erased correctly to the “erased” state from over erasing, thereby preventing unnecessary stress to the Flash EEprom device. The invention also allows a global de-select of all sectors in the system so that no sectors are selected for erase. This global reset can quickly put the system back to its initial state ready for selecting the next combination of sectors for erase. Another feature of the invention is that the selection is independent of the chip select signal which enables a particular chip for read or write operation. Therefore it is possible to perform an erase operation on some of the Flash EEprom chips while read and write operations may be performed on other chips not involved in the erase operation.
[0014] According to another aspect of the invention, improved error correction circuits and techniques are used to correct for errors arising from defective Flash EEprom memory cells. One feature of the invention allows defect mapping at cell level in which a defective cell is replaced by a substitute cell from the same sector. The defect pointer which connects the address of the defective cell to that of the substitute cell is stored in a defect map. Every time the defective cell is accessed, its bad data is replaced by the good data from the substitute cell.
[0015] Another feature of the invention allows defect mapping at the sector level. When the number of defective cells in a sector exceeds a predetermined number, the sector containing the defective cells is replaced by a substitute sector.
[0016] An important feature of the invention allows defective cells or defective sectors to be remapped as soon as they are detected thereby enabling error correction codes to adequately rectify the relatively few errors that may crop up in the system.
[0017] According to yet another aspect of the present invention, a write cache is used to minimize the number of writes to the Flash EEprom memory. In this way the Flash EEprom memory will be subject to fewer stress inducing write/erase cycles, thereby retarding its aging. The most active data files are written to the cache memory instead of the Flash EEprom memory. Only when the activity levels have reduced to a predetermined level are the data files written from the cache memory to the Flash EEprom memory. Another advantage of the invention is the increase in write throughput by virtue of the faster cache memory.
[0018] According to yet another aspect of the present invention, one or more printed circuit cards are provided which contain controller and EEprom circuit chips for use in a computer system memory for long term, non-volatile storage, in place of a hard disk system, and which incorporate various of the other aspects of this invention alone and in combination.
[0019] Additional objects, features, and advantages of the present invention will be understood from the following description of its preferred embodiments, which description should be taken in conjunction with the accompanying drawings.
Brief Description of the Drawings
[0020] FIG. 1A is a general micrprocessor system including the Flash EEprom memory system of the present invention;
[0021] FIG. 1B is schematic block diagram illustrating a system including a number of Flash EEprom memory chips and a controller chip;
[0022] FIG. 2 is a schematic illustration of a system of Flash EEprom chips, among which memory sectors are selected to be erased;
[0023] FIG. 3A is a block circuit diagram in the controller for implementing selective multiple sector erase according to the preferred embodiment;
[0024] FIG. 3B shows details of a typical register used to select a sector for erase as shown in FIG. 2A ;
[0025] FIG. 4 is a flow diagram illustrating the erase sequence of selective multiple sector erase;
[0026] FIG. 5 is a schematic illustration showing the partitioning of a Flash EEprom sector into a data area and a spare redundant area;
[0027] FIG. 6 is a circuit block diagram illustrating the data path control during read operation using the defect mapping scheme of the preferred embodiment;
[0028] FIG. 7 is a circuit block diagram illustrating the data path control during the write operation using the defect mapping scheme of the preferred embodiment;
[0029] FIG. 8 is a block diagram illustrating the write cache circuit inside the controller.
Description of the Preferred Embodiments Eeprom System
[0030] A computer system in which the various aspects of the present invention are incorporated is illustrated generally in FIG. 1A. A typical computer system architecture includes a microprocessor 21 connected to a system bus 23, along with random access, main system memory 25, and at least one or more input-output devices 27, such as a keyboard, monitor, modem, and the like. Another main computer system component that is connected to a typical computer system bus 23 is a large amount of long-term, non-volatile memory 29. Typically, such a memory is a disk drive with a capacity of tens of megabytes of data storage. This data is retrieved into the system volatile memory 25 for use in current processing, and can be easily supplemented, changed or altered.
[0031] One aspect of the present invention is the substitution of a specific type of semiconductor memory system for the disk drive but without having to sacrifice non-volatility, ease of erasing and rewriting data into the memory, speed of access, low cost and reliability. This is accomplished by employing an array of electrically erasable programmable read only memories (EEprom's) integrated circuit chips. This type of memory has additional advantages of requiring less power to operate, and of being lighter in weight than a hard disk drive magnetic media memory, thereby being especially suited for battery operated portable computers.
[0032] The bulk storage memory 29 is constructed of a memory controller 31, connected to the computer system bus 23, and an array 33 of EEprom integrated circuit chips. Data and instructions are communicated from the controller 31 to the EEprom array 33 primarily over a serial data line 35. Similarly, data and status signals are communicated from the EEprom 33 to the controller 31 over serial data lines 37. Other control and status circuits between the controller 31 and the EEprom array 33 are not shown in FIG. 1A.
[0033] Referring to FIG. 1B , the controller 31 is preferably formed primarily on a single integrated circuit chip. It is connected to the system address and data bus 39, part of the system bus 33, as well as being connected to system control lines 41, which include interrupt, read, write and other usual computer system control lines.
[0034] The EEprom array 33 includes a number of EEprom integrated circuit chips 43, 45, 47, etc. Each includes a respective chip select and enable line 49, 51 and 53 from interface circuits 40. The interface circuits 40 also act to interface between the serial data lines 35, 37 and a circuit 55. Memory location addresses and data being written into or read from the EEprom chips 43, 45, 47, etc. are communicated from a bus 55, through logic and register circuits 57 and thence by another bus 59 to each of the memory chips 43, 45, 47 etc.
[0035] The bulk storage memory 29 of FIGS. 1A and 1B can be implemented on a single printed circuit card for moderate memory sizes. The various lines of the system buses 39 and 41 of FIG. 1B are terminated in connecting pins of such a card for connection with the rest of the computer system through a connector. Also connected to the card and its components are various standard power supply voltages (not shown).
[0036] For large amounts of memory, that which is conveniently provided by a single array 33 may not be enough. In such a case, additional EEprom arrays can be connected to the serial data lines 35 and 37 of the controller chip 31, as indicated in FIG. 1B. This is preferably all done on a single printed circuit card but if space is not sufficient to do this, then one or more EEprom arrays may be implemented on a second printed circuit card that is physically mounted onto the first and connected to a common controller chip 31.
Erase of Memory Structures
[0037] In system designs that store data in files or blocks the data will need to be periodically updated with revised or new information. It may also be desirable to overwrite some no longer needed information, in order to accommodate additional information. In a Flash EEprom memory, the memory cells must first be erased before information is placed in them. That is, a write (or program) operation is always preceded by an erase operation.
[0038] In conventional Flash erase memory devices, the erase operation is done in one of several ways. For example, in some devices such as the Intel corporation's model 27F-256 CMOS Flash EEprom, the entire chip is erased at one time. If not all the information in the chip is to be erased, the information must first be temporarily saved, and is usually written into another memory (typically RAM). The information is then restored into the nonvolatile Flash erase memory by programming back into the device. This is very slow and requires extra memory as holding space.
[0039] In other devices such as Seeq Technology Incorporated's model 48512 Flash EEprom chip, the memory is divided into blocks (or sectors) that are each separately erasable, but only one at a time. By selecting the desired sector and going through the erase sequence the designated area is erased. While, the need for temporary memory is reduced, erase in various areas of the memory still requires a time consuming sequential approach.
[0040] In the present invention, the Flash EEprom memory is divided into sectors where all cells within each sector are erasable together. Each sector can be addressed separately and selected for erase. One important feature is the ability to select any combination of sectors for erase together. This will allow for a much faster system erase than by doing each one independently as in prior art.
[0041] FIG. 2 illustrates schematically selected multiple sectors for erase. A Flash EEprom system includes one or more Flash EEprom chips such as 201, 203, 205. They are in communication with a controller 31 through lines 209. Typically, the controller 31 is itself in communication with a microprocessor system (not shown). The memory in each Flash EEprom chip is partitioned into sectors where all memory cells within a sector are erasable together. For example, each sector may have 512 byte (i.e. 512×8 cells) available to the user, and a chip may have 1024 sectors. Each sector is individually addressable, and may be selected, such as sectors 211, 213, 215, 217 in a multiple sector erase. As illustrated in FIG. 2 , the selected sectors may be confined to one EEprom chip or be distributed among several chips in a system. The sectors that were selected will all be erased together. This capability will allow the memory and system of the present invention to operate much faster than the prior art architectures.
[0042] FIG. 3A illustrates a block diagram circuit 220 on a Flash EEprom chip (such as the chip 201 of FIG. 2 ) with which one or more sectors such as 211, 213 are selected (or deselected) for erase. Essentially, each sector such as 211, 213 is selected or tagged by setting the state of an erase enable register such as 221, 223 associated with the respective sectors. The selection and subsequent erase operations are performed under the control of the controller 31 (see FIG. 2). The circuit 220 is in communication with the controller 31 through lines 209. Command information from the controller is captured in the circuit 220 by a command register 225 through a serial interface 227. It is then decoded by a command decoder 229 which outputs various control signals. Similarly, address information is captured by an address register 231 and is decoded by an address decoder 233.
[0043] For example, in order to select the sector 211 for erase, the controller sends the address of the sector 211 to the circuit 220. The address is decoded in line 235 and is used in combination with a set erase enable signal in bus 237 to set an output 239 of the register 221 to HIGH. This enables the sector 211 in a subsequent erase operation. Similarly, if the sector 213 is also desired to be erased, its associated register 223 may be set HIGH.
[0044] FIG. 3B shows the structure of the register such as 221, 223 in more detail. The erase enable register 221 is a SET/RESET latch. Its set input 241 is obtained from the set erase enable signal in bus 237 gated by the address decode in line 235. Similarly, the reset input 243 is obtained from the clear erase enable signal in bus 237 gated by the address decode in line 235. In this way, when the set erase enable signal or the clear erase enable signal is issued to all the sectors, the signal is effective only on the sector that is being addressed.
[0045] After all sectors intended for erase have been selected, the controller then issues to the circuit 220, as well as all other chips in the system a global erase command in line 251 along with the high voltage for erasing in line 209. The device will then erase all the sectors that have been selected (i.e. the sectors 211 and 213) at one time. In addition to erasing the desired sectors within a chip, the architecture of the present system permits selection of sectors across various chips for simultaneous erase.
[0046] FIGS. 4(1)-4(11) illustrate the algorithm used in conjunction with the circuit 220 of FIG. 3A. In FIG. 4(1), the controller will shift the address into the circuit 220 which is decoded in the line to the erase enable register associated with the sector that is to be erased. In FIG. 4(2), the controller shifts in a command that is decoded to a set erase enable command which is used to latch the address decode signal onto the erase enable register for the addressed sector. This tags the sector for subsequent erase. In FIG. 4(3), if more sectors are to be tagged, the operations described relative to FIGS. 4(1)-4(2) are repeated until all sectors intended for erase have been tagged. After all sectors intended for erase have been tagged, the controller initiates an erase cycle as illustrated in FIG. 4(4).
[0047] Optimized erase implementations have been disclosed in two copending U.S. patent applications. They are copending U.S. patent applications, Ser. No. 204,175, filed Jun. 8, 1988, by Dr. Eliyahou Harari and one entitled “Multi-State EEprom Read and Write Circuits and Techniques,” filed on the same day as the present application, by Sanjay Mehrotra and Dr. Eliyahou Harari. The disclosures of the two applications are hereby incorporate by reference. The Flash EEprom cells are erased by applying a pulse of erasing voltage followed by a read to verify if the cells are erased to the “erased” state. If not, further pulsing and verifying are repeated until the cells are verified to be erased. By erasing in this controlled manner, the cells are not subject to over-erasure which tends to age the EEprom device prematurely as well as make the cells harder to program.
[0048] As the group of selected sectors is going through the erase cycle, some sectors will reach the “erase” state earlier than others. Another important feature of the present invention is the ability to remove those sectors that have been verified to be erased from the group of selected sectors, thereby preventing them from over-erasing.
[0049] Returning to FIG. 4(4), after all sectors intended for erase have been tagged, the controller initiates an erase cycle to erase the group of tagged sectors. In FIG. 4(5), the controller shifts in a global command called Enable Erase into each Flash EEprom chip that is to perform an erase. This is followed in FIG. 4(5) by the controller raising of the erase voltage line (Ve) to a specified value for a specified duration. The controller will lower this voltage at the end of the erase duration time. In FIG. 4(6), the controller will then do a read verify sequence on the sectors selected for erase. In FIG. 4 (7), if none of the sectors are verified, the sequences illustrated in FIGS. 4(5)-4(7) are repeated. In FIGS. 4(8) and 3(9), if one or more sectors are verified to be erased, they are taken out of the sequence. Referring also to FIG. 3A , this is achieved by having the controller address each of the verified sectors and clear the associated erase enable registers back to a LOW with a clear enable command in bus 237. The sequences illustrated in FIGS. 4(5)-(10) are repeated until all the sectors in the group are verified to be erased in FIG. 4(11). At the completion of the erase cycle, the controller will shift in a No Operation (NOP) command and the global Enable Erase command will be withdrawn as a protection against a false erasure.
[0050] The ability to select which sectors to erase and which ones not to, as well as which ones to stop erasing is advantageous. It will allow sectors that have erased before the slower erased sectors to be removed from the erase sequence so no further stress on the device will occur. This will increase the reliability of the system. Additional advantage is that if a sector is bad or is not used for some reason, that sector can be skipped over with no erase occurring within that sector. For example, if a sector is defective and have shorts in it, it may consume much power. A significant system advantage is gained by the present invention which allows it to be skipped on erase cycles so that it may greatly reduce the power required to erase the chip.
[0051] Another consideration in having the ability to pick the sectors to be erased within a device is the power savings to the system. The flexibility in erase configuration of the present invention enables the adaptation of the erase needs to the power capability of the system. This can be done by configuring the systems to be erased differently by software on a fixed basis between different systems. It also will allow the controller to adaptively change the amount of erasing being done by monitoring the voltage level in a system, such as a laptop computer.
[0052] An additional performance capability of the system in the present invention is the ability to issue a reset command to a Flash EEprom chip which will clear all erase enable latches and will prevent any further erase cycles from occurring. This is illustrated in FIGS. 2A and 2B by the reset signal in the line 261. By doing this in a global way to all the chips, less time will be taken to reset all the erase enable registers.
[0053] An additional performance capability is to have the ability to do erase operations without regard to chip select. Once an erase is started in some of the memory chips, the controller in the system can access other memory chips and do read and write operations on them. In addition, the device(s) doing the erase can be selected and have an address loaded for the next command following the erase.
Defect Mapping
[0054] Physical defects in memory devices give rise to hard errors. Data becomes corrupted whenever it is stored in the defective cells. In conventional memory devices such as RAM's and Disks, any physical defects arising from the manufacturing process are corrected at the factory. In RAM's, spare redundant memory cells on chip may be patched on, in place of the defective cells. In the traditional disk drive, the medium is imperfect and susceptible to defects. To overcome this problem manufacturers have devised various methods of operating with these defects present, the most usual being defect mapping of sectors. In a normal disk system the media is divided into cylinders and sectors. The sector being the basic unit in which data is stored. When a system is partitioned into the various sectors the sectors containing the defects are identified and are marked as bad and not to be used by the system. This is done in several ways. A defect map table is stored on a particular portion of the disk to be used by the interfacing controller. In addition, the bad sectors are marked as bad by special ID and flag markers. When the defect is addressed, the data that would normally be stored there is placed in an alternative location. The requirement for alternative sectors makes the system assign spare sectors at some specific interval or location. This reduces the amount of memory capacity and is a performance issue in how the alternative sectors are located.
[0055] One important application of the present invention is to replace a conventional disk storage device with a system incorporating an array of Flash EEprom memory chips. The EEprom system is preferably set up to emulate a conventional disk, and may be regarded as a “solid-state disk”.
[0056] In a “disk” system made from such solid-state memory devices, low cost considerations necessitate efficient handling of defects. Another important feature of the invention enables the error correction scheme to conserve as much memory as possible. Essentially, it calls for the defective cells to be remapped cell by cell rather than by throwing away the whole sector (512 bytes typically) whenever a defect occurs in it. This scheme is especially suited to the Flash EEprom medium since the majority of errors will be bit errors rather than a long stream of adjacent defects as is typical in traditional disk medium.
[0057] In both cases of the prior art RAM and magnetic disk, once the device is shipped from the factory, there is little or no provision for replacing hard errors resulting from physical defects that appear later during normal operation. Error corrections then mainly rely on schemes using error correction codes (ECC).
[0058] The nature of the Flash EEprom device predicates a higher rate of cell failure especially with increasing program/erase cycling. The hard errors that accumulate with use would eventually overwhelm the ECC and render the device unusable. One important feature of the present invention is the ability for the system to correct for hard errors whenever they occur. Defective cells are detected by their failure to program or erase correctly. Also during read operation, defective cells are detected and located by the ECC. As soon as a defective cell is identified, the controller will apply defect mapping to replace the defective cell with a space cell located usually within the same sector. This dynamic correction of hard errors, in addition to conventional error correction schemes, significantly prolongs the life of the device.
[0059] Another feature of the present invention is an adaptive approach to error correction. Error correction code (ECC) is employed at all times to correct for soft errors as well as any hard errors that may arise. As soon as a hard error is detected, defect mapping is used to replace the defective cell with a spare cell in the same sector block. Only when the number of defective cells in a sector exceeds the defect mapping's capacity for that specific sector will the whole sector be replaced as in a conventional disk system. This scheme minimized wastage without compromising reliability.
[0060] FIG. 5 illustrates the memory architecture for the cell remapping scheme. As described before, the Flash EEprom memory is organized into sectors where the cells in each sector are erasable together. The memory architecture has a typical sector 401 organized into a data portion 403 and a spare (or shadow) portion 405. The data portion 403 is memory space available to the user. The spare portion 405 is further organized into an alternative defects data area 407, a defect map area 409, a header area 411 and an ECC and others area 413. These areas contain information that could be used by the controller to handle the defects and other overhead information such as headers and ECC.
[0061] Whenever a defective cell is detected in the sector, a good cell in the alternative defects data area 407 is assigned to backup the data designated for the defective cell. Thus even if the defective cell stores the data incorrectly, an error-free copy is stored in the backup cell. The addresses of the defective cell and the backup cell are stored as defect pointers in the defect map 409.
[0062] It is to be understood that the partitioning between the user data portion 403 and the spare portion 405 need not be rigid. The relative size of the various partitioned areas may be logically reassigned. Also the grouping of the various areas is largely for the purpose of discussion and not necessarily physically so. For example, the alternative defects data area 407 has been schematically grouped under the spare portion 405 to express the point that the space it occupies is no longer available to the user.
[0063] In a read operation, the controller first reads the header, the defect map and the alternative defects data. It then reads the actual data. It keeps track of defective cells and the location of the substitute data by means of the defect map. Whenever a defective cell is encountered, the controller substitutes its bad data with the good data from the alternative defects.
[0064] FIG. 6 illustrates the read data path control in the preferred embodiment. A memory device 33 which may include a plurality of Flash EEprom chips is under the control of the controller 31. The controller 31 is itself part of a microcomputer system under the control of a microprocessor (not shown). To initiate the reading of a sector, the microprocessor loads a memory address generator 503 in the controller with a memory address for starting the read operation. This information is loaded through a microprocessor interface port 505. Then the microprocessor loads a DMA controller 507 with the starting location in buffer memory or bus address that the data read should be sent. Then the microprocessor loads the header information (Head, Cylinder and sector) into a holding register file 509. Finally, the microprocessor loads a command sequencer 511 with a read command before passing control to the controller 31.
[0065] After assuming control, the controller 31 first addresses the header of the sector and verifies that the memory is accessed at the address that the user had specified. This is achieved by the following sequence. The controller selects a memory chip (chip select) among the memory device 33 and shifts the address for the header area from the address generator 503 out to the selected memory chip in the memory device 33. The controller then switches the multiplexer 513 and shifts also the read command out to the memory device 33. Then the memory device reads the address sent it and begins sending serial data from the addressed sector back to the controller. A receiver 515 in the controller receives this data and puts it in parallel format. In one embodiment, once a byte (8 bits) is compiled, the controller compares the received data against the header data previously stored by the microprocessor in the holding register file 509. If the compare is correct, the proper location is verified and the sequence continues.
[0066] Next the controller 31 reads the defect pointers and loads these bad address locations into the holding register file 509. This is followed by the controller reading the alternative defects data that were written to replace the bad bits as they were written. The alternative bits are stored in an alternative defects data file 517 that will be accessed as the data bits are read.
[0067] Once the Header has been determined to be a match and the defect pointers and alternative bits have been loaded, the controller begins to shift out the address of the lowest address of the desired sector to be read. The data from the sector in the memory device 33 is then shifted into the controller chip 31. The receiver 515 converts the data to a parallel format and transfers each byte into a temporary holding FIFO 519 to be shipped out of the controller.
[0068] A pipeline architecture is employed to provide efficient throughput as the data is gated through the controller from the receiver 515 to the FIFO 519. As each data bit is received from memory the controller is comparing the address of the data being sent (stored in the address generator 507) against the defect pointer map (stored in the register file 509). If the address is determined to be a bad location, by a match at the output of the comparator 521, the bad bit from the memory received by the receiver 515 is replaced by the good bit for that location. The good bit is obtained from the alternative defects data file 517. This is done by switching the multiplexer 523 to receive the good bit from the alternative defects data file instead of the bad bit from the receiver 515, as the data is sent to the FIFO 519. Once the corrected data is in the FIFO it is ready to be sent to buffer memory or system memory (not shown). The data is sent from the controller's FIFO 519 to the system memory by the controller's DMA controller 507. This controller 507 then requests and gets access to the system bus and puts out an address and gates the data via an output interface 525 out to the system bus. This is done as each byte gets loaded into the FIFO 519. As the corrected data is loaded into the FIFO it will also be gated into an ECC hardware 527 where the data file will be acted on by the ECC.
[0069] Thus in the manner described, the data read from the memory device 33 is gated through the controller 31 to be sent to the system. This process continues until the last bit of addressed data has been transferred.
[0070] In spite of defect mapping of previously detected defective cells, new hard errors might occur since the last mapping. As the dynamic defect mapping constantly “puts away” new defective cells, the latest hard error that may arise between defect mapping would be adequately handled by the ECC. As the data is gated through the controller 31, the controller is gating the ECC bits into the ECC hardware 527 to determine if the stored value matched the just calculated remainder value. If it matches then the data transferred out to the system memory was good and the read operation was completed. However, if the ECC registers an error then a correction calculation on the data sent to system memory is performed and the corrected data re-transmitted. The method for calculating the error can be done in hardware or software by conventional methods. The ECC is also able to calculate and locate the defective cell causing the error. This may be used by the controller 31 to update the defect map associated with the sector in which the defective cell is detected. In this manner, hard errors are constantly removed from the Flash EEprom system.
[0071] FIG. 7 illustrates the write data path control in the preferred embodiment. The first portion of a write sequence is similar to a read sequence described previously. The microprocessor first loads the Address pointers for the memory device 33 and the DMA as in the read sequence. It also loads the header desired into the address generator 503 and the command queue into the command sequencer 511. The command queue is loaded with a read header command first. Thereafter, control is passed over to the controller 31. The controller then gates the address and command to the memory device 33, as in the read sequence. The memory device returns header data through controller's receiver 515. The controller compares the received header data to the expected value (stored in the holding register file 509). If the compare is correct, the proper location is verified and the sequence continues. Then the controller loads the defective address pointers from the memory device 33 into the holding register file 509 and the alternative data into the alternative defects data file 517.
[0072] Next, the controller begins to fetch the write data from system memory (not shown). It does this by getting access to the system bus, outputs the memory or bus address and does the read cycle. It pulls the data into a FIFO 601 through an input interface 603. The controller then shifts the starting sector address (lowest byte address) from the address generator 503 to the selected memory device 33. This is followed by data from the FIFO 601. These data are routed through multiplexers 605 and 513 and converted to serial format before being sent to the memory device 33. This sequence continues until all bytes for a write cycle have been loaded into the selected memory.
[0073] A pipeline architecture is employed to provide efficient throughput as the data is gated from the FIFO 601 to the selected memory 33. The data gated out of the FIFO 601 is sent to the ECC hardware 527 where a remainder value will be calculated within the ECC. In the next stage, as the data is being sent to the memory device through multiplexers 605 and 513, the comparator 521 is comparing its address from the address generator 503 to the defect pointer address values in the holding register file 509. When a match occurs, indicating that a defective location is about to be written, the controller saves this bit into the alternative defect data file 517. At the same time, all bad bits sent to memory will be sent as zeroes.
[0074] After the bytes for a write cycle have been loaded into the selected memory device, the controller issues a program command to the memory device and initiate a write cycle. Optimized implementations of write operation for Flash EEprom device have been disclosed in two previously cited co-pending U.S. patent applications, Ser. No. 204,175, and one entitled “Multi-State EEprom Read and Write Circuits and Techniques.” Relevant portions of the disclosures are hereby incorporated by reference. Briefly, during the write cycle, the controller applies a pulse of programming (or writing) voltages. This is followed by a verify read to determine if all the bits have been programmed properly. If the bits did not verify, the controller repeats the program/verify cycle until all bits are correctly programmed.
[0075] If a bit fails to verify after prolonged program/verify cycling, the controller will designate that bit as defective and update the defect map accordingly. The updating is done dynamically, as soon as the defective cell is detected. Similar actions are taken in the case of failure in erase verify.
[0076] After all the bits have been programmed and verified, the controller loads the next data bits from the FIFO 601 and addresses the next location in the addressed sector. It then performs another program/verify sequence on the next set of bytes. The sequence continues until the end of the data for that sector. Once this has occurred, the controller addresses the shadow memory (header area) associated with the sector (see FIG. 5 ) and writes the contents of the ECC registers into this area.
[0077] In addition, the collection of bits that was flagged as defective and were saved in the alternative defects data file 516 is then written in memory at the alternative defects data locations (see FIG. 5), thereby saving the good bit values to be used on a subsequent read. Once these data groups are written and verified, the sector write is considered completed.
[0078] The present invention also has provision for defect mapping of the whole sector, but only after the number of defective cells in the sector has exceeded the cell defect mapping's capacity for that specific sector. A count is kept of the number of defective cells in each sector. When the number in a sector exceeds a predetermined value, the controller marks that sector as defective and maps it to another sector. The defect pointer for the linked sectors may be stored in a sector defect map. The sector defect map may be located in the orginal defective sector if its spare area is sufficiently defect-free. However, when the data area of the sector has accumulated a large number of defects, it is quite likely that the spare area will also be full of defects.
[0079] Thus, it is preferable in another embodiment to locate the sector map in another memory maintained by the controller. The memory may be located in the controller hardware or be part of the Flash EEprom memory. When the controller is given an address to access data, the controller compares this address against the sector defect map. If a match occurs then access to the defective sector is denied and the substitute address present in the defect map is entered, and the corresponding substitute sector is accessed instead.
[0080] In yet another embodiment, the sector remapping is performed by the microprocessor. The microprocessor looks at the incoming address and compares it against the sector defect map. If a match occurs, it does not issue the command to the controller but instead substitute the alternative location as the new command.
[0081] Apart from the much higher speed of the solid-state disk, another advantage is the lack of mechanical parts. The long seek times, rotational latency inherent in disk drives are not present. In addition, the long synchronization times, sync mark detects and write gaps are not required. Thus the overhead needed for accessing the location where data is to be read or written is much less. All of these simplifications and lack of constraints result in a much faster system with much reduced overheads. In addition, the files can be arranged in memory in any address order desired, only requiring the controller to know how to get at the data as needed.
[0082] Another feature of the invention is that defect mapping is implemented without the need to interrupt the data stream transferred to or from the sector. The data in a block which may contain errors are transferred regardless, and is corrected afterwards. Preserving the sequential addressing will result in higher speed by itself. Further, it allows the implementation of an efficient pipeline architecture in the read and write data paths.
Write Cache System
[0083] Cache memory is generally used to speed up the performance of systems having slower access devices. For example in a computer system, access of data from disk storage is slow and the speed would be greatly improved if the data could be obtained from the much faster RAM. Typically a part of system RAM is used as a cache for temporarily holding the most recently accessed data from disk. The next time the data is needed, it may be obtained from the fast cache instead of the slow disk. The scheme works well in situations where the same data is repeatedly operated on. This is the case in most structures and programs since the computer tends to work within a small area of memory at a time in running a program. Another example of caching is the using of faster SRAM cache to speed up access of data normally stored in cheaper but slower DRAM.
[0084] Most of the conventional cache designs are read caches for speeding up reads from memory. In some cases, write caches are used for speeding up writes to memory. However in the case of writes to system memory (e.g. disks), data is still being written to system memory directly every time they occur, while being written into cache at the same time. This is done because of concern for loss of updated data files in case of power loss. If the write data is only stored in the cache memory (volatile) a loss of power will result in the new updated files being lost from cache before having the old data updated in system memory (non-volatile). The system will then be operating on the old data when these files are used in further processing. The need to write to main memory every time defeats the caching mechanism for writes. Read caching does not have this concern since the data that could be lost from cache has a backup on disk.
[0085] In the present invention, a system of Flash EEprom is used to provide non-volatile memory in place of traditional system memories such as disk storage. However, Flash EEprom memory is subject to wearing out by excessive program/erase cycles. Even with the improved Flash EEprom memory device as disclosed in copending U.S. patent applications, Ser. No. 204,175 and one entitled “Multi-state EEprom Read and Write Circuits and Techniques,” by Sanjay Mehrotra and Dr. Eliyahou Harari filed on the same day as the present application, the endurance limit is approximately 106 program/erase cycles. In a ten-year projected life time of the device, this translates to a limit of one program/erase cycle per 5 minutes. This may be marginal in normal computer usage.
[0086] To overcome this problem, a cache memory is used in a novel way to insulate the Flash EEprom memory device from enduring too many program/erase cycles. The primary function of the cache is to act on writes to the Flash EEprom memory and not on reads of the Flash EEprom memory, unlike the case with traditional caches. Instead of writing to the Flash EEprom memory every time the data is updated, the data may be operated on several times in the cache before being committed to the Flash EEprom memory. This reduces the number of writes to the Flash EEprom memory. Also, by writing mostly into the faster cache memory and reducing the number of writes to the slower Flash EEprom, an additional benefit is the increase in system write throughput.
[0087] A relatively small size cache memory is quite effective to implement the present invention. This helps to overcome the problem of data loss in the volatile cache memory during a power loss. In that event, it is relatively easy to have sufficient power reserve to maintain the cache memory long enough and have the data dumped into a non-volatile memory such as a specially reserved space in the Flash EEprom memory. In the event of a power down or and power loss to the system, the write cache system may be isolated from the system and a dedicated rechargeable power supply may be switch in only to power the cache system and the reserved space in the Flash EEprom memory.
[0088] FIG. 8 illustrates schematically a cache system 701 as part of the controller, according to the present invention. On one hand the cache system 701 is connected to the Flash EEprom memory array 33. On the other hand it is connected to the microprocessor system (not shown) through a host interface 703. The cache system 701 has two memories. One is a cache memory 705 for temporarily holding write data files. The other is a tag memory 709 for storing relevant information about the data files held in the cache memory 705. A memory timing/control circuit 713 controls the writing of data files from the cache memory 705 to the Flash EEprom memory 33. The memory control circuit 713 is responsive to the information stored in the tag memory as well as a power sensing input 715 with is connected through the host interface 703 via a line 717 to the power supply of the microprocessor system. A power loss in the microprocessor system will be sensed by the memory control circuit 713 which will then down load all the data files in the volatile cache memory 705 to the non-volatile Flash EEprom memory 33.
[0089] In the present invention, the Flash EEprom memory array 33 is organized into sectors (typically 512 byte size) such that all memory cells within each sector are erasable together. Thus each sector may be considered to store a data file and a write operation on the memory array acts on one or more such files.
[0090] During read of a new sector in the Flash EEprom memory 33, the data file is read out and sent directly to the host through the controller. This file is not used to fill the cache memory 705 as is done in the traditional cache systems.
[0091] After the host system has processed the data within a file and wishes to write it back to the Flash EEprom memory 33, it accesses the cache system 701 with a write cycle request. The controller then intercepts this request and acts on the cycle.
[0092] In one embodiment of the invention, the data file is written to the cache memory 705. At the same time, two other pieces of information about the data file are written to a tag memory 709. The first is a file pointer which identifies the file present in the cache memory 705. The second is a time stamp that tells what time the file was last written into the cache memory. In this way, each time the host wishes to write to the Flash EEprom memory 33, the data file is actually first stored in the cache memory 705 along with pointers and time stamps in the tag memory 709.
[0093] In another embodiment of the invention, when a write from the host occurs, the controller first checks to see if that file already existed in the cache memory 705 or has been tagged in the tag memory 709. If it has not been tagged, the file is written to the Flash memory 33, while its identifier and time stamp are written to the tag memory 709. If the file already is present in the cache memory or has been tagged, it is updated in the cache memory and not written to the Flash memory. In this way only infrequently used data files are written into the Flash memory while frequently used data files are trapped in the cache memory.
[0094] In yet another embodiment of the invention, when a write from the host occurs, the controller first checks to see if that data file has been last written anywhere within a predetermined period of time (for example, 5 minutes). If it has not, the data file is written to the Flash memory 33, while its identifier and time stamp are written to the tag memory 709. If the data file has been last written within the predetermined period of time, it is written into the cache memory 705 and not written to the Flash memory. At the same time, its identifier and time stamp are written to the tag memory 709 as in the other embodiments. In this way also, only infrequently used data files are written into the Flash memory while frequently used data files are trapped in the cache memory.
[0095] In all embodiments, over time the cache memory 705 will start to fill up. When the controller has detected that some predetermined state of fullness has been reached, it begins to archive preferentially some files over others in the cache memory 705 by writing them to the Flash memory 33.
[0096] In either embodiments, over time the cache memory 705 will start to fill up. When the controller has detected that some predetermined state of fullness has been reached, it begins to archive preferentially some files over others in the cache memory 705 by writing them to the Flash memory 33. The file identifier tag bits for these files are then reset, indicating that these files may be written over. This makes room for new data files entering the cache memory.
[0097] The controller is responsible for first moving the least active files back into the Flash memory 33 to make room for new active files. To keep track of each file's activity level, the time stamp for each file is incremented by the controller at every time step unless reset by a new activity of the file. The timing is provided by timers 711. At every time step (count), the controller systematically accesses each data file in the cache memory and reads the last time stamp written for this data file. The controller then increments the time stamp by another time step (i.e. increments the count by one).
[0098] Two things can happen to a file's time stamp, depending on the activity of the file. One possibility is for the time stamp to be reset in the event of a new activity occurring. The other possibility is that no new activity occurs for the file and the time stamp continues to increment until the file is removed from the cache. In practice a maximum limit may be reached if the time stamp is allowed to increase indefinitely. For example, the system may allow the time stamp to increment to a maximum period of inactivity of 5 minutes. Thus, when a data file is written in the cache memory, the time stamp for the file is set at its initial value. Then the time stamp will start to age, incrementing at every time step unless reset to its initial value again by another write update. After say, 5 minutes of inactivity, the time stamp has incremented to a maximum terminal count.
[0099] In one embodiment of keeping count, a bit can be shifted one place in a shift register each time a count increment for a file occurs. If the file is updated (a new activity has occurred) the bit's location will be reset to the initial location of the shift register. On the other hand, if the file remains inactive the bit will eventually be shifted to the terminal shift position. In another embodiment, a count value for each file is stored and incremented at each time step. After each increment, the count value is compared to a master counter, the difference being the time delay in question.
[0100] Thus, if a file is active its incremented time stamp is reset back to the initial value each time the data file is rewritten. In this manner, files that are constantly updated will have low time stamp identifiers and will be kept in cache until their activity decreases. After a period of inactivity has expired, they acquire the maximum time stamp identifiers. The inactive files are eventually archived to the Flash memory freeing space in the cache memory for new, more active files. Space is also freed up in the tag memory when these inactive files are moved to the Flash memory.
[0101] At any time when room must be made available for new data files coming into the cache memory, the controller removes some of the older files and archives them to the Flash memory 33. Scheduling is done by a memory timing/control circuit 713 in the controller. The decision to archive the file is based on several criteria. The controller looks at the frequency of writes occurring in the system and looks at how full the cache is. If there is still room in the cache, no archiving need to be done. If more room is needed, the files with the earliest time stamps are first removed and archived to the Flash memory.
[0102] Although the invention has been described with implementation in hardware in the controller, it is to be understood that other implementations are possible. For example, the cache system may be located elsewhere in the system, or be implemented by software using the existing microprocessor system. Such variations are within the scope of protection for the present invention.
[0103] The Profile of how often data is written back to the Flash memory is determined by several factors. It depends on the size of the cache memory and the frequency of writes occurring in the system. With a small cache memory system, only the highest frequency files will be cached. Less frequently accessed files will also be cached with increasing cache memory size. In the present invention, a relatively cheap and small amount of cache memory, preferably about 1 Mbyte, may be used to good advantage. By not constantly writing the most active files (the top 5%), the write frequency of the Flash EEprom may be reduced from the usual one every millisecond to one every 5 minutes. In this way the wear-out time for the memory can be extended almost indefinitely. This improvement is also accompanied by increased system performance during write.
[0104] Incorporating time tag into the write cache concept has the advantage that the size of the write cache buffer memory can be relatively small, since it is used only to store frequently written data files, with all other files written directly into the Flash EEprom memory. A second advantage is that the management of moving data files in and out of the write cache buffer can be automated since it does not require advanced knowledge of which data files are to be called next.
[0105] The various aspects of the present invention that have been described co-operate in a system of Flash EEprom memory array to make the Flash EEprom memory a viable alternative to conventional non-volatile mass storage devices.
[0106] While the embodiments of the various aspects of the present invention that have been described are the preferred implementation, those skilled in the art will understand that variations thereof may also be possible. Therefore, the invention is entitled to protection within the full scope of the appended claims.
Claims
1. A method of operating a non-volatile memory system, comprising:
utilizing more than one integrated circuit chip that individually includes a plurality of non-overlapping units of memory cells that are erasable together, the individual units of memory cells storing multiple bytes of data,
selecting a plurality of units of memory cells distributed over more than one of the integrated circuit chips for erase, and
thereafter erasing the selected plurality of units of memory cells together without erasing others of the units of memory cells on said more than one of the integrated circuit chips.
2. The method of claim 1, which additionally comprises thereafter programming multiple bytes of data into individual ones of the selected plurality of units of memory cells.
3. The method of claim 2, wherein programming includes programming individual memory cells into more than two states, wherein the individual memory cells store more than one bit of data.
4. The method of claim 1, wherein erasing the selected units of memory cells includes simultaneously erasing said selected plurality of units of memory cells.
5. The method of claim 1, wherein erasing the selected units of memory cells includes monitoring the states of said selected units of memory cells and individually terminating erasure of the selected units upon detecting that their memory cells have reached an erased state.
6. The method of claim 1, wherein the memory system exists in a card having connecting pins that are removably connectable with a host system.
7. A method of operating a non-volatile memory system, comprising:
utilizing a plurality of integrated circuit chips that each includes a plurality of non-overlapping units of memory cells that are erasable together and that each individually stores multiple bytes of data,
setting a tag for each of multiple units of memory cells distributed over more than one of the plurality of integrated circuit chips for erase, and
thereafter erasing the tagged multiple units of memory cells together without erasing others of the units of memory cells on said more than one of the integrated circuit chips.
8. The method of claim 7, wherein setting a tag for each of the multiple units of memory cells includes setting states of registers that are individually connected to individual ones of the multiple units of memory cells.
9. The method of claim 7, wherein erasing the tagged multiple units of memory cells includes simultaneously erasing the tagged multiple units of memory cells.
10. The method of claim 7, which additionally comprises thereafter programming multiple bytes of data into individual ones of the erased multiple units of memory cells.
11. A non-volatile memory system, comprising:
a plurality of integrated circuit chips that individually includes an array of re-programmable non-volatile memory cells organized into non-overlapping units of a plurality of memory cells wherein the plurality of memory cells of individual units are erasable together, the units of memory cells individually having a capacity to store multiple bytes of data,
a controller on another integrated circuit chip,
a bus connecting said another integrated circuit chip and said plurality of integrated circuit chips, and
logic circuits provided on the plurality of integrated circuit chips and connected with the controller over the bus to cause a plurality of selected units of memory cells on more than one of the plurality of integrated circuit chips to be erased together without erasing others of the units of memory cells on said more than one of the plurality of integrated circuit chips.
12. The memory system of claim 11, wherein the memory cells individually include at least one charge storage element that is programmable into more than two states, whereby more than one bit of data may be stored on individual ones of the charge storage elements.
Patent Citations (270)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3331058(A) | 1967-07-01 | Perkins | Applicant |
| US3442402(A) | 1969-05-01 | Baxter | Applicant |
| US3593037(A) | 1971-07-01 | Hoff, Jr. | Applicant |
| US3633175(A) | 1972-01-01 | Harper | Applicant |
| US3693159(A) | 1972-09-01 | Hilberg | Applicant |
| US3735368(A) | 1973-05-01 | Beausoleil | Applicant |
| US3753244(A) | 1973-08-01 | Sumilas et al. | Applicant |
| US3765001(A) | 1973-10-01 | Beausoleil | Applicant |
| US3771143(A) | 1973-11-01 | Taylor | Applicant |
| US3772652(A) | 1973-11-01 | Hilberg | Applicant |
| US3781826(A) | 1973-12-01 | Beausoleil | Applicant |
| US3800294(A) | 1974-03-01 | Lawlor | Applicant |
| US3810127(A) | 1974-05-01 | Hoff, Jr. | Applicant |
| US3821715(A) | 1974-06-01 | Hoff, Jr. et al. | Applicant |
| US3882470(A) | 1975-05-01 | Hunter | Applicant |
| US3895360(A) | 1975-07-01 | Cricchi et al. | Applicant |
| US3898632(A) | 1975-08-01 | Spencer, Jr. | Applicant |
| US3906455(A) | 1975-09-01 | Houston et al. | Applicant |
| US3914750(A) | 1975-10-01 | Hadden, Jr. | Applicant |
| US3955180(A) | 1976-05-01 | Hirtle | Applicant |
| US4005389(A) | 1977-01-01 | Penzel | Applicant |
| US4007452(A) | 1977-02-01 | Hoff, Jr. | Applicant |
| US4044339(A) | 1977-08-01 | Berg | Applicant |
| US4051354(A) | 1977-09-01 | Choate | Applicant |
| US4051460(A) | 1977-09-01 | Yamada et al. | Applicant |
| US4058799(A) | 1977-11-01 | George et al. | Applicant |
| US4064405(A) | 1977-12-01 | Cricchi et al. | Applicant |
| US4074236(A) | 1978-02-01 | Ishida | Applicant |
| US4090258(A) | 1978-05-01 | Cricchi | Applicant |
| US4093985(A) | 1978-06-01 | Das | Applicant |
| US4099069(A) | 1978-07-01 | Cricchi et al. | Applicant |
| US4115850(A) | 1978-09-01 | Houston et al. | Applicant |
| US4115914(A) | 1978-09-01 | Harari | Applicant |
| US4130890(A) | 1978-12-01 | Adam | Applicant |
| US4141081(A) | 1979-02-01 | Horne et al. | Applicant |
| US4193128(A) | 1980-03-01 | Brewer | Applicant |
| US4210959(A) | 1980-07-01 | Wozniak | Applicant |
| US4214280(A) | 1980-07-01 | Halfhill et al. | Applicant |
| US4218742(A) | 1980-08-01 | Carlton et al. | Applicant |
| US4241424(A) | 1980-12-01 | Dickson et al. | Applicant |
| US4250570(A) | 1981-02-01 | Tsang et al. | Applicant |
| US4272830(A) | 1981-06-01 | Moench | Applicant |
| US4277827(A) | 1981-07-01 | Carlson et al. | Applicant |
| US4279024(A) | 1981-07-01 | Schrenk | Applicant |
| US4281398(A) | 1981-07-01 | McKenny et al. | Applicant |
| US4287570(A) | 1981-09-01 | Stark | Applicant |
| US4295205(A) | 1981-10-01 | Kunstadt | Applicant |
| US4310901(A) | 1982-01-01 | Harding et al. | Applicant |
| US4319323(A) | 1982-03-01 | Ermolovich et al. | Applicant |
| US4354253(A) | 1982-10-01 | Naden | Applicant |
| US4355376(A) | 1982-10-01 | Gould | Applicant |
| US4380066(A) | 1983-04-01 | Spencer et al. | Applicant |
| US4398248(A) | 1983-08-01 | Hsia et al. | Applicant |
| US4405952(A) | 1983-09-01 | Slakmon | Applicant |
| US4412309(A) | 1983-10-01 | Kuo | Applicant |
| US4422161(A) | 1983-12-01 | Kressel et al. | Applicant |
| US4426688(A) | 1984-01-01 | Moxley | Applicant |
| US4428047(A) | 1984-01-01 | Hayn et al. | Applicant |
| US4433387(A) | 1984-02-01 | Dyer et al. | Applicant |
| US4434487(A) | 1984-02-01 | Rubinson et al. | Applicant |
| US4443845(A) | 1984-04-01 | Hamilton et al. | Applicant |
| US4449203(A) | 1984-05-01 | Adlhoch | Applicant |
| US4449205(A) | 1984-05-01 | Hoffman | Applicant |
| US4450559(A) | 1984-05-01 | Bond et al. | Applicant |
| US4451905(A) | 1984-05-01 | Moyer | Applicant |
| US4456971(A) | 1984-06-01 | Fukuda et al. | Applicant |
| US4460982(A) | 1984-07-01 | Gee et al. | Applicant |
| US4463450(A) | 1984-07-01 | Haeusele | Applicant |
| US4466059(A) | 1984-08-01 | Bastian et al. | Applicant |
| US4467421(A) | 1984-08-01 | White | Applicant |
| US4468729(A) | 1984-08-01 | Schwartz | Applicant |
| US4475194(A) | 1984-10-01 | La Vallee et al. | Applicant |
| US4479214(A) | 1984-10-01 | Ryan | Applicant |
| US4489351(A) | 1984-12-01 | d'Alayer de Costemore d'Arc | Applicant |
| US4493075(A) | 1985-01-01 | Anderson et al. | Applicant |
| US4495572(A) | 1985-01-01 | Bosen | Applicant |
| US4498146(A) | 1985-02-01 | Martinez | Applicant |
| US4506324(A) | 1985-03-01 | Healy | Applicant |
| US4509113(A) | 1985-04-01 | Heath | Applicant |
| US4514830(A) | 1985-04-01 | Hagiwara et al. | Applicant |
| US4521852(A) | 1985-06-01 | Guttag | Applicant |
| US4521853(A) | 1985-06-01 | Guttag | Applicant |
| US4525839(A) | 1985-07-01 | Nozawa et al. | Applicant |
| US4527251(A) | 1985-07-01 | Nibby, Jr. et al. | Applicant |
| US4527257(A) | 1985-07-01 | Cricchi | Applicant |
| US4573141(A) | 1986-02-01 | Simon | Applicant |
| US4578774(A) | 1986-03-01 | Muller | Applicant |
| US4584681(A) | 1986-04-01 | Singh et al. | Applicant |
| US4586163(A) | 1986-04-01 | Koike | Applicant |
| US4601031(A) | 1986-07-01 | Walker et al. | Applicant |
| US4612640(A) | 1986-09-01 | Mehrotra et al. | Applicant |
| US4616311(A) | 1986-10-01 | Sato | Applicant |
| US4617624(A) | 1986-10-01 | Goodman | Applicant |
| US4617651(A) | 1986-10-01 | Ip et al. | Applicant |
| US4630230(A) | 1986-12-01 | Sundet | Applicant |
| US4638465(A) | 1987-01-01 | Rosini et al. | Applicant |
| US4642759(A) | 1987-02-01 | Foster | Applicant |
| US4642798(A) | 1987-02-01 | Rao | Applicant |
| US4644494(A) | 1987-02-01 | Muller | Applicant |
| US4648076(A) | 1987-03-01 | Schrenk | Applicant |
| US4653023(A) | 1987-03-01 | Suzuki et al. | Applicant |
| US4654829(A) | 1987-03-01 | Jiang et al. | Applicant |
| US4654847(A) | 1987-03-01 | Dutton | Applicant |
| US4672240(A) | 1987-06-01 | Smith et al. | Applicant |
| US4680736(A) | 1987-07-01 | Schrenk | Applicant |
| US4685084(A) | 1987-08-01 | Canepa | Applicant |
| US4688170(A) | 1987-08-01 | Waite et al. | Applicant |
| US4713756(A) | 1987-12-01 | Mackiewicz et al. | Applicant |
| US4718041(A) | 1988-01-01 | Baglee et al. | Applicant |
| US4727512(A) | 1988-02-01 | Birkner et al. | Applicant |
| US4733375(A) | 1988-03-01 | Terashima | Applicant |
| US4733394(A) | 1988-03-01 | Giebel | Applicant |
| US4737935(A) | 1988-04-01 | Wawersig et al. | Applicant |
| US4742215(A) | 1988-05-01 | Daughters et al. | Applicant |
| US4744062(A) | 1988-05-01 | Nakamura et al. | Applicant |
| US4746998(A) | 1988-05-01 | Robinson et al. | Applicant |
| US4748320(A) | 1988-05-01 | Yorimoto et al. | Examiner |
| US4750158(A) | 1988-06-01 | Giebel et al. | Applicant |
| US4751703(A) | 1988-06-01 | Picon et al. | Applicant |
| US4752871(A) | 1988-06-01 | Sparks et al. | Examiner |
| US4758986(A) | 1988-07-01 | Kuo | Applicant |
| US4758988(A) | 1988-07-01 | Kuo | Applicant |
| US4763305(A) | 1988-08-01 | Kuo | Applicant |
| US4768193(A) | 1988-08-01 | Takemae | Applicant |
| US4774700(A) | 1988-09-01 | Satoh et al. | Applicant |
| US4780424(A) | 1988-10-01 | Holler et al. | Examiner |
| US4780855(A) | 1988-10-01 | Iida et al. | Applicant |
| US4783745(A) | 1988-11-01 | Brookner et al. | Applicant |
| US4785425(A) | 1988-11-01 | Lavelle | Applicant |
| US4789967(A) | 1988-12-01 | Liou et al. | Applicant |
| US4791604(A) | 1988-12-01 | Lienau et al. | Applicant |
| US4791615(A) | 1988-12-01 | Pelley, III et al. | Applicant |
| US4794568(A) | 1988-12-01 | Lim et al. | Applicant |
| US4796233(A) | 1989-01-01 | Awaya et al. | Applicant |
| US4796235(A) | 1989-01-01 | Sparks et al. | Applicant |
| US4797543(A) | 1989-01-01 | Watanabe | Applicant |
| US4797856(A) | 1989-01-01 | Lee et al. | Examiner |
| US4798941(A) | 1989-01-01 | Watanabe | Applicant |
| US4800520(A) | 1989-01-01 | Iijima | Applicant |
| US4803554(A) | 1989-02-01 | Pape | Applicant |
| US4805109(A) | 1989-02-01 | Kroll et al. | Applicant |
| US4805151(A) | 1989-02-01 | Terada et al. | Applicant |
| US4811293(A) | 1989-03-01 | Knoth et al. | Applicant |
| US4811294(A) | 1989-03-01 | Kobayashi et al. | Applicant |
| US4817002(A) | 1989-03-01 | Sansone et al. | Applicant |
| US4821240(A) | 1989-04-01 | Nakamura et al. | Applicant |
| US4829169(A) | 1989-05-01 | Watanabe | Applicant |
| US4831245(A) | 1989-05-01 | Ogasawara | Applicant |
| US4839705(A) | 1989-06-01 | Tigelaar et al. | Applicant |
| US4841482(A) | 1989-06-01 | Kreifels et al. | Applicant |
| US4847808(A) | 1989-07-01 | Kobatake | Applicant |
| US4853522(A) | 1989-08-01 | Ogasawara | Applicant |
| US4853853(A) | 1989-08-01 | Yamamura et al. | Applicant |
| US4860228(A) | 1989-08-01 | Carroll | Applicant |
| US4860261(A) | 1989-08-01 | Kreifels et al. | Applicant |
| US4860262(A) | 1989-08-01 | Chiu | Applicant |
| US4862200(A) | 1989-08-01 | Hicks | Applicant |
| US4878203(A) | 1989-10-01 | Arakawa | Applicant |
| US4881206(A) | 1989-11-01 | Kadono | Examiner |
| US4882474(A) | 1989-11-01 | Anderi et al. | Applicant |
| US4882642(A) | 1989-11-01 | Tayler et al. | Applicant |
| US4887234(A) | 1989-12-01 | Iijima | Applicant |
| US4891506(A) | 1990-01-01 | Yoshimatsu | Applicant |
| US4896262(A) | 1990-01-01 | Wayama et al. | Applicant |
| US4899274(A) | 1990-02-01 | Hansen et al. | Applicant |
| US4914529(A) | 1990-04-01 | Bonke | Applicant |
| US4916605(A) | 1990-04-01 | Beardsley et al. | Applicant |
| US4920478(A) | 1990-04-01 | Furuya et al. | Applicant |
| US4920518(A) | 1990-04-01 | Nakamura et al. | Applicant |
| US4924331(A) | 1990-05-01 | Robinson et al. | Applicant |
| US4931943(A) | 1990-06-01 | Vermesse | Applicant |
| US4931997(A) | 1990-06-01 | Mitsuishi et al. | Applicant |
| US4933906(A) | 1990-06-01 | Terada et al. | Applicant |
| US4939598(A) | 1990-07-01 | Kulakowski et al. | Applicant |
| US4939690(A) | 1990-07-01 | Momodomi et al. | Applicant |
| US4942556(A) | 1990-07-01 | Sasaki et al. | Applicant |
| US4945535(A) | 1990-07-01 | Hosotani et al. | Applicant |
| US4949240(A) | 1990-08-01 | Iijima | Applicant |
| US4949309(A) | 1990-08-01 | Rao | Applicant |
| US4953122(A) | 1990-08-01 | Williams | Applicant |
| US4953129(A) | 1990-08-01 | Kobayashi et al. | Applicant |
| US4958315(A) | 1990-09-01 | Balch | Applicant |
| US4964074(A) | 1990-10-01 | Suzuki et al. | Applicant |
| US4970692(A) | 1990-11-01 | Ali et al. | Applicant |
| US4977503(A) | 1990-12-01 | Rudnick et al. | Applicant |
| US4984191(A) | 1991-01-01 | Vermesse | Applicant |
| US5033023(A) | 1991-07-01 | Hsia et al. | Applicant |
| US5036460(A) | 1991-07-01 | Takahira et al. | Applicant |
| US5043940(A) | 1991-08-01 | Harari | Examiner |
| US5051887(A) | 1991-09-01 | Berger et al. | Applicant |
| US5053990(A) | 1991-10-01 | Kreifels et al. | Applicant |
| US5060198(A) | 1991-10-01 | Kowalski | Examiner |
| US5084843(A) | 1992-01-01 | Mitsuishi et al. | Applicant |
| US5093731(A) | 1992-03-01 | Watanabe et al. | Applicant |
| US5095344(A) | 1992-03-01 | Harari | Applicant |
| US5095461(A) | 1992-03-01 | Miyakawa et al. | Applicant |
| US5101249(A) | 1992-03-01 | Hijiya et al. | Applicant |
| US5136546(A) | 1992-08-01 | Fukuda et al. | Applicant |
| US5146571(A) | 1992-09-01 | Logan | Applicant |
| US5163021(A) | 1992-11-01 | Mehrotra et al. | Applicant |
| US5167021(A) | 1992-11-01 | Needham | Applicant |
| US5168465(A) | 1992-12-01 | Harari | Applicant |
| US5172338(A) | 1992-12-01 | Mehrotra et al. | Applicant |
| US5218691(A) | 1993-06-01 | Tuma et al. | Applicant |
| US5222046(A) | 1993-06-01 | Kreifels et al. | Applicant |
| US5226136(A) | 1993-07-01 | Nakagawa | Applicant |
| US5226168(A) | 1993-07-01 | Kobayashi et al. | Applicant |
| US5239662(A) | 1993-08-01 | Danielson et al. | Applicant |
| US5253350(A) | 1993-10-01 | Foster et al. | Applicant |
| US5268870(A) | 1993-12-01 | Harari | Applicant |
| US5270979(A) | 1993-12-01 | Harari et al. | Applicant |
| US5270980(A) | 1993-12-01 | Pathak et al. | Applicant |
| US5274599(A) | 1993-12-01 | Ema | Applicant |
| US5297096(A) | 1994-03-01 | Terada et al. | Applicant |
| US5297148(A) | 1994-03-01 | Harari et al. | Examiner |
| US5359569(A) | 1994-10-01 | Fujita et al. | Applicant |
| US5359726(A) | 1994-10-01 | Thomas | Applicant |
| US5384743(A) | 1995-01-01 | Rony | Applicant |
| US5388083(A) | 1995-02-01 | Assar et al. | Applicant |
| US5418752(A) | 1995-05-01 | Harari et al. | Applicant |
| US5430859(A) | 1995-07-01 | Norman et al. | Applicant |
| US5434825(A) | 1995-07-01 | Harari | Applicant |
| US5488711(A) | 1996-01-01 | Hewitt et al. | Applicant |
| US5546351(A) | 1996-08-01 | Tanaka et al. | Applicant |
| US5606532(A) | 1997-02-01 | Lambrache et al. | Applicant |
| US5619451(A) | 1997-04-01 | Costabello et al. | Applicant |
| US5671229(A) | 1997-09-01 | Harari et al. | Applicant |
| US5719808(A) | 1998-02-01 | Harari et al. | Applicant |
| US5936971(A) | 1999-08-01 | Harari et al. | Applicant |
| US5991517(A) | 1999-11-01 | Harari et al. | Applicant |
| US5999446(A) | 1999-12-01 | Harari et al. | Applicant |
| US6149316(A) | 2000-11-01 | Harari et al. | Applicant |
| AUA557723 | 1987-01-01 | Applicant | |
| DE3812147 | 1988-11-01 | Applicant | |
| DE4119394(A1) | 1991-12-01 | Applicant | |
| EP6550 | 1980-01-01 | Applicant | |
| EP86886 | 1983-08-01 | Applicant | |
| EP220718 | 1987-05-01 | Applicant | |
| EP243503 | 1987-11-01 | Applicant | |
| EP284981 | 1988-10-01 | Applicant | |
| EP300264 | 1989-01-01 | Applicant | |
| GB2136992 | 1984-09-01 | Applicant | |
| GB2172126 | 1986-09-01 | Applicant | |
| GB2202349 | 1988-09-01 | Applicant | |
| JP52008738 | 1977-01-01 | Applicant | |
| JP58086777 | 1983-05-01 | Applicant | |
| JP58-215794 | 1983-12-01 | Applicant | |
| JP58-215795 | 1983-12-01 | Applicant | |
| JP59-45695 | 1984-03-01 | Applicant | |
| JP59-154525 | 1984-09-01 | Applicant | |
| JP59-162695 | 1984-09-01 | Applicant | |
| JP59186015 | 1984-10-01 | Applicant | |
| JP60-076097 | 1985-04-01 | Applicant | |
| JP60-212900 | 1985-10-01 | Applicant | |
| JP61-25229 | 1986-02-01 | Applicant | |
| JP61-96598 | 1986-05-01 | Applicant | |
| JP178564 | 1986-08-01 | Applicant | |
| JP62188099 | 1987-08-01 | Applicant | |
| JP62-283496 | 1987-12-01 | Applicant | |
| JP62-283497 | 1987-12-01 | Applicant | |
| JP63-138483 | 1988-06-01 | Applicant | |
| JP63-183700 | 1988-07-01 | Applicant | |
| JP63-184889 | 1988-07-01 | Applicant | |
| JPA01054543 | 1989-03-01 | Applicant | |
| JP64-059486 | 1989-03-01 | Applicant | |
| JP64-070843 | 1989-03-01 | Applicant | |
| JP6318596 | 1994-11-01 | Applicant | |
| WO8400628 | 1984-02-01 | Applicant | |
| WO85/03583 | 1985-08-01 | Applicant | |
| WO88/09019 | 1988-02-01 | Applicant |
Non-Patent Literature (96)
- Wilson, “1-Mbit flash memories seek their role in system design,” Computer Design, vol. 28, No. 5, pps. 30-32 (Mar. 1989).Applicant
- Miller, “Semidisk Disk Emulator,” Interface Age, p. 102, Nov. 1982.Applicant
- Clewitt, “Bubble Memories as a Floppy Disk Replacement,” 1978 MIDCON Technical Papers, vol. 2, pp. 1-7, (Dec. 1978).Applicant
- Hancock, “Architecting a CCD Replacement for the IBM 2305 Fixed Head Disk Drive,” Digest of Papers, Eighteenth IEEE Computer Society International Conference, pp. 182-184, 1979.Applicant
- Lucero et al., “A 16 Kbit Smart 5 V-only EEPROM with Redundancy,” IEEE Journal of Solid-State Circuits, vol. SC-18, No. 5, pps. 539-543 (Oct. 1983).Applicant
- Torelli et al., “An improved method for programming a word-erasable EEPROM,” Alta Frequenza, vol. 52, No. 6, pps. 487-494 (Nov.-Dec. 1983).Applicant
- Data Sheet: “27F256 256K(32K x 8) CMOS Flash Memory,” Intel Corporation, pps. 1-24 (May 1988).Applicant
- Preliminary Data Sheet, “48F512 512K Flash EEPROM,” SEEQ Technology, Incorporated, pps. 2-1 thru 2-12 (Oct. 1988).Applicant
- Advanced Data Sheet, “48F010 1024K Flash EEPROM,” SEEQ Technology, Incorporated, pps. 2-13 thru 2-24 (Oct. 1988).Applicant
- Lai, Robert S., “Writing MS-DOS Device Drivers,” The Waite Group, Inc. Sep. 1987, pp. i-xi and 235-319.Applicant
- Stark, M., “Two Bits Per Cell Rom,” IEEE Catalog No. 81-CH1626-1, Library of Congress No. 80-85186, Order No. 341, Spring Comp Con 1981, Feb. 23-26, Twenty-Second Computer Society International Conference, San Francisco, CA.Applicant
- Furuyama et al., “An Experimental 2-Bit/Cell Storage Dram For Macro Cell Or Memory-On-Logic Application,” pp. 4.4.1-4.4.4, IEEE, (1988).Applicant
- Horiguchi et al., “An Experimental Large-Capacity Semiconductor File Memory Using 16-Levels Cell Storage,” IEEE Journal Of Solid-State Circuits, vol. 23, No. 1, Feb. 1988.Applicant
- Krick, P.J., “Three-State MNOS Fet Memory Array,” IBM Technical Disclosure Bulletin, vol. 18, No. 12, pps. 4192-4193 (May, 1976).Applicant
- Alberts, et al., “Multi-Bit Storage Fet EAROM Cell,” IBM Technical Disclosure Bulletin, vol. 24, No. 7A, pps. 3311-3314 (Dec., 1981).Applicant
- Bleiker et al., “A Four-State EEPROM Using Floating-Gate Memory Cells,” IEEE Journal of Solid-State Circuits, vol. SC-22, No. 3 (Jun., 1987).Applicant
- “Nonvolatility” Semiconductor vs. Magnetic, IEEE (reprint), International Solid-State Circuits Conference, Feb. 17-19, 1998, Richard Pashley, Organizer/Moderator, p. 6-393.Applicant
- “High-Density Flash EEPROMS are about to Burst on the Memory Market”, Electornics, Mar. 3, 1988, J. Robert Lineback.Applicant
- “Erasable/Programmable solid state memories”, EDN, Nov. 14, 1985, Denny Cormier, Western Editor, pp. 145-153.Applicant
- “A Reconfigurable Interconnect for In-Silicon Electronic Assembly”, 32nd Electronic Components Conference, May 10-12, 1982, Hsia et al., pp. 7-16.Applicant
- “Adaptive Wafer Scale Integration”, Japanese Journal of Applied Physics, vol. 19, supp. 19-1, 1980, Yukun Hsia et al., pp. 193-202.Applicant
- “Nonvolatile Memories: A 5V-Only 256k Bit CMOS Flash EEPROM”, 1989 IEEE International Solid State Circuits Conference, No. 0193-6530/89/0000-0132, Feb. 16, 1989, D'Arrigo et al, pp. 132-133.Applicant
- White et al., “Data File Handling the IBM PC and XT”, R.R. Donnelley & Sons, 1985, p. 104.Applicant
- “IBM Technical Reference”, 1986, Revised.Applicant
- “SEEQ 48C512/48C1024 Advanced Data Sheet”, Jul. 1987, p. 1-91 through 1-101.Applicant
- “Nonvolatile Memories: An Experimental 4Mb CMOS EEPROM with a NAND Structured Cell”, IEEE International Solid State Circuits Conference, No. 0193-6530/89/0000-0134, Feb. 16, 1989, Itoh et al., pp. 134-135.Applicant
- “Nonvolatile Memories: A 90ns 100k Erase/Program Cycle Megabit Flash Memory”, IEEE International Solid State Circuits Conference, No. 0193-6530/89/0000-0410, Feb. 16, 1989, Kynett et al., pp. 140-141.Applicant
- “An In-System Reprogrammable 32K×8 CMOS Flash Memory”, IEEE Journal of Solid State Circuits, vol. 23, No. 5, Oct. 1988, Kynett et al., pp. 1157-1161.Applicant
- “Nonvolatile Memories: A 1MB Flash EEPROM”, IEEE International Solid State Circuits Conference, No. 0193-6530/89/0000-0140, Feb. 16, 1989, Cernea et al.Applicant
- “Semidisk Disk Emulator”, Interface Age, pp. 102, Nov. 1982.Applicant
- “Inside Macintosh, vol. II”, Caroline Rose et al., 1989, Addison-Wesley Publishing Company, Inc., p. 211.Applicant
- “MS-DOS Developer's Guide”, Angermeyer et al., 1986, The Waite Group, Inc., p. 287.Applicant
- Qualogy, Inc. “QPC-5213, QPC-5212, QPC-5211 Solid-State Disk Emulator”, Configuration Manual, 1987.Applicant
- “SCSI/MEM NOVRAN and EPROM disk drive on SCSI”, 1 page, date unknown.Applicant
- “Introduction from the Third European Solid-State Circuits Conference Organizing Committee”, IEEE Journal of Solid-State Circuits, vol. SC-13, No. 3, p. 282, Jun. 1978.Applicant
- Aubusson et al., “Wafer-Scale Integration-A Fault Tolerant Procedure”, IEEE Journal of Solid-State Circuits, vol. SC-13, No. 339-344, Jun. 1978.Applicant
- Oka et al., “Hitachi SV501C Series Semiconductor Storage Devices”, Hitachi Review, vol. 39, No. 5, p. 267-272, Oct. 1990.Applicant
- Hsia, Yukun, “Memory Applications of the MNOS”, 1972 WESCON Technical Papers, vol. 16, p. 1-5, Sep. 19-22, 1972.Applicant
- Hsia et al., “A Reconfigurable Interconnect for In-Silicon Electronic Assembly”, 32nd Electronic Components Conference, San Diego, California, p. 7-16, May 10-12, 1982.Applicant
- -6M20 Disk Emulator Manual, Mesa Electronics, Version 1.1, 1987.Applicant
- -8M20 Disk Emulator Manual, Version 1.2, Mesa Electronics, 1989.Applicant
- -6M20 RAMdisk Driver—Hard disk Replacement, Mesa Electronics, Revision History, 1987-1989.Applicant
- “6M20 Block I/O Functions”, Mesa Electronics, Revision History, 1987-1989.Applicant
- -Solid State Crash Survivable Flight Data Recorders for Mishap Investigation, p. 34-63, publication date and source unknown.Applicant
- -Electrically Erasable PROM, Xicor Data Book, p. 3-177 thru 3-179, May 1987.Applicant
- Geideman, et al., “Silicon Machine—A Reconfigurable On-The Wafer Interconnect Architecture for VLSI Systems”, Naval Air Development Center, Warminster, PA, p. 235-237.Applicant
- Hsia, et al., “Highly-Reliable Semiconductor Mass Memory”, 1979 IEEE, p. 881-887.Applicant
- Hsia, et al., “Reconfigurable Interconnect for In-Silicon Electronic Assembly”, Naval Air Development Center, Warminster, PA 1982, p. 7-16.Applicant
- Hsia, Yukun, “Wafer Scale Integration”, University of Santa Clara, Santa Clara, California, Jun. 7, 1984.Applicant
- Hsia, Yukun, “Nonvolatile Semiconductor Memories”, University of Santa Clara, Santa Clara, California, May 11, 1984.Applicant
- Gosney, W. Milton, “DIFMOS-A Floating-Gate Electrically erasable Nonvolatile Semiconductor Memory Technology”, IEEE Transactions on electron Devices, vol. ED-24, No. 5, May 1977, p. 594-599.Applicant
- Guterman, et al., An Electrically Alterable nonvolatile Memory Cell Using a Floating-Gate Structure, IEEE Journal of Solid Circuits, vol. SC-14, No. 2, pp. 498-508, Apr. 1979.Applicant
- Cacharelis, et al., “A Single Transistor Electrically Alterable Cell”, IEEE Electronic Device Letters, vol. EDL-6, No. 10, Oct. 1985, pp. 519-521.Applicant
- “Non-Volatile High-Speed Electronic Storage for the IBM Personal Computer”, IBM Technical Disclosure Bulletin, vol. 28, No. 8, Jan. 1986, pp. 3395-3396.Applicant
- Declaration of Yukun Hsia, Ph.D. with Exhibits A-H, dated Feb. 11, 2000.Applicant
- Declaration of W. Milton Gosney, Jr., with Exhibits 2-8, dated Feb. 11, 2000.Applicant
- Deposition of Yukun Hsia, Ph.D., Jan. 27, 2000, p. 1-171.Applicant
- Hsia et al., “Impact of MNOS/AWSI Technology on Reprogrammable Arrays”, McDonnell Douglas Corporation, May 26-27, 1981, p. 1-16.Applicant
- Zales, Saul, “Flash Memories Change System Design Fundamentals”, Wescon/88 Electronic Show and Convention, Nov. 15-17, 1988, Anaheim, California, p. 1-6.Applicant
- Norris, Rich, “Flash Technology: Bridging the Gap Between EPROMS and EEPROMS”, Wescon/88 Electronic Show and Convention, Nov. 15-17, 1988, Anaheim, California, p. 1-4.Applicant
- Mehrotra et al, “Serial 9MB Flash EEPROM for Solid State Disk Applications”, IEEE Symposium on VLSI Circuits Digest of Technical Papers, Feb. 1992, pp. 24-25.Applicant
- Lee et al., “An 18MB Serial Flash EEPROM for Solid-State Disk Applications”, IEEE ,Symposium on VLSI Circuits Digest of Technical Papers, Apr. 1994, pp. 59-60.Applicant
- “Memory Components Handbook”, 1990.Applicant
- Hsia et al., “Adaptive Integrated Technology Development: vol. 3: Mass Memory System Description”, Part 1, May 23, 1979.Applicant
- Iwata et al., “A High-Density NAND EEPROM with Block-Page Programming for Microcomputer Applications”, IEEE Journal of Solid-State Circuits, vol. 25, No. 2, Apr. 1990, p. 417-418.Applicant
- “Wafers to Challenge disks, bubbles?”, Electronics, Aug. 16, 1979.Applicant
- Momodomi et al, “New Device Technologies for 5V-ONLY 4mb EEPROM with Nand Structure Cell”, ULSI Research Ctr, Toshiba Corp, Japan, IEDM, pp. 412-415.Applicant
- “Advanced Memory (BORAM) Application Using MNOS Technology”, Litton Systems, Inc., Mar. 1972.Applicant
- “Project 779: Design Review”, Jan. 19-20, 1982.Applicant
- Hsia et al., “MDAC Solid-State Memory Development”, McDonnell Douglass Astronautics Company, May 19, 1980.Applicant
- Brewer et al., “New Storage Medium Saves $22 Million: Smaller, Lighter, More Reliable”, Reprint from U.S. Army ManTech Journal, vol. 4, No. 4; p. 1-14.Applicant
- Brewer, J.E., “Test Report: Initial BORAM 6008 Samples: Contract N00421-77-R-1098: BORAM 8K Memory Chip”, Naval Air Test Center, Patuxent River, Maryland, Mar. 6, 1978.Applicant
- Brewer, J.E., “Economic Analysis of MNOS Mass Memory”, Westinghouse Defense and Electronic Systems Center, Feb. 1977.Applicant
- Brewer et al., “Army/Navy MNOS BORAM”, The Government Microcircuit Applications Conference, Nov. 1976., p. 1-8.Applicant
- Brewer, J.E., “MNOS Density Parameters”, IEEE Transactions on Electron Devices, vol. ed-24, No. 5, p. 618-625.Applicant
- Brewer, J.E., “Block Oriented Random Access Memory (BORAM)”, Phase I: First Technical Report (Quarterly), Jun. 28, 1972 to Oct. 28, 1972, Westinghouse Defense and electronic Systems Center.Applicant
- Brewer, J.E., “Block Oriented Random Access Memory (BORAM)”, Phase I: Second Technical Report (Quarterly), Oct. 28, 1972 to Dec. 31, 1972, Westinghouse Defense and electronic Systems Center.Applicant
- Brewer, J.E., “Block Oriented Random Access Memory (BORAM): Chip Line Startup Progress Report”, Mar. 1975, Westinghouse Defense and electronic Systems Center.Applicant
- Brewer, J.E., “Block Oriented Random Access Memory (BORAM): Microelectronics Design Plan”, Aug. 15, 1975, Westinghouse Defense and electronic Systems Center.Applicant
- Shirota et al.; “A New NAND Cell for Ultra High Density 5V-Only EEPROMs”, 1988 Symposium on VLSI Technology, May 10-13, 1988, p. 33-34.Applicant
- Brewer J.E., “MNOS BORAM Manufacturing Methods and Technology Progect”, Westinghouse Electric Corporation, Jan. 1982: final Technical Report for Period Apr. 1980 to Jan. 1982.Applicant
- Brewer,et al., “Nonvolatile Metal-Nitride-Oxide Semiconductor BORAM” Twelfth Annual Tri-Service Manufacturing Technology Conference, Oct. 19-23, 1980, p. 2-10.Applicant
- Ask, Henry, R., “Solid-State Flight Data Recorder”, 1980 Government Microcircuit Applications Conference, Nov. 19-21, 1980. p. 1-2.Applicant
- Brewer J.E., “MNOS BORAM Manufacturing Methods and Technology Progect”, Westinghouse Electric Corporation, Feb. 1980,:final Technical Report for Period Jul. 1979 to Nov. 1979.Applicant
- Farrow, Raymond, “Reaping the MT Program Benefits”, U.S. Army Man TechJournal, vol. 5, No. 1, 1980.Applicant
- “BORAM 6008: Nonvolatile Integrated Circuit Block-Oriented Random-Access Memory Chip” Westinghouse Defense and electronic Systems Center, Jun. 1981, pp. 1-10.Applicant
- Scientific Micro Systems, Inc., QMTI AT Compatible Controller Series—Reference Manual, Publication No. 3001774-0001, (1988) pps. 1-1 to 1-4, and 2-1, 2-8 and 2-9.Applicant
- Intel Corporation, 27F256, 256K (32K×8) CMOS Flash Memory, May 1988, pp. 1-21.Applicant
- European Search Report, corresponding European Application No. 95107965.6-2210, Jul. 7, 2003, 2 pages.Applicant
- Wilson, Ron, “1-Mbit Flash Memories Seek Their Role in System Design”, Computer Design, vol. 28, No. 5, Mar. 1, 1989, 2 pages.Applicant
- Kuo, Clinton, et al., “A SUB 100ns 32K EEPROM”, Proceedings of the National Electronics Conference, vol. 36, 1982, p. 390.Applicant
- J.E. Brewer et al., “Block-Oriented Random Access MNOS Memory,” National Computer Conference and Exposition, Chicago, May 6-10, 1974, AFIPS Conference Proceedings, vol. 43, pp. 837-840.Applicant
- J.E. Brewer et al., “Low Cost MNOS BORAM,”Proceedings of IEEE National Aerospace Electronics Conference, NAECON '77, May 17-19, 1977 pp. 624-626.Applicant
- J.R. Cricchi et al., “Nonvolatile Block-Oriented RAM,” IEEE International Solid-State Circuits Conference, Feb. 13-15, 1974, Digest of Technical Papers, pp. 204-205.Applicant
- Nakayama et al., “A 60ns 16Mb Flash EEPROM With Program and Erase Sequence Controller”. IEEE Journal of Solid-State Circuits, vol. 26, No. 11, Nov. 1991, New York US, pp. 1600-1605.Applicant
- Wilson, Ron, “1-Mbit Flash Memories Seek Their Role in System Design”, Computer Design, vol. 28, No. 5, Mar. 1989, pp. 30-32.Applicant