Patent US5263003A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5263003A Expired / Lapsed US ⏱️ 0.0 years remaining

Flash memory circuit and method of operation

Assignee: Allen Bradley Co LLC
•
Filing: 1991-11-12
•
Granted: 1993-11-16
•
Expires: 2011-11-12
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A memory circuit for storing words of data has two memory banks each formed by a plurality of memory devices connected in parallel. In a first mode, the memory circuit responds to an initial request for access and an address signal by reading data from a storage location in one of the memory banks. Subsequent requests for access to contiguous storage locations do not require an address signal, instead a control mechanism responds by generating an address to read data alternately from storage locations in the first and second memory banks. In a second mode, the memory circuit responds to every request for access to the memory circuit by enabling access to the first or second memory bank as indicated by an address which accompanied the request. The memory devices of a given bank are erased and programmed in parallel. However, when a given storage location is found to contain one or more bits that were not erased, another erase command is sent to only those memory devices associated with a bit that was not erased. Similarly, when a word of data has not been stored properly, only those memory devices which failed to store a bit are placed into the write state for another programming attempt.

Inventors

  • 👤 Kenneth R. Cowles
  • 👤 Mark J. Duewiger
  • 👤 Alex D. Green

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-25 08:07
CPC Classifications
G; G11; G11C; G11C7/00; G11C7/10; G11C7/1015; G11C7/1018; G11C7/1027; G11C16/00; G11C16/02; G11C16/06; G11C16/08; G11C16/26; G11C7/1045

Claims Analysis

