US 6,374,337 B1Grant
Data pipelining method and apparatus for memory control circuit
Issue Date:2002-04-16
•12 Claims
•4 Drawing Sheets
Abstract
A method and circuit for fast memory access (read or write) of the data to and from a memory array is disclosed. Architecture wise, the memory array control circuit provides for at least two address latches and two page registers. The first address latch contains a first data address and the second address latch contains a second data address. The first data address is decoded first and sent to the memory array to access (read or write) the corresponding data from the memory array. When the data of the first data address is being accessed, the decoding process will begin for a second data address. When the data of the first data address has been accessed, the second data address is ready for the memory array. Thus, there can be continuous fetching from or writing to the memory array. In the preferred embodiment, there are two page registers. In a read operation, the data read from the first data address is transferred to a first page register. When the data of the second data address is being accessed, the data in the first page register is transferred to a second page register. When the operation to read the data from the second data address is completed, the data can be placed in the first register. The data in the second page register can be rapidly transferred to a latch and on to a bus. In this manner, there is always space made available for the data read. Similarly, in a write operation, data is transferred from the data bus to the second page register and then to the first page register. The data in the first register is written into the memory array.
Metadata
Assignee
- Lexar Media, Inc.
Inventor
- Petro Estakhri
Application Information
Application Number:US 09/440,986
Filing Date:1999-11-16
Priority Date:1998-11-17
Art Unit:7
Classifications
IPC:
G06F 1200G06F 1314
Field of Search:
7111007111027111037111047111407111547111693651890136518905
Patent Drawings (4 sheets)
Description
Referenced to Prior Application
[0002] This application claims the benefit of previously filed U.S. Provisional Application No. 60/108,872 filed Nov. 17, 1998, and entitled “METHOD AND APPARATUS FOR MEMORY CONTROL CIRCUIT.”
Field of the Invention
[0003] The present invention generally relates to nonvolatile memory arrays, and, in particular, to control circuits for increasing the speed of operations performed on the nonvolatile memory arrays.
Background of the Invention
[0004] In the conventional method of accessing memory arrays (including flash memory arrays), whether it be a read or write operation, each operation is performed sequentially, meaning that an operation has to be completed before the start of the next read or write operation In performing an operation to access a memory array, the given data address is first decoded and the decoded address is provided to the memory array for fetching the data or storing the data. Because each of the decoding and accessing steps are done in a sequential maimer, these architectures of the prior art memory arrays do not lend themselves to faster throughputs necessary for modem-day high-speed memory access and throughput requirements.
[0005] Timing diagrams exemplifying prior art techniques are shown in FIGS. 3(a) and 3(b) and will be discussed in more detail later. Briefly, these prior art methods and systems require overhead time for shifting the data into a temporary storage location prior to storing the same in nonvolatile or flash memory for and during each write command. In fact, the next write command cannot begin prior to the completion of the tasks associated with performing a write command. Thus, system efficiency suffers where many write operations need be performed, as is the case in most memory systems.
[0006] Therefore, it would be desirable to have method and memory architecture conducive to high-speed memory throughput not limited to the sequential speed of each memory access.
Summary of the Invention
[0007] It is the object of the present invention to provide a method and architecture for high speed accessing of a memory array with respect to write-to-memory and read-from-memory operations.
[0008] It is another object of the present invention to provide a method and architecture for high speed accessing of a memory array that allows for continuous read or write operations from and to the memory array.
[0009] It is yet another object of the present invention to provide a method and architecture for high speed accessing of a memory array, which allows for continuously decoding of data addresses for reading or writing from and to the memory array.
[0010] It is still another object of the present invention to provide a method and architecture, which allows for the decoding of a data address while the data addressed by the previous data address is being accessed.
[0011] Briefly, the presently preferred embodiment of the present invention provides a method and architecture for fast memory access (read or write) of the data to and from a memory array. Architecture wise, the memory array control circuit provides for at least two address latches and two page registers. The first address latch contains a first data address and the second address latch contains a second data address. The first data address is decoded fi and sent to the memory array to access (read or write) the corresponding data from the memory array. When the data of the first data address is being accessed, the decoding process will begin for a second data address. When the data of the first data address has been accessed, the second data address is ready for the memory array. Thus, there can be continuous fetching from or writing to the memory array. In the preferred embodiment, there are two page registers. In a read operation, the data read from the first data address is transferred to a first page register. When the data of the second data address is being accessed, the data in the first page register is transferred to a second page register. When the operation to read the data from the second data address is completed, the data can be placed in the first register. The data in the second page register can be rapidly transferred to a latch and on to a bus. In this manner, there is always space made available for the data read. Similarly, in a write operation, data is transferred from the data bus to the second page register and then to the first page register. The data in the first register is written into the memory array.
[0012] An advantage of the present invention is that it provides a method and architecture for high speed accessing of a memory array with respect to write-to-memory and read-from-memory operations.
[0013] Another advantage of the present invention is that it provides a method and architecture for high speed accessing of a memory array that allows for continuous read or write operations from and to the memory array.
[0014] Yet another advantage of the present invention is that it provides a method and architecture for high speed accessing of a memory array, which allows continuously decoding of data addresses for reading or writing from and to the memory array.
[0015] Still yet another advantage of the present invention is that it provides a method and architecture, which allows for the decoding of a data address while the data addressed by the previous data address is being accessed.
[0016] These and other features and advantages of the present invention will become well understood upon examining the figures and reading the following detailed description of the invention.
In the Drawings
[0017] FIG. 1 is a block diagram illustrating the host, the memory controller and a memory circuit.
[0018] FIG. 2 is a detailed block diagram illustrating the memory circuit.
[0019] FIGS. 3aand 3billustrate prior art timing diagrams for a write operation.
[0020] FIGS. 4aand 4billustrate timing diagrams for a write operation using the preferred embodiment of the present invention.
[0021] FIGS. 5aand 5billustrate prior art timing diagrams for a read operation.
[0022] FIGS. 6aand 6billustrate timing diagrams for a read operation using the preferred embodiment of the present invention.
[0023] FIG. 7 is a flow chart illustrating the steps in writing to the memory array.
Detailed Description of the Preferred Embodiments
[0024] The description provided herein makes references to a flash (or nonvolatile, which may be other than flash, such as EEPROM memory array. However, it shall be understood that the present invention may be used in any memory architecture. Referring now to FIG. 1, a host 101 interfaces with a flash memory controller 100 in storing and retrieving digital information, in the form of user data or other kind of data, to and from a flash memory circuit 102. The controller 100 is generally comprised of a circuit for coding and decoding error correction code (ECC) 104, a flash state machine 106, a flash controller 108, a host interface 105 for communicating with the host, a SPM controller/state machine 109, SPM RAM 110, RAM 111, ROM 112, a microprocessor 113 and a data buffer RAM 103. The data buffer RAM 103 is used for temporary storage of information prior to a more permanent storage of or after reading information from the flash memory circuit 102.
[0025] Referring now to FIG. 2, a flash memory circuit 5 is shown to include a flash memory cell array 10 and control circuitry 6 for operating the flash memory cell array 10 in accordance with an embodiment of the present invention. The control circuitry 6 includes a row and column address decoder 12, an address double latch 14, a buffer 20, a command register 24, a read-value register 26, a control logic unit 28, a state machine 32, an I/O buffer and latch 34, a double data latch 36 (which includes a PageRegister0 38 and a PageRegister1 40), an output driver 21 and an error handling state machine 50.
[0026] The flash memory cell array 10 includes flash memory cells that are addressable by row and column address signals provided by the row and column address decoder 12. The row and column address decoder 12 receives addresses from the address double latch 14. The double latch 14 is comprised of two latches, an AddrLatch0 16 and an AddrLatch1 18. The double address latch 14 receives its input from the buffer 20, which, in turn, receives its input from an I/O bus 22. The buffer 20 also provides signals to the command register 24 and the read-value register 26. The control logic unit 28 in response to input signals (ready signal and command/address control lines received at 30 and 31), and working in conjunction with the state machine 32 operates the buffer 20, 110 buffer and latch 34, and the double data latch 36. The double data latch 36 is comprised of PageRegister0 38 and PageRegister1 40 and sends (or writes) and/or receives (reads) data to and from the flash memory array 10. An error handling state machine 50 handles errors occurring in the writing to the memory array 10.
[0027] In operation, the controller (FIG. 1, 100) sends and receives 512 bytes of data (or as otherwise specified) plus error correction code (PCC) and address information to and from the flash memory circuit (FIG. 2, 102). When the controller sends (or writes) data to the flash memory circuit, the flash memory circuit latches the data to be written into a PageRegister (PageRegister0 38 or PageRegister1 40 in FIG. 2) and starts the write operation to the flash memory array 10. At this time the flash memory circuit (FIG. 1, 102) asserts a Ready/Busy signal, which is monitored by the controller (FIG. 1, 100) as to whether the flash memory circuit has completed the write operation. Once the controller (FIG. 1, 100) detects the end of the write operation, it reads the status register to check for any error conditions. If there was no error, the controller starts a new write operation by sending a new write command followed by new data
[0028] In the present invention, a new write command and data is sent to the flash memory circuit while the previous data is being written the flash memory array. This has a pipelining effect. By pipelining the data, no time is lost in waiting for the completion of the previous write operation. The error handling state machine 50 is provided to handle errors occurring from the write operation thus relieving the controller from handling the errors.
[0029] In a read operation, the row and column address decoder 12, in response to an address received from AddrLatch0 or AddrLatch1, decodes the address, and provides the decoded address to the flash memory cell array 10. Data is then read from a location within the flash memory cell array 10 that is identified by the decoded address. The data that is read is then provided to the PageRegister0 38. In a write operation, an address from AddrLatch0 or AddrLatch1 is provided to the row and column address decoder 12 to activate the corresponding address(es) in the flash memory cell array 10. The data to be written to the flash memory cell 10 is provided by the PageRegister0 38 or PageRegister1 40.
[0030] One of the advantages of the present invention is that during a first time period the address can be read from AddrLatch0 16 to initiate the operation to write the data from PageRegister0 38. At the same time, a new address can be written to AddrLatch1 18 and a new data word can be written to PageRegister1 40. During a second time period, the address can be read in from AddrLatch1 and data can be read from PageRegister1 40. Moreover, a new address can be written to AddrLatch0 16 and the new data word can be written to PageRegister0 38. In this manner, a ping-pong effect is achieved where while a first set of address and data pair is being written to the flash memory array 10 a second set of address and data pair is being written to the corresponding address latch and page register for the next write operation. In an alternate embodiment, a first-in-first-out (FIFO) method can be implemented rather Man a ping-pong method.
[0031] More specifically, in operation, when the flash memory apparatus receives a write command, the address is shifted into AddrLatch0 16 and the corresponding data to be written is shifted into PageRegister0 38, and the data is then written to the corresponding flash memory cell array 10. During this period, the controller (FIG. 1, 100) determines if there is another write command pending from the host. If there is another write command pending, the address for the new data is shifted into AddrLatch1 18 and the corresponding new data is shifted into PageRegister1 40. At the end of the first write command, the command/address state machine 32 checks error status to verify successful completion of the write command. If the write command was completed successfully, the command pending flag is checked. If there is a command pending and a new word of data is received at the alternate PageRegister1 40, data in PageRegister1 40 is written to the flash memory cell array 10. In this manner, a ping-pong effect is achieved where while data in one PageRegister is being written to the flash memory cell array, another word of data is being loaded into the alternate PageRegister in preparation for writing during the next time period. This process continues until no new data is to be written to the flash memory array or an error condition occurred. This process eliminates the overhead time required for shifting the data into the PageRegister for each write command.
[0032] FIGS. 3aand 3billustrate a prior art firing diagram and FIGS. 4aand 4billustrate the timing diagram showing the elimination of the overhead time required for loading data into the PageRegister. FIG. 3aillustrates the state of the I/O bus where there is a command phase followed by a address phase followed by a data phase and a break for writing the data into the flash memory array. At the end of the first write cycle, the error status is checked (read status phase indicated at 52) to ensure successful completion of the write cycle. FIG. 3billustrates the state of the ready signal where the bus is available during time t1 but is not being used. FIG. 4aillustrates the state of the I/O bus where there is not a break after a command/address/data phase. Instead, it is immediately followed by another command/address/data phase to load AddrLatch0 or AddrLatch1 and PageRegister0 or PageRegister1. The state of the ready signal is illustrated in FIG. 4b. In this setup, the end of the first write operation occurs in time as indicated at 54 and the end of the second write operation occurs in time as indicated at 56. There is a phase (58) for reading the status for the completion of the write operation. In this manner, a faster throughput is achieved by using the previous write-to-array-time for loading of another address/data into the respective registers (ping-pong).
[0033] During a read operation, the flash memory circuit receives a read command causing the requested data to be read from the flash memory array to PageRegister0 and transferred to PageRegister1 (similar to a FIFO). The data now on PageRegister1 is sent to the controller (requester). As the data is being transferred from PageRegister1 to the controller via the I/O bus, the Command/Address state machine starts a new read operation where the data read is shifted to PageRegister0. When the controller finishes receiving the data from PageRegister1, the content of PageRegister0 is transferred to PageRegister1 and sent to the controller.
[0034] The command/add state machine checks if the number of read has been achieved by looking at the value in the read-value register. The value in this register is loaded by the controller before the start of the read command to indicate the number of read operation requested.
[0035] FIG. 5aillustrates the prior art approach showing the state of I/O bus where there is a read command phase followed by an address phase and a waiting period for the data to be read from the flash memory array before it is shifted on to the bus. This cycle is followed by another waiting period before data can be shifted on to the bus. FIG. 5billustrates the state of the ready signal. FIG. 6aillustrates the state of the I/O bus under the preferred embodiment where a read command phase is followed by an address phase and a waiting period for reading of the first data. After the first word of data is read, it can be shifted on to the bus. When the data is being transferred to the controller, the next data word is read from the flash memory array. In this manner, data can be rapidly transferred from the memory on to the bus. FIG. 6billustrates the state of the ready signal where the timing for starting the reading operation for the next word of data is indicated at 60.
[0036] In an alternate embodiment, a first latch can be put in place selectively connect PageRegister0 or PageRegister1 to the flash memory array and a second latch can be put into place to selectively connect PageRegister0 and PageRegister1 to the I/O bus. In this manner, maximum flexibility can be afforded in operating this circuit.
[0037] FIG. 7 illustrates the operating steps in a write operation. Here, in the first step 200, a write command is received and the command is decoded 202. The received data is shifted into an available PageRegister 204 and the write to memory array operation is initiated 206. The write operation is constantly checked for completion 208. Once the operation is completed, the logic checks for errors in the write operation 210. If there is an error in the write operation, the appropriate status register is set 212. At the same time the memory array is being written, the logic checks for the existence of a subsequent write operation. If there is another pending write operation, it is processed in the same manner where the logic flows back to step 202.
[0038] 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 modifications as fall within the true spirit and scope of the invention.
Claims
What I claim is:
1. A nonvolatile memory control circuit for controlling reading and writing operations to and from a nonvolatile memory array, comprising:
a set of page registers having at least a first page register and a second page register for buffering data that is to be written to or read from a nonvolatile memory array; said control circuit for receiving commands to operate said set of page registers for reading from and writing to said nonvolatile memory array;
a set of address latches coupled to the nonvolatile memory array, said set of address latches having at least a first address latch for receiving data addresses for addressing the nonvolatile memory array;
a state machine for operating said set of page registers and said address latches;
an address decoder for receiving and decoding data addresses to the nonvolatile memory array;
a state machine control logic for operating said machine in response to received commands; and
wherein during a current write command, data corresponding to the current write command is stored in said second page register while data corresponding to a previous write command is stored in the nonvolatile memory array from the first page register thereby creating a pipe-lining affect so as to expedite the performance of write operations to the nonvolatile memory array.
2. A nonvolatile memory control circuit as recited in claim 1 wherein during a first time period, said control circuit operates said set of address latches to have a first data address from said first address latch decoded for a read operation.
3. A nonvolatile memory control circuit as recited in claim 2 wherein, in a second time period, data read from said first data address of said memory array is fetched and placed in said first page register.
4. A nonvolatile memory control circuit as recited in claim 3 wherein, in said second time period, data in said first page register is transferred to a bus.
5. A nonvolatile memory control circuit as recited in claim 3 wherein said control circuit, in a second time period, operates said set of address latches to have a second data address from said second address latch decoded for a read operation.
6. A nonvolatile memory control circuit as recited in claim 5 wherein, in a third time period, data read from said second data address of said nonvolatile memory array is fetched and placed in said second page register.
7. A nonvolatile memory control circuit as recited in claim 1 wherein said control circuit, in a first time period, operates said set of address latches to have a first data address from said first address latch decoded for a write operation.
8. A nonvolatile memory control circuit as recited in claim 7 wherein, in a second time period, data stored in said first page register is placed in the nonvolatile memory array.
9. A nonvolatile memory control circuit as recited in claim 7 wherein said control circuitry, in said first time period, causes said first page register to store data to be stored in said memory array.
10. A nonvolatile memory control circuit as recited in claim 9 wherein said control circuit, in a second time period, operates said set of address latches to have a second data address from said second address latch decoded for a write operation.
11. A nonvolatile memory control circuit as recited in claim 10 wherein said control circuit, in said second time period, causes said second page register to store data to be stored in the nonvolatile memory array.
12. A nonvolatile memory control circuit for controlling reading and writing operations to and from a nonvolatile memory array, comprising:
a set of page registers coupled to a nonvolatile memory array, said set of page registers having at least a first page register and a second page register for buffering data that is to be written to or read from the nonvolatile memory array; said control circuit for receiving commands to operate said set of page registers for reading from and writing to the nonvolatile memory array;
control circuitry coupled to said set of page registers and the nonvolatile memory array wherein during a current write command, data corresponding to said write command is stored in said second page register while data corresponding to a previous write command is being stored in the nonvolatile memory array from the first page register thereby creating a pipe-lining affect to expedite performing write operations on the nonvolatile memory array;
a set of address latches coupled to the nonvolatile memory array, said set of address latches having at least first address latch for receiving data addresses for addressing the nonvolatile memory array;
a state machine for operating said set of page registers and said address latches;
an address decoder for receiving and decoding data addresses to the nonvolatile memory array; and
a state machine control logic for operating said state machine in response to received commands.
Patent Citations (176)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3633175(A) | 1972-01-01 | Harper | Applicant |
| US4006457(A) | 1977-02-01 | Hepworth et al. | Applicant |
| US4013902(A) | 1977-03-01 | Payne | Applicant |
| US4210959(A) | 1980-07-01 | Wozniak | Applicant |
| US4250570(A) | 1981-02-01 | Tsang et al. | Applicant |
| US4279024(A) | 1981-07-01 | Schrenk | Applicant |
| US4281398(A) | 1981-07-01 | McKenny et al. | Applicant |
| US4295205(A) | 1981-10-01 | Kunstadt | Applicant |
| US4309627(A) | 1982-01-01 | Tabata | Applicant |
| US4354253(A) | 1982-10-01 | Naden | Applicant |
| US4355376(A) | 1982-10-01 | Gould | Applicant |
| US4380066(A) | 1983-04-01 | Spencer et al. | Applicant |
| US4392208(A) | 1983-07-01 | Burrows et al. | Applicant |
| US4405952(A) | 1983-09-01 | Slakmon | Applicant |
| US4422161(A) | 1983-12-01 | Kressel et al. | Applicant |
| US4450559(A) | 1984-05-01 | Bond et al. | Applicant |
| US4456971(A) | 1984-06-01 | Fukuda et al. | Applicant |
| US4462086(A) | 1984-07-01 | Kurakake | Applicant |
| US4463450(A) | 1984-07-01 | Haeusele | Applicant |
| US4479214(A) | 1984-10-01 | Ryan | Applicant |
| US4493075(A) | 1985-01-01 | Anderson et al. | Applicant |
| US4498146(A) | 1985-02-01 | Martinez | Applicant |
| US4514830(A) | 1985-04-01 | Hagiwara et al. | Applicant |
| US4525839(A) | 1985-07-01 | Nozawa et al. | Applicant |
| US4527251(A) | 1985-07-01 | Nibby, Jr. 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 |
| US4642759(A) | 1987-02-01 | Foster | Applicant |
| US4654847(A) | 1987-03-01 | Dutton | Applicant |
| US4672240(A) | 1987-06-01 | Smith et al. | Applicant |
| US4688219(A) | 1987-08-01 | Takemae | Applicant |
| US4710871(A) | 1987-12-01 | Belknap et al. | Applicant |
| US4718041(A) | 1988-01-01 | Baglee et al. | Applicant |
| US4727475(A) | 1988-02-01 | Kiremidjian | Applicant |
| US4733394(A) | 1988-03-01 | Giebel | Applicant |
| US4740882(A) | 1988-04-01 | Miller | Applicant |
| US4746998(A) | 1988-05-01 | Robinson et al. | Applicant |
| US4748320(A) | 1988-05-01 | Yorimoto et al. | Applicant |
| US4757474(A) | 1988-07-01 | Fukushi et al. | Applicant |
| US4774700(A) | 1988-09-01 | Satoh et al. | Applicant |
| US4785425(A) | 1988-11-01 | Lavelle | Applicant |
| US4794568(A) | 1988-12-01 | Lim et al. | Applicant |
| US4796233(A) | 1989-01-01 | Awaya et al. | Applicant |
| US4800520(A) | 1989-01-01 | Iijima | Applicant |
| US4814903(A) | 1989-03-01 | Kulakowski et al. | Applicant |
| US4849927(A) | 1989-07-01 | Vos | Applicant |
| US4887234(A) | 1989-12-01 | Iijima | Applicant |
| US4896262(A) | 1990-01-01 | Wayama et al. | Applicant |
| US4914529(A) | 1990-04-01 | Bonke | Applicant |
| US4920518(A) | 1990-04-01 | Nakamura et al. | Applicant |
| US4924331(A) | 1990-05-01 | Robinson et al. | Applicant |
| US4942556(A) | 1990-07-01 | Sasaki et al. | Applicant |
| US4943962(A) | 1990-07-01 | Imamiya et al. | Applicant |
| US4945535(A) | 1990-07-01 | Hosotani et al. | Applicant |
| US4949240(A) | 1990-08-01 | Iijima et al. | Applicant |
| US4949309(A) | 1990-08-01 | Rao | Applicant |
| US4953122(A) | 1990-08-01 | Williams | Applicant |
| US4958323(A) | 1990-09-01 | Sugawara et al. | Applicant |
| US5003591(A) | 1991-03-01 | Kauffman et al. | Applicant |
| US5034926(A) | 1991-07-01 | Taura et al. | Applicant |
| US5043940(A) | 1991-08-01 | Harari | Applicant |
| US5053990(A) | 1991-10-01 | Kreifels et al. | Applicant |
| US5058074(A) | 1991-10-01 | Sakamoto | Applicant |
| US5070474(A) | 1991-12-01 | Tuma et al. | Applicant |
| US5095344(A) | 1992-03-01 | Harari | Applicant |
| US5134589(A) | 1992-07-01 | Hamano | Applicant |
| US5138580(A) | 1992-08-01 | Farrugia | Applicant |
| US5155705(A) | 1992-10-01 | Goto et al. | Applicant |
| US5163021(A) | 1992-11-01 | Mehrotra et al. | Applicant |
| US5168465(A) | 1992-12-01 | Harari | Applicant |
| US5172338(A) | 1992-12-01 | Mehrotra et al. | Applicant |
| US5198380(A) | 1993-03-01 | Harari | Applicant |
| US5200959(A) | 1993-04-01 | Gross et al. | Applicant |
| US5226168(A) | 1993-07-01 | Kobayashi et al. | Applicant |
| US5268318(A) | 1993-12-01 | Harari | Applicant |
| US5268870(A) | 1993-12-01 | Harari | Applicant |
| US5268928(A) | 1993-12-01 | Herh et al. | Applicant |
| US5270979(A) | 1993-12-01 | Harari et al. | Applicant |
| US5280198(A) | 1994-01-01 | Almulla | Applicant |
| US5283762(A) | 1994-02-01 | Fujishima | Applicant |
| US5283882(A) | 1994-02-01 | Smith et al. | Applicant |
| US5293560(A) | 1994-03-01 | Harari | Applicant |
| US5297148(A) | 1994-03-01 | Harari et al. | Applicant |
| US5303198(A) | 1994-04-01 | Adachi et al. | Applicant |
| US5315541(A) | 1994-05-01 | Harari et al. | Applicant |
| US5329491(A) | 1994-07-01 | Brown et al. | Applicant |
| US5337275(A) | 1994-08-01 | Garner | Applicant |
| US5341330(A) | 1994-08-01 | Wells et al. | Applicant |
| US5341339(A) | 1994-08-01 | Wells | Applicant |
| US5343086(A) | 1994-08-01 | Fung et al. | Applicant |
| US5353256(A) | 1994-10-01 | Fandrich et al. | Applicant |
| US5357475(A) | 1994-10-01 | Hasbun et al. | Applicant |
| US5363335(A) | 1994-11-01 | Jungroth et al. | Applicant |
| US5369615(A) | 1994-11-01 | Harari et al. | Applicant |
| US5388083(A) | 1995-02-01 | Assar et al. | Applicant |
| US5396468(A) | 1995-03-01 | Harari et al. | Applicant |
| US5418752(A) | 1995-05-01 | Harari et al. | Applicant |
| US5422842(A) | 1995-06-01 | Cernea et al. | Applicant |
| US5428569(A) | 1995-06-01 | Kato et al. | Applicant |
| US5428621(A) | 1995-06-01 | Mehrotra et al. | Applicant |
| US5430682(A) | 1995-07-01 | Ishikawa et al. | Applicant |
| US5430859(A) | 1995-07-01 | Norman et al. | Applicant |
| US5434825(A) | 1995-07-01 | Harari | Applicant |
| US5438573(A) | 1995-08-01 | Mangan et al. | Applicant |
| US5446408(A) | 1995-08-01 | Tedrow et al. | Applicant |
| US5471478(A) | 1995-11-01 | Mangan et al. | Applicant |
| US5479633(A) | 1995-12-01 | Wells et al. | Applicant |
| US5479638(A) | 1995-12-01 | Assar et al. | Applicant |
| US5485595(A) | 1996-01-01 | Assar et al. | Applicant |
| US5495442(A) | 1996-02-01 | Cernea et al. | Applicant |
| US5495453(A) | 1996-02-01 | Wociechowski et al. | Applicant |
| US5502682(A) | 1996-03-01 | Yoshimura et al. | Applicant |
| US5504760(A) | 1996-04-01 | Harari et al. | Applicant |
| US5508971(A) | 1996-04-01 | Cernea et al. | Applicant |
| US5524230(A) | 1996-06-01 | Sakaue et al. | Applicant |
| US5526508(A) | 1996-06-01 | Park et al. | Examiner |
| US5532962(A) | 1996-07-01 | Auclair et al. | Applicant |
| US5532964(A) | 1996-07-01 | Cernea et al. | Applicant |
| US5534456(A) | 1996-07-01 | Yuan et al. | Applicant |
| US5535328(A) | 1996-07-01 | Harari et al. | Applicant |
| US5544118(A) | 1996-08-01 | Harari | Applicant |
| US5544356(A) | 1996-08-01 | Robinson et al. | Applicant |
| US5554553(A) | 1996-09-01 | Harari | Applicant |
| US5563825(A) | 1996-10-01 | Cernea et al. | Applicant |
| US5566314(A) | 1996-10-01 | DeMarco et al. | Applicant |
| US5568439(A) | 1996-10-01 | Harari | Applicant |
| US5581723(A) | 1996-12-01 | Hasbun et al. | Applicant |
| US5583812(A) | 1996-12-01 | Harari | Applicant |
| US5586285(A) | 1996-12-01 | Hasbun et al. | Applicant |
| US5592415(A) | 1997-01-01 | Kato et al. | Applicant |
| US5592420(A) | 1997-01-01 | Cernea et al. | Applicant |
| US5603001(A) | 1997-02-01 | Sukegawa et al. | Applicant |
| US5603052(A) | 1997-02-01 | Chejlava, Jr. et al. | Examiner |
| US5630171(A) | 1997-05-01 | Chejlava, Jr. et al. | Examiner |
| US5642312(A) | 1997-06-01 | Harari | Applicant |
| US5663901(A) | 1997-09-01 | Wallace et al. | Applicant |
| US5693570(A) | 1997-12-01 | Cernea et al. | Applicant |
| US5712819(A) | 1998-01-01 | Harari | Applicant |
| US5719808(A) | 1998-02-01 | Harari et al. | Applicant |
| US5745732(A) | 1998-04-01 | Cherukuri et al. | Examiner |
| US5778418(A) | 1998-07-01 | Auclair et al. | Applicant |
| US5809558(A) | 1998-09-01 | Matthews et al. | Applicant |
| US5822245(A) | 1998-10-01 | Gupta et al. | Applicant |
| US5822765(A) | 1998-10-01 | Boatright et al. | Examiner |
| US5826107(A) | 1998-10-01 | Cline et al. | Examiner |
| US5831929(A) | 1998-11-01 | Manning | Applicant |
| US5835935(A) | 1998-11-01 | Estakhri et al. | Applicant |
| US5845313(A) | 1998-12-01 | Estakhri et al. | Applicant |
| AU557723 | 1987-01-01 | Applicant | |
| EP220718(A2) | 1987-05-01 | Applicant | |
| EP243503(A1) | 1987-11-01 | Applicant | |
| EP424191(A2) | 1991-04-01 | Applicant | |
| EP489204(A1) | 1992-06-01 | Applicant | |
| EP522780(A2) | 1993-01-01 | Applicant | |
| EP544252(A2) | 1993-06-01 | Applicant | |
| EP686976(A2) | 1995-12-01 | Applicant | |
| FR9301908 | 1993-08-01 | Applicant | |
| JP59-45695(A) | 1982-09-01 | Applicant | |
| JP58-215794(A) | 1983-12-01 | Applicant | |
| JP58-215795(A) | 1983-12-01 | Applicant | |
| JP59-162695(A) | 1984-09-01 | Applicant | |
| JP60-212900 | 1985-01-01 | Applicant | |
| JP60076097 | 1985-04-01 | Applicant | |
| JP60-178564 | 1985-09-01 | Applicant | |
| JP61-96598(A) | 1986-05-01 | Applicant | |
| JP62-283496(A) | 1987-12-01 | Applicant | |
| JP62-283497(A) | 1987-12-01 | Applicant | |
| JP63-183700(A) | 1988-07-01 | Applicant | |
| JP1054543 | 1989-03-01 | Applicant | |
| JP4-332999(A) | 1992-11-01 | Applicant | |
| JP6-250798 | 1994-09-01 | Applicant | |
| WO84/00628 | 1984-02-01 | Applicant |
Non-Patent Literature (4)
- Book—Computer Architecture and Parallel Processing, Kai Hwang & Faye A. Briggs, McGraw-Hill Book Co., © 1984, p. 64.Applicant
- Magazine—“State of the Art: Magnetic Vs. Optical Store Data in a Flash”, by Walter Lahti and Dean McCarron, Byte magazine dated Nov. 1, 1990, 311, vol. 15, No. 12.Applicant
- Magazine—Technology Updates, Integrated Circuits, “1-Mbit flash memories seek their role in system design”, Ron Wilson, Senior Editor, Computer Design magazine 28 (1989) Mar. 1, No. 5, Tulsa OK, US, pp. 30 and 32.Applicant
- 1992 Symposium of VLSI Circuits Digest of Technical Papers, “EEPROM for Solid State Disk Applications”, S. Mehoura et al., SunDisk Corporation, Santa Clara, R. W. Gregor et al., AT&T Bell Laboratories, Allentown, PA. pp. 24 and 25.Applicant