US 7,000,064 B2Grant
Data handling system
Issue Date:2006-02-14
•7 Claims
•5 Drawing Sheets
Abstract
In one embodiment of the present invention, there is disclosed, a method of handling data which is being written to and stored in flash memory, wherein input data, comprising information data and overhead data, undergoes a reversible transformation before being written to flash memory whereupon each bit stored in flash memory, as flash data, is a function of both information data and header data.
Metadata
Assignee
- Lexar Media, Inc.
Inventors
- Robert Edwin Payne
- Peter John Smith
Application Information
Application Number:US 10/260,180
Filing Date:2002-09-27
Priority Date:2001-09-28
Art Unit:2189
Classifications
IPC:
G06F12/00
Patent Drawings (5 sheets)
Description
Background of the Invention
Cross Reference to Related Application
[0001] This application claims the benefit of the priority date of my earlier filed British Application No. 0123419.4, entitled “Data Handling System”, filed on Sep. 28, 2001.
[0002] 1. Field of the Invention
[0003] This invention relates generally to electronic data handling system utilizing flash memory for data storage and particularly to providing improved security of the information data stored in flash memory.
[0004] 2. Description of the Prior Art
[0005] In electronic data handling systems, utilizing flash memory data is typically transferred to and from the flash memory in blocks of 528 bytes, which together form one sector or page. In some known system, each sector is composed of 512 bytes of information data (which can either be provided by a host and represents user data, or can be provided by a controller, for example, representing a cyclic storage algorithm data structure), a further 4 bytes of overhead data (which typically is provided by the controller and represents index or header data pertinent to the associated 512 bytes of information data), and a further 12 bytes of data which provide an error correction code for the associated 517 bytes of data.
[0006] Accordingly, each sector is partitioned into at least a user data portion and an overhead portion and consequently, by inspection of the flash memory, it is fairly straightforward by reverse engineering to identify the whole of the information data from the succession of 512 bytes provided by the succession of sectors stores in the flash memory. Security of the information data is therefore dependent upon security of the flash memory itself. Thus, the need arises to provide improved security of the information data stored in flash memory.
Summary of the Invention
[0007] It is an object of the present invention to provide improved security of the information data stored in flash memory.
[0008] This object is achieved by manipulating the 516 bytes of information and overhead data prior to storage in flash memory such that each stored byte is a reversible function of both information data and overhead data as a result of a data hiding process.
[0009] By virtue of the present invention security of the information data is enhanced because the bytes stored in a flash memory sector are no longer partitioned, and each byte is no longer identifiable as being an information data byte or an overhead data byte.
[0010] The present invention in a first aspect comprises a method of handling data which is being written to and stored in flash memory, wherein input data, comprising information data and overhead data, undergoes a reversible transformation before being written to flash memory whereupon each bit stored in flash memory, as flash data, is a function of both information data and header data.
[0011] Conveniently the input data comprises 512 bytes of information data and 4 bytes of overhead data.
[0012] Preferably the reversible transformation of input data which results in the flash data is an XOR function combining bytes of information data and overhead data. For example, 4 bytes of overhead data may be XORd with each of the succession of 128 4 byte sequences which from the 512 bytes of information data to provide 512 bytes of flash data whilst these 512 bytes of flash data are used to generate a 4 byte ECC function which is XORd with the 4 bytes of overhead data to produce a further 4 bytes of flash data.
[0013] Preferably the data handling process also produces 12 bytes of error detection and correction capability (ECC) for storage in the flash memory.
[0014] Conveniently the ECC is a function of said flash data.
[0015] Conveniently the transformation is implemented by an encoder.
[0016] Conveniently the method of writing and storing data in flash memory comprises input data being written first to a buffer memory without modification, the input data then being written from the buffer memory, via an encoder to the flash memory.
[0017] Preferably the encoder comprises a plurality of XOR gates.
[0018] In a second aspect the invention comprises a method of reading encoded data from the flash memory, wherein the encoded data undergoes a reverse transformation which returns the input data to information data and overhead data format.
[0019] Preferably the decoder comprises a plurality of XOR gates.
[0020] The foregoing and other objects, features and advantages of the present invention will be apparent from the following detailed description of the preferred embodiments which make reference to several figures of the drawing.
In the Drawings
[0021] FIG. 1 show s a schematic representation of the method of handling input data according to a first embodiment of the present invention;
[0022] FIG. 2 shows a schematic diagram of the data handling including ECC generation;
[0023] FIG. 3 shows a schematic diagram of the circuit arrangement which implements the data handling;
[0024] FIG. 4 shows a memory system with a single port controller SRAM memory having an associated encoder and decoder;
[0025] FIG. 5 shows a dual port memory having two encoders;
[0026] FIG. 6 a shows a first single port memory having two encoders;
[0027] FIG. 6 b shows a second single port memory having one encoder;
[0028] FIG. 7 shows a schematic diagram of the circuit arrangement which implements data manipulation according to a third embodiment of the invention.
Detailed Description of the Preferred Embodiments
[0029] With reference to FIG. 1 , a first embodiment of the data handling system is shown. In this basic arrangement input data 10 comprises two portions, namely 512 bytes of information data 12 and 4 bytes of header data 14. A first sequence of 4 bytes of information data 12 and the 4 bytes of header data 14 are read, at the same time, from the input data and these 8 bytes of data are transferred to XOR gate 16 whereupon they are transformed by the XOR function to a modified 4 byte data set before being written to the flash memory 18. This process is repeated until all possible 512 bytes of transformed input data have been written to the flash memory 18. The 4 bytes of header data then undergo the XOR transformation with 4 bytes of control hiding key, which are 4 bytes from the incomplete ECC result generated from the 512 bytes of transformed information data, to provide the remaining 4 bytes of flash data. The XOR transformation means that each of the 516 bytes of flash data 20 is a function of information data 12 and header data 14. From the 516 bytes of flash data, 12 bytes of error correction code (ECC) 22 are produced which provides an error detection and correction capability. These 12 ECC bytes 22 are also a function of both information data and header data. This process can be reversed because the XOR function is reversible to enable the reading of transformed data stored in the flash memory.
[0030] In FIG. 2 a second embodiment of the data handling process is shown giving a more detailed overview of the handling process and illustrating the generation of the ECC function more clearly. A first 4 byte word of information data, in this case user data 12a supplied by the host, undergoes an XOR operation 16a with the 4 bytes of header data 14 to form the 4 bytes of data 22a to be written in the corresponding location of the flash memory 18. This is repeated for each other 4 byte word of user data 12. A 4 byte ECC word, generated by an ECC function 21a from the first 512 bytes of data which are output from XOR gates 16a to 16y and transferred to the flash memory 18, undergoes an XOR operation with the 4 bytes of header data 14 to form the 4 bytes of data 15 to be written in the position in the flash memory 18 corresponding to the header data 14. This means the 4 byte ECC word is a function of all 512 bytes of information data. 12 bytes of ECC 22 are also generated by ECC function 216 from the modified 512 bytes of user data output from XOR gates 16a to 16y plus the 4 bytes of user data output from XOR gates 16a to 16y plus the 4 bytes of header dada output from XOR gate 16z and are appended to the 516 bytes of generated data to complete the 528 byte page or sector which is stored in flash memory 18. As can be seen in FIG. 2 , the transformation which is implemented in the data handling process maintains the data address sequence of the input data when writing to flash memory, thus information byte 12a is transformed by XOR transformation 16a and is written to the flash memory 20 as transformed data byte 22a, the subsequent information data byte 12b is written to the flash memory as transformed data byte 22b, and so on for data bytes c, d, etc. After the final information data byte 12y has been transformed and written to the flash memory data address 22y, the header data 14, when transformed by XOR transformation 16z, is written to the flash memory data address 15 corresponding to the end of the transformed information data array. The data address sequence is thus maintained during the data handling process. This is also true of when the process is operated in the reverse decoding process.
[0031] The algorithms involved in the handling process carried out by the encoder/decoder will now be described using the following notation and symbols. The 512 byte information data array is represented as D [ ]. The 4 byte header data array is represented as C [ ]. The flash data is a 516 byte array in flash memory denoted by F [ ]. c, k and j are integer constants chosen from the ranges 0≦c>3, 0≦k≦511, and 0≦j≦11. ! is a one byte data hiding key generated by q(C), which is the data hiding key generation function, from header data C[ ] with
Q=q(C) (1)
where, for example q(C)=C[c] (2)
P is a one byte header hiding key generated by a header hiding key generating function p( ) by
P=p(F[0,511]) (3)
where, for example p(F[0,511])=rotate(F[k]) (4)
The error correction code ECC generation function is represented as ecc( ) and is an algorithm such as Reed Solomon encoding, ⊕ is a bytewise XOR function and rotate( ) is a bitwise byte rotation function.
Q=q(C) (1)
where, for example q(C)=C[c] (2)
P is a one byte header hiding key generated by a header hiding key generating function p( ) by
P=p(F[0,511]) (3)
where, for example p(F[0,511])=rotate(F[k]) (4)
The error correction code ECC generation function is represented as ecc( ) and is an algorithm such as Reed Solomon encoding, ⊕ is a bytewise XOR function and rotate( ) is a bitwise byte rotation function.
[0032] The encoding of the input data to give flash data is described by the following for the xth byte of the array.
F[x]=D[x]⊕Q where 0≦x≦511 (5)
F[x]=C[x−512]⊕P for 512≦x≦515 (6)
and F[x]=ecc(F[0,515]) for 516≦x≦527 (7)
These result in all bits in flash data being a function of both information data and header data, and the error correction code is a function of flash data.
F[x]=D[x]⊕Q where 0≦x≦511 (5)
F[x]=C[x−512]⊕P for 512≦x≦515 (6)
and F[x]=ecc(F[0,515]) for 516≦x≦527 (7)
These result in all bits in flash data being a function of both information data and header data, and the error correction code is a function of flash data.
[0033] The encoding process of the input data is as follows, the data hiding key Q is firstly generated by equation (1), using the key generation function of equation (2). Next equation (5) is used to generate part of the flash data page F[0, 511] by performing a bytewise XOR of the data hiding key Q with information data D[ ]. As Q is a function of header data C[ ], the flash data F[0, 511] is a function of both information data D[ ] and header data C[ ]. The header hiding key P is generated by equation (3) from the flash data calculated by equation (4). The next part of the flash data F[512, 515] is generated by performing a bytewise XOR of header hiding key P with header data C[ ]. As P is a function of flash data F[0, 511] which is in turn a function of both information data D[ ] and header data C[ ], then F[512, 515] is a function of both information D[ ] and header data C[ ]. Finally the error correction code ECC is added to the flash page as F[516, 527] calculated by equation (7). The ECC is a function of F[0, 515] which has been shown above to be a function of both information data D[ ] and header data C[ ]. Thus the whole of the flash page is a function of both information data D[ ] and header data C[ ] and therefore the information data and control data cannot be readily distinguished.
[0034] The decoding of flash data follows the reverse of the above transformation processes to return from the flash data F[ ] to the format of separate information data D[ ] and header data C[ ] and uses the equations
C[x−512]=F[x]⊕P for 512≦x≦515 (8)
and
D[x]=F[x]⊕Q for 0≦x≦511 (9)
C[x−512]=F[x]⊕P for 512≦x≦515 (8)
and
D[x]=F[x]⊕Q for 0≦x≦511 (9)
[0035] The first state of the decoding process is to check that the ECC is valid. ECC checking ensures that equation (7) holds true for the flash data read from the flash memory. If this is not true then the error correction algorithm is applied to correct the flash data array so that equation (7) does hold true.
[0036] After checking for errors, equation (3) is applied to calculate control hiding key P. The header data C[ ] can be restored using equation (8) which is a re-arrangement of equation (6). The data hiding key Q can then be calculated using equation (1). Q can then be used to restore the information data-D[ ] by applying equation (9), which is a re-arrangement of equation (5).
[0037] In practice the implementation of the data manipulation process in the encoder/decoder is split into two parts. The calculation of the key generation functions Q and P is performed in firmware executing within the microprocessor. The calculation of the flash data is performed by hardware as the alteration of large volumes of data involved in the calculations would be overly intensive for firmware. A schematic diagram of one embodiment of the circuit which could implement the encoding or decoding processes of equations (5), (6), (8) and (9) is shown in FIG. 3. For the purposes of clarity FIG. 3 will be described referring to an encoder but it should be understood that the corresponding process of decoding may be carried out by the same arrangement.
[0038] Firstly a value representing the data hiding key P is written to the key register 17 from the firmware which is typically a controller comprising an SRAM and microprocessor. The microprocessor then triggers the transfer of data through the hardware, i.e. the encoder. User data and header data is fed from the controller SRAM through the encoder 30 in 32 bit word serial fashion which is then converted to byte serial data which is XORd, by XOR gate 16, with the appropriate key, that is the data hiding key P and the control hiding key Q respectively, and is then passed to the byte serial data output. The microprocessor of the controller determines which of the appropriate keys of P and Q should be implemented by the key register 17 depending on the data being transferred. The byte serial data output is then, typically, fed into the ECC generation circuitry. This encoder/decoder 30 can be inserted as a decoder into any serial byte stream through which the flash data is written or as an encoder, into any serial byte stream through which the flash data is read. The encoder/decoder an also be integrated with other memory elements with the encoder/decoder being placed on the input or output data ports from a memory.
[0039] There are numerous possible configurations for encoding/decoding on reading/writing data from both single port and dual port memories.
[0040] In one embodiment, shown in FIG. 4 , there is shown a controller 32 for use in a memory system, the controller 32 comprising a host interface 36, a flash memory interface 37, an SRAM memory 54 and a microprocessor 34. An encoder 40, having key register 41, is placed on the read port 52 of a single port SRAM memory 54. A multiplexer 53 is placed on the write port 51 of SRAM 54 and is used by control logic within the controller, to select the source of data into the SRAM on each clock cycle from the input options of the host provided via host interface 36, the microprocessor 34 or the flash memory provided via the flash memory interface 37. Due to the arrangement of the memory system and the encoder 40 being arranged to perform a symmetric function on the data, the encoder 40 can also perform a decoding function. If input data is written from host via host interface 36 to the SRAM 54, then as this data is read from the SRAM it is transformed by the encoder 40 having data hiding and control hiding keys provided by key register 41. The transformed data is stored in the flash memory. In the process to return the data to the host, the transformed data is first written from the flash memory via the multiplexer 53 to the SRAM 54. As the data is then written to the host interface 36 it is transformed upon being read from the SRAM 54 by the encoder 40 on read port 52. As the encoder is performing a symmetric function on the data for a second time this results in unencoded data being written to the host.
[0041] In a single port memory system such as that of FIG. 4 , only one “block,” i.e. only one of the host interface, flash interface or microprocessor can access the memory sub-system during one clock cycle, however in some systems it is desirable for the SRAM memories of the controller to have dual ports for reading and writing, so that the SRAM can be simultaneously accessed by two blocks at any one time, for example to allow the microprocessor to read data from the SRAM memory whilst data is simultaneously being transferred to flash. Such a system allows memory operations to occur in parallel. Such a system also provides the facility for each block to have data hidden in different ways within the SRAM 56. An example of such a system is shown in FIG. 5 wherein the dual port SRAM memory 56 of the controller 32 has read data ports 57a and 57b, and write data ports 58a and 58b. Encoders 50a and 50b are placed on read data ports 57a and 57b respectively. Each encoder 50a and 50b has a separate key, these are keys 59a and 59b respectively, to enable each stream of data to be encoded or effectively decoded as appropriate.
[0042] In the arrangement shown the microprocessor 34 and host interface 36 share access via multiplexer 55 of write port 58a of the SRAM 56, and share access of read port 57a. The Flash interface has write port 58b and write port 57b of the SRAM dedicated to itself.
[0043] FIGS. 6 a and 6b show alternative configurations of multiple encoders and associated SRAM memory 60 which could be integrated within memory systems in the same manner as illustrated in FIGS. 4 and 5 . When the memory 60 is integrated within such a memory system, the order of data being read to and from the SRAM memory 60 is defined by the order of addresses sent to the memory 60 by controlling logic of the controller via address bus 60a. As part of the system, several processes within the processor may be accessing different portions of memory that are being hidden using a different data hiding key.
[0044] In FIG. 6 a there is shown a single port SRAM memory 60 with encoders 62 and 63, having data hiding keys 64 and 65 respectively, located in parallel on the read data port 61. Some of the bits within the address sent to the SRAM memory 60 determines which of encoders 62 and 63 should be used. Multiplexer 66 is used by the controller to choose between the encoder output to be used.
[0045] An alternative arrangement for such a configuration is shown in FIG. 6 b, with a single encoder 67 being situated on read data port 61. Two keys, 68 and 69, are provided with multiplexer 66 being arranged between the key buses and the encoder 67. In this arrangement the multiplexer 76 uses some bits within the input address to determine which of the keys 68 and 69 is fed into the decoder 67.
[0046] It should be noted that the above are not an exhaustive selection of configurations. Also in any of the above disclosed configurations it should be understood that the encoder/decoder could be placed on the write or output data port of the SRAM memory.
[0047] Another embodiment of the circuit in which the transformation process may be implemented is shown in FIG. 7. This arrangement is an example of how the data handling process can be implemented in hardware which allows both transformed and untransformed data to be written to the flash memory for storage. Data is read from the SDRAM 74 and transferred along read port 76 which splits into two read data lines 76a and 76b respectively. In this case the address supplied to the memory 74 is used to choose between an output from the memory, which is “hidden” by the facility of Key 1, and an output from the memory which is not encoded or decoded. If the data travels along read data line 76a, it undergoes an XOR transformation implemented by the encoder 70. The transformed data is then read to multiplexer 82 from where it is transferred by bus 86 to the flash memory 18. The transformed data can also be accessed from bus 16 by the host 88 or the microprocessor 84. However, the provision of multiplexer 82 means that the information data may alternatively be written directly to the bus from the SDRAM 74 without transformation upon transfer along read data line 76b.
[0048] Various modifications may be made to the invention as hereinafter described without departing from the scope of the invention. For example different symmetrical reversible transformations, such as NXOR (not XOR), or an XOR gate followed by the swapping of data bits may be used instead of the described XOR function, to combine the information data and header data. Alternatively functions which are asymmetric, such as addition modulo-256 could be used, however these would make the transformation more difficult to reverse engineer and thus would require more complex hardware as different keys would be required for both encoding and decoding, however the data flow would remain the same. The transformation may also be implemented on words of any size as the algorithms used are defined on bytes. This means the word could be of a size of 4 bytes for example.
[0049] The equation (1) which describes the function for generating the data hiding key, using header data C as a parameter, can be expanded to include other parameters thus making the data hiding key a more complex function. For example, as shown in equation (1b), a security key. K security, provided by the host or generated by, for example, the algorithm, (shown in equation 2b), can be added
Q=q(C,Ksecurity) (1b)
q(C)=C[c] Ksecurity where 0≦c≦3 (2b)
Q=q(C,Ksecurity) (1b)
q(C)=C[c] Ksecurity where 0≦c≦3 (2b)
[0050] When implementing these equations the values stored in the flash sector F [0, 511] are changed and, as a result, since the header hiding key P is a function of F [0, 511], the value generated for P will also change.
[0051] It is possible for the information data and header data to be of a different size from that used in the examples given. This would have the effect of altering the ranges of functions D[ ], C[ ] and F[ ] as well as the ranges from which the integer constants c, k and j are chosen. Additionally it can be ensured that Q and P never lead to an identity transform, by detecting such values that would lead to an identity transform and substituting a suitable predetermined alternative.
[0052] Although the present invention has been described in terms of specific embodiments it is anticipated that alterations and modifications thereof will no doubt become apparent to those skilled in the art. It is therefore intended that the following claims be interpreted as covering all such alterations and modification as fall within the true spirit and scope of the invention.
Claims
What is claimed is:
1. A data handling system for handling data being written to or stored in flash memory comprising:
means for receiving input data including bits forming bytes and bytes being
stored in sectors within the flash memory, said input data including information data and overhead data;
means for reversibly transforming the input data,
wherein the transforming means is an encoder;
means for writing the transformed input data into the flash memory,
wherein the encoder performs an encoding process of the input data by generating a data hiding key Q, performing an XOR operation, on a byte-by-byte basis, of the data hiding key Q with the information data, generating a header hiding key P, performing an XOR operation, on a byte-by-byte basis, of the header hiding key P with the header data; and
wherein each bit of the input data that is written into flash memory, as flash data, is a function of both information data and overhead data thereby enhancing security of the information data due to the bytes of the input data stored in the flash memory sector no longer being partitioned, and each byte no longer being identifiable as being an information data byte or an overhead data byte.
2. A data handling system as recited in claim 1 wherein the input data comprises 512 bytes of information data and 4 bytes of overhead data.
3. A data handling system as recited in claim 1 wherein the means for reversibly transforming the input data results in the flash data being an XOR function combining bytes of information data and overhead data.
4. A data handling system as recited in claim 1 further including means for producing 12 bytes of error detection and correction capability (ECC) for storage in the flash memory.
5. A data handling system as recited in claim 4 wherein the ECC is a function of the flash data.
6. A data handling system as recited in claim 1 the encoder comprises a plurality of XOR gates.
7. A data handling system as recited in claim 1 including a buffer memory wherein the input data being written first to a buffer memory without modification, the input data then being transferred from the buffer memory, via the encoder, to the flash memory.
Patent Citations (293)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4099069(A) | 1978-07-01 | Cricchi et al. | Applicant |
| US4130900(A) | 1978-12-01 | Watanabe | Applicant |
| US4210959(A) | 1980-07-01 | Wozniak | Applicant |
| US4309627(A) | 1982-01-01 | Tabata | Applicant |
| US4319079(A) | 1982-03-01 | Best | Applicant |
| US4355376(A) | 1982-10-01 | Gould | Applicant |
| US4398248(A) | 1983-08-01 | Hsia et al. | Applicant |
| US4405952(A) | 1983-09-01 | Slakmon | Applicant |
| US4414627(A) | 1983-11-01 | Nakamura | Applicant |
| US4450559(A) | 1984-05-01 | Bond et al. | Applicant |
| US4456971(A) | 1984-06-01 | Fukuda et al. | Applicant |
| US4468730(A) | 1984-08-01 | Dodd et al. | Applicant |
| US4473878(A) | 1984-09-01 | Zolnowsky et al. | Applicant |
| US4476526(A) | 1984-10-01 | Dodd | Applicant |
| US4498146(A) | 1985-02-01 | Martinez | Applicant |
| US4525839(A) | 1985-06-01 | Nozawa et al. | Applicant |
| US4532590(A) | 1985-07-01 | Wallach et al. | Applicant |
| US4609833(A) | 1986-09-01 | Guterman | Applicant |
| US4616311(A) | 1986-10-01 | Sato | Applicant |
| US4654847(A) | 1987-03-01 | Dutton | Applicant |
| US4710871(A) | 1987-12-01 | Belknap et al. | 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 |
| US4780855(A) | 1988-10-01 | Iida et al. | Applicant |
| US4788665(A) | 1988-11-01 | Fukuda et al. | Applicant |
| US4797543(A) | 1989-01-01 | Watanabe | Applicant |
| US4800520(A) | 1989-01-01 | Iijima | Applicant |
| US4829169(A) | 1989-05-01 | Watanabe | Applicant |
| US4843224(A) | 1989-06-01 | Ohta et al. | 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 |
| US4943745(A) | 1990-07-01 | Watanabe et al. | Applicant |
| US4953122(A) | 1990-08-01 | Williams | Applicant |
| US4970642(A) | 1990-11-01 | Yamamura | Applicant |
| US4970727(A) | 1990-11-01 | Miyawaki et al. | Applicant |
| US5070474(A) | 1991-12-01 | Tuma et al. | Applicant |
| US5093785(A) | 1992-03-01 | Iijima | Applicant |
| US5168465(A) | 1992-12-01 | Harari | Applicant |
| US5198380(A) | 1993-03-01 | Harari | Applicant |
| US5200959(A) | 1993-04-01 | Gross et al. | Applicant |
| US5218695(A) | 1993-06-01 | Noveck et al. | Applicant |
| US5220518(A) | 1993-06-01 | Haq | Applicant |
| US5226168(A) | 1993-07-01 | Kobayashi et al. | Applicant |
| US5227714(A) | 1993-07-01 | Lou | Applicant |
| US5253351(A) | 1993-10-01 | Yamamoto et al. | Applicant |
| US5267218(A) | 1993-11-01 | Elbert | Applicant |
| US5268318(A) | 1993-12-01 | Harari | Applicant |
| US5268870(A) | 1993-12-01 | Harari | Applicant |
| US5270979(A) | 1993-12-01 | Harari 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 |
| US5305276(A) | 1994-04-01 | Uenoyama | Applicant |
| US5305278(A) | 1994-04-01 | Inoue | Applicant |
| US5315541(A) | 1994-05-01 | Harari et al. | Applicant |
| US5315558(A) | 1994-05-01 | Hag | 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 |
| US5341341(A) | 1994-08-01 | Fukuzo | Applicant |
| US5353256(A) | 1994-10-01 | Fandrich et al. | Applicant |
| US5357475(A) | 1994-10-01 | Hasbun et al. | Applicant |
| US5359569(A) | 1994-10-01 | Fujita et al. | Applicant |
| US5365127(A) | 1994-11-01 | Manley et al. | Applicant |
| US5369615(A) | 1994-11-01 | Harari et al. | Applicant |
| US5371702(A) | 1994-12-01 | Nakai et al. | Applicant |
| US5381539(A) | 1995-01-01 | Yanai et al. | Applicant |
| US5382839(A) | 1995-01-01 | Shinohara | Applicant |
| US5384743(A) | 1995-01-01 | Rouy | Applicant |
| US5388083(A) | 1995-02-01 | Assar et al. | Applicant |
| US5396468(A) | 1995-03-01 | Harari et al. | Applicant |
| US5404485(A) | 1995-04-01 | Ban | Applicant |
| US5406527(A) | 1995-04-01 | Honma | Applicant |
| US5418752(A) | 1995-05-01 | Harari et al. | Applicant |
| US5422842(A) | 1995-06-01 | Cernea et al. | Applicant |
| US5422856(A) | 1995-06-01 | Sasaki 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 |
| US5431330(A) | 1995-07-01 | Wieres | Applicant |
| US5434825(A) | 1995-07-01 | Harari | Applicant |
| US5438573(A) | 1995-08-01 | Mangan et al. | Applicant |
| US5465235(A) | 1995-11-01 | Miyamoto | Applicant |
| US5465338(A) | 1995-11-01 | Clay | Applicant |
| US5471478(A) | 1995-11-01 | Mangan et al. | Applicant |
| US5473765(A) | 1995-12-01 | Gibbon et al. | Applicant |
| US5479638(A) | 1995-12-01 | Assar et al. | Applicant |
| US5485595(A) | 1996-01-01 | Assar et al. | Applicant |
| US5490117(A) | 1996-02-01 | Oda et al. | Applicant |
| US5495442(A) | 1996-02-01 | Cernea et al. | Applicant |
| US5504760(A) | 1996-04-01 | Harari et al. | Applicant |
| US5508971(A) | 1996-04-01 | Cernea et al. | Applicant |
| US5513138(A) | 1996-04-01 | Manabe et al. | Applicant |
| US5515333(A) | 1996-05-01 | Fujita et al. | Applicant |
| US5519847(A) | 1996-05-01 | Fandrich et al. | Applicant |
| US5523980(A) | 1996-06-01 | Sakui et al. | Applicant |
| US5524230(A) | 1996-06-01 | Sakaue et al. | Applicant |
| US5530673(A) | 1996-06-01 | Tobita et al. | Applicant |
| US5530828(A) | 1996-06-01 | Kaki et al. | Applicant |
| US5530938(A) | 1996-06-01 | Akasaka et al. | Applicant |
| 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 |
| US5541551(A) | 1996-07-01 | Brehner et al. | Applicant |
| US5544118(A) | 1996-08-01 | Harari | Applicant |
| US5544356(A) | 1996-08-01 | Robinson et al. | Applicant |
| US5552698(A) | 1996-09-01 | Tai 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 |
| US5572466(A) | 1996-11-01 | Sukegawa | Applicant |
| US5579502(A) | 1996-11-01 | Konishi et al. | Applicant |
| US5581723(A) | 1996-12-01 | Hasbun et al. | Applicant |
| US5583812(A) | 1996-12-01 | Harari | Applicant |
| US5592415(A) | 1997-01-01 | Kato et al. | Applicant |
| US5592420(A) | 1997-01-01 | Cernea et al. | Applicant |
| US5598370(A) | 1997-01-01 | Niijima | Applicant |
| US5602987(A) | 1997-02-01 | Harari et al. | Applicant |
| US5603001(A) | 1997-02-01 | Sukegawa et al. | Applicant |
| US5611067(A) | 1997-03-01 | Okamoto et al. | Applicant |
| US5640528(A) | 1997-06-01 | Harney et al. | Applicant |
| US5642312(A) | 1997-06-01 | Harari | Applicant |
| US5648929(A) | 1997-07-01 | Miyamoto | 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 |
| US5723990(A) | 1998-03-01 | Roohparvar | Applicant |
| US5734567(A) | 1998-03-01 | Griffiths et al. | Applicant |
| US5745418(A) | 1998-04-01 | Ma et al. | Applicant |
| US5754567(A) | 1998-05-01 | Norman | Applicant |
| US5757712(A) | 1998-05-01 | Nagel et al. | Applicant |
| US5758100(A) | 1998-05-01 | Odisho | Applicant |
| US5761117(A) | 1998-06-01 | Uchino et al. | Applicant |
| US5768190(A) | 1998-06-01 | Tanaka et al. | Applicant |
| US5768195(A) | 1998-06-01 | Nakamura et al. | Applicant |
| US5773901(A) | 1998-06-01 | Kantner | Applicant |
| US5778418(A) | 1998-07-01 | Auclair et al. | Applicant |
| US5781478(A) | 1998-07-01 | Takeuchi et al. | Applicant |
| US5787445(A) | 1998-07-01 | Daberko | Applicant |
| US5787484(A) | 1998-07-01 | Norman | Applicant |
| USRE35881(E) | 1998-08-01 | Barrett et al. | Applicant |
| US5799168(A) | 1998-08-01 | Ban | Applicant |
| US5802551(A) | 1998-09-01 | Komatsu et al. | Applicant |
| US5809515(A) | 1998-09-01 | Kaki et al. | Applicant |
| US5809558(A) | 1998-09-01 | Matthews et al. | Applicant |
| US5809560(A) | 1998-09-01 | Schneider | Applicant |
| US5818781(A) | 1998-10-01 | Estakhri et al. | Applicant |
| US5822245(A) | 1998-10-01 | Gupta et al. | Applicant |
| US5822252(A) | 1998-10-01 | Lee et al. | Applicant |
| US5822781(A) | 1998-10-01 | Wells et al. | Applicant |
| 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 |
| US5847552(A) | 1998-12-01 | Brown | Applicant |
| US5860083(A) | 1999-01-01 | Sukegawa | Applicant |
| US5860124(A) | 1999-01-01 | Matthews et al. | Applicant |
| US5862099(A) | 1999-01-01 | Gannage et al. | Applicant |
| US5890192(A) | 1999-03-01 | Lee et al. | Applicant |
| US5901086(A) | 1999-05-01 | Wang et al. | Applicant |
| US5907856(A) | 1999-05-01 | Estakhri et al. | Applicant |
| US5909586(A) | 1999-06-01 | Anderson | Applicant |
| US5920884(A) | 1999-07-01 | Jennings, III et al. | Applicant |
| US5928370(A) | 1999-07-01 | Asnaashari | Applicant |
| US5930815(A) | 1999-07-01 | Estakhri et al. | Applicant |
| US5933368(A) | 1999-08-01 | Ma et al. | Applicant |
| US5933846(A) | 1999-08-01 | Endo | Applicant |
| US5936971(A) | 1999-08-01 | Harari et al. | Applicant |
| US5937425(A) | 1999-08-01 | Ban | Applicant |
| US5953737(A) | 1999-09-01 | Estakhri et al. | Applicant |
| US5956473(A) | 1999-09-01 | Ma et al. | Applicant |
| US5959926(A) | 1999-09-01 | Jones et al. | Applicant |
| US5966727(A) | 1999-10-01 | Nishino | Applicant |
| US5986933(A) | 1999-11-01 | Takeuchi et al. | Applicant |
| US5987563(A) | 1999-11-01 | Itoh et al. | Applicant |
| US5987573(A) | 1999-11-01 | Hiraka | Applicant |
| US5991849(A) | 1999-11-01 | Yamada et al. | Applicant |
| US6011322(A) | 2000-01-01 | Stumfall et al. | Applicant |
| US6011323(A) | 2000-01-01 | Camp | Applicant |
| US6021408(A) | 2000-02-01 | Ledain et al. | Applicant |
| US6026020(A) | 2000-02-01 | Matsubara et al. | Applicant |
| US6026027(A) | 2000-02-01 | Terrell, II et al. | Applicant |
| US6034897(A) | 2000-03-01 | Estakhri et al. | Applicant |
| US6035357(A) | 2000-03-01 | Sakaki | Applicant |
| US6040997(A) | 2000-03-01 | Estakhri | Applicant |
| US6047352(A) | 2000-04-01 | Lakhani et al. | Applicant |
| US6055184(A) | 2000-04-01 | Acharya et al. | Applicant |
| US6055188(A) | 2000-04-01 | Takeuchi et al. | Applicant |
| US6061449(A) | 2000-05-01 | Candelore et al. | Examiner |
| US6072796(A) | 2000-06-01 | Christensen et al. | Applicant |
| US6081447(A) | 2000-06-01 | Lofgren et al. | Applicant |
| US6081878(A) | 2000-06-01 | Estakhri et al. | Applicant |
| US6097666(A) | 2000-08-01 | Sakui et al. | Applicant |
| US6115785(A) | 2000-09-01 | Estakhri et al. | Applicant |
| US6122195(A) | 2000-09-01 | Estakhri et al. | Applicant |
| US6125424(A) | 2000-09-01 | Komatsu et al. | Applicant |
| US6125435(A) | 2000-09-01 | Estakhri et al. | Applicant |
| US6128695(A) | 2000-10-01 | Estakhri et al. | Applicant |
| US6134145(A) | 2000-10-01 | Wong | Applicant |
| US6134151(A) | 2000-10-01 | Estakhri et al. | Applicant |
| US6141249(A) | 2000-10-01 | Estakhri et al. | Applicant |
| US6145051(A) | 2000-11-01 | Estakhri et al. | Applicant |
| US6151247(A) | 2000-11-01 | Estakhri et al. | Applicant |
| US6173362(B1) | 2001-01-01 | Yoda | Applicant |
| US6181118(B1) | 2001-01-01 | Meehan et al. | Applicant |
| US6182162(B1) | 2001-01-01 | Estakhri et al. | Applicant |
| US6202138(B1) | 2001-03-01 | Estakhri et al. | Applicant |
| US6223308(B1) | 2001-04-01 | Estakhri et al. | Applicant |
| US6226708(B1) | 2001-05-01 | McGoldrick et al. | Applicant |
| US6230234(B1) | 2001-05-01 | Estakhri et al. | Applicant |
| US6262918(B1) | 2001-07-01 | Estakhri et al. | Applicant |
| US6272610(B1) | 2001-08-01 | Katayama et al. | Applicant |
| US6279069(B1) | 2001-08-01 | Robinson et al. | Applicant |
| US6279114(B1) | 2001-08-01 | Toombs et al. | Applicant |
| US6374337(B1) | 2002-04-01 | Estakhri | Applicant |
| US6393513(B1) | 2002-05-01 | Estakhri et al. | Applicant |
| US6397314(B1) | 2002-05-01 | Estakhri et al. | Applicant |
| US6411546(B1) | 2002-06-01 | Estakhri et al. | Applicant |
| US6795917(B1) | 2004-09-01 | Ylonen | Examiner |
| US2003/0033471(A1) | 2003-02-01 | Lin et al. | Applicant |
| AU557723 | 1987-01-01 | Applicant | |
| EP220718(A2) | 1987-05-01 | Applicant | |
| EP243503(A1) | 1987-11-01 | Applicant | |
| EP392895(A2) | 1990-10-01 | Applicant | |
| EP424191(A2) | 1991-04-01 | Applicant | |
| EP489204(A1) | 1992-06-01 | Applicant | |
| EP522780(B1) | 1993-01-01 | Applicant | |
| EP522780(A2) | 1993-01-01 | Applicant | |
| EP544252(A2) | 1993-06-01 | Applicant | |
| EP613151(A2) | 1994-08-01 | Applicant | |
| EP617363(A2) | 1994-09-01 | Applicant | |
| EP619541(A2) | 1994-10-01 | Applicant | |
| EP663636(A1) | 1995-07-01 | Applicant | |
| EP686976(A2) | 1995-12-01 | Applicant | |
| FR9301908 | 1993-08-01 | Applicant | |
| GB2251323 | 1992-07-01 | Applicant | |
| GB2291990 | 1996-02-01 | Applicant | |
| GB2304428 | 1997-03-01 | Applicant | |
| GB2321728(A) | 1998-08-01 | Applicant | |
| JP3-228377 | 1981-10-01 | Applicant | |
| JP59-45695(A) | 1982-09-01 | Applicant | |
| JP58-215794(A) | 1983-12-01 | Applicant | |
| JP58-215795(A) | 1983-12-01 | Applicant | |
| JP59-92483 | 1984-05-01 | Applicant | |
| JP59-162695(A) | 1984-09-01 | Applicant | |
| JP60-212900 | 1985-10-01 | Applicant | |
| JP61-96598(A) | 1986-05-01 | Applicant | |
| JP62-283497(A) | 1987-02-01 | Applicant | |
| JP62-283496(A) | 1987-12-01 | Applicant | |
| JP63-183700(A) | 1988-07-01 | Applicant | |
| JP1-138694 | 1989-05-01 | Applicant | |
| JP4-57295 | 1992-02-01 | Applicant | |
| JP4-254994 | 1992-09-01 | Applicant | |
| JP4-268284 | 1992-09-01 | Applicant | |
| JP4-278297 | 1992-10-01 | Applicant | |
| JP4-332999(A) | 1992-11-01 | Applicant | |
| JP5-128877 | 1993-05-01 | Applicant | |
| JP5-282883 | 1993-10-01 | Applicant | |
| JP6-4399 | 1994-01-01 | Applicant | |
| JP6-36578 | 1994-02-01 | Applicant | |
| JP6-124175 | 1994-05-01 | Applicant | |
| JP6-124231 | 1994-05-01 | Applicant | |
| JP6-131889 | 1994-05-01 | Applicant | |
| JP6-132747 | 1994-05-01 | Applicant | |
| JP6-149395 | 1994-05-01 | Applicant | |
| JP6-266596 | 1994-09-01 | Applicant | |
| JP7-84871 | 1995-03-01 | Applicant | |
| JP7-93499 | 1995-04-01 | Applicant | |
| JP7-114499 | 1995-05-01 | Applicant | |
| JP7-141258 | 1995-06-01 | Applicant | |
| JP7-235193 | 1995-09-01 | Applicant | |
| JP7-311708 | 1995-11-01 | Applicant | |
| JP7-334996 | 1995-12-01 | Applicant | |
| JP8-18018 | 1996-01-01 | Applicant | |
| JPRM-37697 | 1996-02-01 | Applicant | |
| JP8-69696 | 1996-03-01 | Applicant | |
| JP9-147581 | 1997-06-01 | Applicant | |
| JP11045212 | 1999-02-01 | Applicant | |
| SU1388877(A1) | 1988-04-01 | Applicant | |
| SU1408439(A1) | 1988-07-01 | Applicant | |
| SU1515164(A1) | 1989-10-01 | Applicant | |
| SU1541619(A1) | 1990-02-01 | Applicant | |
| SU1573458(A2) | 1990-06-01 | Applicant | |
| SU1686449(A2) | 1991-10-01 | Applicant | |
| WO84/00628 | 1984-02-01 | Applicant | |
| WO94/20906 | 1994-09-01 | Applicant |
Non-Patent Literature (39)
- Mendel Rosenblum and John K Ousterhout, The Design and Implementation of a Log-Structured File System, article, 1991, 15 pgs., Berkeley, USA.Applicant
- Brian Dipert and Markus Levy, Designing with Flash Memory, book, Apr. 1994, 445 pgs., Annabooks, San Diego, USA.Applicant
- Science Forum, Inc., Flash Memory Symposium '95, symposium, 1995, 13 pgs.; Hongo, Bunkyo-ku, Tokyo.Applicant
- Ross S. Finlayson and David R. Cheriton, An Extended File Service Exploiting White-Once Storage, article, 1987, 10 pgs. ACM.Applicant
- Jason Gait, The Optical File Cabinet: A Random-Access File System for White-Once Optical Disks, article, Jun. 1988, 12 pgs., Beaverton, Oregon.Applicant
- Henry G. Baker, Memory Management, book, 1995, 19 pgs., Springer-Verlag Berlin Heidelberg, Germany.Applicant
- Sape J. Mullender and Andrew S. Tanenbaum, A Distributed File Service Based on Optimistic Concurrency Control, article, 1985, 12 pgs, ACM.Applicant
- Hiroshi Nakamura, Junichi Miyamoto, Kenichi Imamiya and Yoshihisa Iwata, A Novel Sense Amplifier for Flexible Voltage Operation NAND Flash Memories, symposium, 1995, VLSI Circuits Digest of Technical Papers, 2 pgs.Applicant
- Hiroshi Nakamura, Junichi Miyamoto, Kenichi Imamiya, Yoshihisa Iwata, Yoshihisa Sugiura and Hideko Oodaira, A Novel Sensing Scheme with On-Chip Page Copy for Flexible Voltage NAND Flash Memories, article, Jun. 1996, 9 pgs., vol. E79-C, No. 6.Applicant
- Takaaki Nozaki, Toshiaki Tanaka, Yoshiro Kijiya, Eita Kinoshita, Tatsuo Tsuchiya Tsuchiya and Yutaka Hayashi, A 1-Mb EEPROM with MONOS Memory Cell for Semiconductor Disk Application, article, 1991, 5 pgs., Journal Of Solid-State Circuits, vol., 26, No. 4.Applicant
- Kai Hwang and Faye A. Briggs, Computer Architecture and Parallel Processing, book, 1984, McGraw-Hill, Inc., 2 pgs., US.Applicant
- Walter Lahti and Dean McCarron, State of the Art: Magnetic VS. Optical Store Data in a Flash, article, 1990, 7 pgs., vol. 15, No. 12, McGraw-Hill, Inc, US.Applicant
- Ron Wilson, Integrated Circuits; 1-Mbit flash memories seek their role in system design, article, Mar. 1, 1989, 2 pgs., No. 6, Tulsa, OK.Applicant
- S. Mehroura, J.H. Yuan, R.A. Cemea, W.Y. Chien, D.C. Guteman, G. Samachisa, R.D. Noman, M. Mofidi, W.Lee, Y. Fong, A. Mihnea, E. Hann, R.W. Gregor, E.P. Eberhardt, J.R. Radosevich, K.R. Stiles, R.A. Kohler, C.W. Leung, and T.J. Mulrooney, Serial 9Mb F EEPROM for Solid State Disk Applications, symposium, 1992, 2 pgs., Mountain View, CA.Applicant
- Steven H. Leibson, Nonvolatile, In-circuit-reprogrammable memories, article, Jan. 3, 1991, 12 pgs., EDN, Circle No. 12.Applicant
- Walter Lahti and Dean McCarron, State of Art: Magnetic VS. Optical Store Data in a Flash, article, 1990, 7 pgs., vol. 15, No. 12, McGraw-Hill, Inc., US.Applicant
- Kai Hwang and Faye A. Briggs, Computer Architecture and Parallel Processing, book, 1984, McGraw-Hill, Inc., 2 pgs., US.Applicant
- Steven H. Leibson, Nonvolatile, in-circuit-reprogrammable memories, article, Jan. 3, 1991, 12 pgs., EDN, Circle No. 12.Applicant
- Ramon Caceres, Fred Douglis, Kai Li and Brian Marsh, Operating System Implications of Solid-State Mobile Computers, article, 7 pgs., Oct. 1993, Workshop on Workstation Operating Systems.Applicant
- Michael Wu and Wily Zwaenepoel, A Non-Volatile, Main Memory Storage System, 12 pgs., 1994, ACM, San Jose, CA USA.Applicant
- Dave Bursky, Innovative flash memories match DRAM densities: available with a choice of features, flash memories are finding homes in many systems (includes related articles on the origins of flash, and on the differences between NAND and NOR flash memories), article, May 16, 1994, 9 pgs., Electronic Design, v. 42, n. 10, The Gale Group.Applicant
- Anthony Cataldo, New flash enhancements up ante. (Intel's 28F400BV-120 and 28F004BV-120, Almel's AT29BV010 and AT29BV020, and Samsung Semiconductor's KM29V32000 “flash memory ”devices)(Product Announcement), article, Mar. 13, 1995, 4 pgs., Electronic News, v.41, n.2058, The Gale Group.Applicant
- Sam Weber, “Flash” modules' portability, reusability, small size valued for a host of APP9-Consumer formals flocking to “flash”, article, Jul. 22, 1996, 9 pgs., Electronic Engineering Times, n.911, CMP Media.Applicant
- Toshiba, MOS Memory (Non-Volatile), 1995, Data Book.Applicant
- Stan Baker, But Integration Calls For Hardware, Software Changes: Flash: designers face the down of a new memory age, article, Sep. 12, 2003, 5 pgs., Electronic Engineer Times, 1990, N.619, 41, CMP Media.Applicant
- Toshiba, Toshiba MOS Digital Integrated Circuit Silicon Gate CMOS, (TC58NS512DC) Mar. 21, 2001, 43 pgs., Data Book.Applicant
- Toshiba Corporation, SMIL (Smartmedia Interface Library) Hardware Edition Version 1.00, Jul. 1, 2000, 36 pgs, Data Book.Applicant
- Toshiba, Toshiba MOS Digital Integrated Circuit Silicon Gate, (TC58512FT), Mar. 5, 2001, 43 pgs., Data Book.Applicant
- Toshiba, Toshiba MOS Digital Integrated Circuit Silicon Gate, (TC58DVM92A1FT00), Jan. 10, 2003, 44 pgs., Data Book.Applicant
- Toshiba, Toshiba MOS Digital Integrated Circuit Silicon Gate, (TC58DVG02A1FT00), Jan. 10, 2003, 44 pgs., Data Book.Applicant
- Toshiba, Toshiba MOS Digital Integrated Circuit Silicon Gate, (TH58100FT), Mar. 5, 2001, 43 pgs., Data Book.Applicant
- 35Nonvolatile Memory Technology Review, A Time of Change, Proceedings 1993 Conference, Jun. 22-24, 1993, Linthicum Heights, MD USA.Applicant
- Toshiba Corporation, SMIL (Smartmedia Interface Library) Software Edition Version 1.00, Jul. 1, 2000, 136 pgs., Data Book.Applicant
- Toshiba, MOS Memory (Non-Volatile), 1996, 279 pgs., Data Book.Applicant
- Dan Auclair, Optimal Solid State Disk Architecture For Portable Computers, symposium, Jul. 9, 1991, 7 pgs., SunDisk Corporation.Applicant
- 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 Cirrcuits, “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, CA. R.W. Gregor et al., AT&T Bell Laboratories. Allentown, PA. pp. 24 and 25.Applicant