Total Claims: 23
Claim 1
Independent Claim 210 words
A memory circuit for storing words of digital data comprising: a first means for receiving a storage location address; a second means for receiving control signals requesting access to the memory circuit; a means for exchanging data with an external device; first and second memory banks each having a series of storage locations and being coupled to said means for exchanging data; an address bus connected to said first and second memory banks; means for controlling said first and second memory banks, having a first mode in which this latter means responds to an address and a request for access received respectively from said first and second means for receiving by reading data from a storage location in one of said memory banks, and thereafter generating addresses on said address bus to read data alternately from storage locations in said first and second memory banks in response to subsequent requests for access to the memory circuit, and having a second mode in which said means for controlling responds to an address and a request for access to the memory circuit by enabling only one of said first and second memory banks and thereafter generating addresses on said address bus to read information sequentially from storage locations in the one bank.
Claim 2
Dependent Claim 210 words
A memory circuit for storing words of digital data comprising: a first means for receiving a storage location address; a second means for receiving control signals requesting access to the memory circuit; a means for exchanging data with an external device; first and second memory banks each having a series of storage locations and being coupled to said means for exchanging data; an address bus connected to said first and second memory banks; means for controlling said first and second memory banks, having a first mode in which this latter means responds to an address and a request for access received respectively from said first and second means for receiving by reading data from a storage location in one of said memory banks, and thereafter generating addresses on said address bus to read data alternately from storage locations in said first and second memory banks in response to subsequent requests for access to the memory circuit, and having a second mode in which said means for controlling responds to an address and a request for access to the memory circuit by enabling only one of said first and second memory banks and thereafter generating addresses on said address bus to read information sequentially from storage locations in the one bank.
Claim 3
Dependent Claim 46 words
The memory circuit as recited in claim 1 wherein each one of said first and second memory banks is formed by a plurality of integrated circuit memory devices connected in parallel with each device storing a different group of bits of a word of digital data.
Claim 4
Dependent Claim 84 words
The memory circuit as recited in claim 1 wherein: said means for exchanging data comprises first and second data buffers connected respectively to said first and second memory banks with each data buffer being enabled by a separate control signal from said means for controlling; and said means for controlling in the first mode responds to a request for access by simultaneously enabling both memory banks for the reading of data stored therein, but enables only one of said first and second data buffers.
Claim 5
Dependent Claim 240 words
A memory circuit for storing multiple bit words of digital data comprising: a first means for receiving control signals requesting access to the memory circuit; first and second memory banks each having a series of storage locations; an address but connected to said first and second memory banks; a second means for receiving a storage location address consisting of a plurality of binary bits and providing a first address value and a second address value that is substantially equal to one-half the first address value; an address generator coupled to said second means for receiving, and producing a sequence of output addresses in response to the second address value which indicates an initial output address of the sequence and applying the output addresses to said address bus when enabled by a control signal received by said memory circuit, otherwise said address generator applies the first address value to said address bus; and a means for controlling said address generator and said first and second memory banks, and in a first mode said means for controlling is responsive to each request in a series of requests for access to the memory circuit by reading stored data alternately from the first and second memory banks, and having a second mode in which said means for controlling responds each request in a series of requests for access to the memory circuit by enabling a same one of said first and second memory banks.
Claim 6
Dependent Claim 240 words
A memory circuit for storing multiple bit words of digital data comprising: a first means for receiving control signals requesting access to the memory circuit; first and second memory banks each having a series of storage locations; an address but connected to said first and second memory banks; a second means for receiving a storage location address consisting of a plurality of binary bits and providing a first address value and a second address value that is substantially equal to one-half the first address value; an address generator coupled to said second means for receiving, and producing a sequence of output addresses in response to the second address value which indicates an initial output address of the sequence and applying the output addresses to said address bus when enabled by a control signal received by said memory circuit, otherwise said address generator applies the first address value to said address bus; and a means for controlling said address generator and said first and second memory banks, and in a first mode said means for controlling is responsive to each request in a series of requests for access to the memory circuit by reading stored data alternately from the first and second memory banks, and having a second mode in which said means for controlling responds each request in a series of requests for access to the memory circuit by enabling a same one of said first and second memory banks.
Claim 7
Dependent Claim 45 words
The memory circuit as recited in claim 4 wherein each of said first and second memory banks is formed by a plurality of integrated circuit memory devices connected in parallel with each device storing a different group of bits of a word of digital data.
Claim 8
Dependent Claim 61 words
The memory circuit as recited in claim 5 wherein said second means for receiving divides the storage location address by an amount of the integrated circuit memory devices in each memory bank to provide the first address value and divides the storage location address by twice the number of the devices in each memory bank to provide the second address value.
Claim 9
Dependent Claim 49 words
The memory circuit as recited in claim 4 further comprising: an input/output data bus; and first and second data buffers respectively coupling the first and second memory banks to said input/output data bus when each data buffer is enabled by a separate control signal from said means for controlling.
Claim 10
Dependent Claim 51 words
The memory circuit as recited in claim 7 wherein said means for controlling in the first mode responds to a request for access by simultaneously enabling both said first and second memory banks for the reading of data stored therein, but enables only one of said first and second data buffers.
Claim 11
Independent Claim 141 words
A method of erasing a memory circuit that includes a first bank of a plurality of memory devices coupled in parallel to form a set of storage locations, each memory device being responsive to an erase command by erasing a plurality of data storage areas in the device; steps of said method comprising: (a) issuing the erase command to every memory device in the first bank; (b) then sequentially reading the contents of each storage location and determining whether every bit of the storage location has been erased; and (c) when a given storage location is found to contain a bit that was not erased, sending another erase command to only those memory devices associated with the bit that was not erased, and then reading the contents of the given storage location to determine whether every bit now has been erased.
Claim 12
Independent Claim 141 words
A method of erasing a memory circuit that includes a first bank of a plurality of memory devices coupled in parallel to form a set of storage locations, each memory device being responsive to an erase command by erasing a plurality of data storage areas in the device; steps of said method comprising: (a) issuing the erase command to every memory device in the first bank; (b) then sequentially reading the contents of each storage location and determining whether every bit of the storage location has been erased; and (c) when a given storage location is found to contain a bit that was not erased, sending another erase command to only those memory devices associated with the bit that was not erased, and then reading the contents of the given storage location to determine whether every bit now has been erased.
Claim 13
Dependent Claim 30 words
The method as recited in claim 9 in which the step of sequentially reading the contents of each storage location simultaneously reads data from every memory device of the bank.
Claim 14
Dependent Claim 141 words
The method as recited in claim 9 the steps of which further comprises after determining that all of the storage locations have been erased: (d) simultaneously placing all the memory devices into a write state for the storage of data; (e) sending an address of a specific storage location and a word of data to the memory devices; (f) reading the contents of the given storage location; (g) comparing the contents read from the specific storage location to the word of data sent to determine whether the word of data has been stored properly; and (h) when the comparing step indicates that the word of data has not been stored properly, placing into the write state only those memory devices which did not properly store bits of the data word, and sending the word of data again to the memory circuit.
Claim 15
Dependent Claim 27 words
The method as recited in claim 11 in which the step of reading the contents of the specific storage location simultaneously reads data from every memory device.
Claim 16
Dependent Claim 26 words
The method as recited in claim 11 further comprising following step (h) returning to step (f) to verify whether the data now has been stored properly.
Claim 17
Dependent Claim 37 words
The method as recited in claim 11 further comprising after step (g) determines that the word of data has been stored properly returning to step (d) to store another word of data in a different storage location.
Claim 18
Dependent Claim 98 words
The method as recited in claim 11 in which the memory circuit further includes a second bank of a plurality of memory devices coupled in parallel to form a set of storage locations, each memory device being responsive to an erase command by erasing a plurality of data storage areas in the device; and wherein separate copies of a program which controls the erasing and storing of data in the memory circuit is stored in each bank and while erasing or storing operations are being performed on one bank the program is being read from the other bank.
Claim 19
Independent Claim 149 words
A method of reprogramming a memory circuit that includes a bank of a plurality of memory devices coupled in parallel to form a set of storage locations, steps of said method comprising: (a) simultaneously placing all the memory devices in a write state for the storage of data; (b) sending an address of a given storage location and a word of data to the memory devices; (c) reading the contents of the given storage location; (d) comparing the contents read from the given storage location to the word of data sent to determine whether the word of data has been stored properly; and (e) when the comparing step indicates that the word of data has not been stored properly, placing in the write state only those memory devices which did not properly store portions of the data word and sending the word of data again to the memory circuit.
Claim 20
Independent Claim 149 words
A method of reprogramming a memory circuit that includes a bank of a plurality of memory devices coupled in parallel to form a set of storage locations, steps of said method comprising: (a) simultaneously placing all the memory devices in a write state for the storage of data; (b) sending an address of a given storage location and a word of data to the memory devices; (c) reading the contents of the given storage location; (d) comparing the contents read from the given storage location to the word of data sent to determine whether the word of data has been stored properly; and (e) when the comparing step indicates that the word of data has not been stored properly, placing in the write state only those memory devices which did not properly store portions of the data word and sending the word of data again to the memory circuit.
Claim 21
Dependent Claim 26 words
The method as recited in claim 16 further comprising following step (e) returning to step (c) to verify whether the data now has been stored properly.
Claim 22
Dependent Claim 37 words
The method as recited in claim 16 further comprising after step (d) determines that the word of data has been stored properly returning to step (a) to store another word of data in a different storage location.
Claim 23
Dependent Claim 27 words
The method as recited in claim 16 in which the step of reading the contents of the given storage location simultaneously reads data from every memory device.

References Cited (Backward Citations)

US4413319A Cited
US4566082A Cited
US4691303A Cited
US4881206A Cited
US4899310A Cited
US5060145A Cited
US5012408A Cited
US5036493A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1996-11-15 1997-05-17 1997-11-16 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2000-11-15 2001-05-17 2001-11-16 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2004-11-15 2005-05-17 2005-11-16 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag