US5033048A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Memory selftest method and apparatus same
Assignee: Hewlett Packard Development Co LP
•
Filing: 1990-04-19
•
Granted: 1991-07-16
•
Expires: 2010-04-19
Abstract
Abstract A method and apparatus for testing each memory location of a memory device, the method comprising the steps of: generating each of the memory addresses corresponding to each memory location in a pseudo-random order; generating a pseudo-random series of data words; storing one of the data words at each memory location; reading each data word back from memory; regenerating the series of data words; and comparing each read data word to the corresponding regenerated data word. The invention features generating and storing a second series of data words, each data word being inverse of the data words in the first series. The second series of data words are read from memory and compared to regenerated data. The invention also features a novel linear feedback shift register for generating the pseudo-random memory addresses and can generate the address zero. An accumulating register is utilized to store the approximate location of malfunctioning memory locations.
Inventors
- 👤 Donald C. Pierce
- 👤 Edward H. Utzig
- 👤 Robert N. Crouse
- 👤 Noreen Hession
- 👤 Donald W. Smelser
- 👤 Hansel A. Collins
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 16:30
CPC Classifications
G; G11; G11C; G11C29/00; G11C29/04; G11C29/08; G11C29/12; G11C29/44; G11C29/18; G11C29/20; G11C29/36
Claims Analysis
Total Claims: 32
Claim 1
Independent Claim
172 words
A method for testing a memory device, said memory device comprising a plurality of memory locations each having a corresponding memory address, said method comprising the steps of: (a) generating each of said memory addresses using a linear feedback shift register, including an address of zero; (b) generating a predetermined series of data words; (c) storing one of said data words at each memory location corresponding to the memory addresses generated in step (a); (d) reading each data word stored in step (c); (e) regenerating said predetermined series of data words generated in step (b); (f) comparing each data word read in step (d) with a corresponding data word regenerated in step (e); (g) generating an error signal for each comparison performed in step (f) if the compared data words are not equivalent; and (h) utilizing said error signals generated in step (g) to store a portion of the memory address of each data word read in step (d) that is not equivalent to the corresponding data word generated in step (e).
Claim 2
Independent Claim
172 words
A method for testing a memory device, said memory device comprising a plurality of memory locations each having a corresponding memory address, said method comprising the steps of: (a) generating each of said memory addresses using a linear feedback shift register, including an address of zero; (b) generating a predetermined series of data words; (c) storing one of said data words at each memory location corresponding to the memory addresses generated in step (a); (d) reading each data word stored in step (c); (e) regenerating said predetermined series of data words generated in step (b); (f) comparing each data word read in step (d) with a corresponding data word regenerated in step (e); (g) generating an error signal for each comparison performed in step (f) if the compared data words are not equivalent; and (h) utilizing said error signals generated in step (g) to store a portion of the memory address of each data word read in step (d) that is not equivalent to the corresponding data word generated in step (e).
Claim 3
Dependent Claim
15 words
The method of claim 1 wherein said memory addresses are generated in a pseudo-random order.
Claim 4
Dependent Claim
16 words
The method of claim 1 wherein said predetermined series of data words is a pseudo-random series.
Claim 5
Dependent Claim
28 words
The method of claim 1 wherein step (a) comprises pseudo-randomly generating the addresses of blocks of memory, each of said blocks comprising a plurality of sequential memory addresses.
Claim 6
Dependent Claim
25 words
The method of claim 1 wherein said portion of the memory address of each data word is the upper five bits of said memory address.
Claim 7
Independent Claim
177 words
A method for testing a memory device, said memory device comprising a plurality of memory locations each having a corresponding memory address, said method comprising the steps of: (a) generating each of said memory addresses in a predetermined order; (b) generating a predetermined series of data words; (c) storing one of said data words at each memory location corresponding to the memory addresses generated in step (a); (d) reading each data word stored in step (c); (e) regenerating said predetermined series of data words generated in step (b); (f) comparing each data word read in step (d) with a corresponding data word regenerated in step (e); (g) generating an error signal for each comparison performed in step (f) if the compared data words are not equivalent; and (h) utilizing said error signals generated in step (g) to store a portion of the memory address of each data word read in step (d) that is not equivalent to the corresponding data word generated in step (e), said portion being stored as a single bit in an accumulating register.
Claim 8
Independent Claim
177 words
A method for testing a memory device, said memory device comprising a plurality of memory locations each having a corresponding memory address, said method comprising the steps of: (a) generating each of said memory addresses in a predetermined order; (b) generating a predetermined series of data words; (c) storing one of said data words at each memory location corresponding to the memory addresses generated in step (a); (d) reading each data word stored in step (c); (e) regenerating said predetermined series of data words generated in step (b); (f) comparing each data word read in step (d) with a corresponding data word regenerated in step (e); (g) generating an error signal for each comparison performed in step (f) if the compared data words are not equivalent; and (h) utilizing said error signals generated in step (g) to store a portion of the memory address of each data word read in step (d) that is not equivalent to the corresponding data word generated in step (e), said portion being stored as a single bit in an accumulating register.
Claim 9
Independent Claim
245 words
A method for testing a memory device, said memory device comprising a plurality of memory locations each having a corresponding memory address, said method comprising the steps of: (a) generating each of said memory addresses in a predetermined order; (b) generating a predetermined series of data words; (c) storing one of said data words at each of said memory locations; (d) regenerating said predetermined series of data words; (e) reading each data word stored in step (c); (f) comparing each data word regenerated in step (d) with a corresponding data word read in step (e) and, for each comparison: (i) if the compared data words are equivalent, inverting one of the data words and storing the inverted data word in the memory location in which said read data word was located; or (ii) if the compared data words are not equivalent, storing one of said compared data words in the memory location in which said read data word was located and generating an error status signal; (g) reading each data word stored in memory in step (f); (h) generating a second series of data words each of which is the inverse to the corresponding data word in said predetermined series of data words; (i) comparing each data word read from memory in step (g) with the corresponding data word generated in step (h); and (j) generating an error status signal for each comparison performed in step (i) if the compared data words are not equivalent.
Claim 10
Independent Claim
245 words
A method for testing a memory device, said memory device comprising a plurality of memory locations each having a corresponding memory address, said method comprising the steps of: (a) generating each of said memory addresses in a predetermined order; (b) generating a predetermined series of data words; (c) storing one of said data words at each of said memory locations; (d) regenerating said predetermined series of data words; (e) reading each data word stored in step (c); (f) comparing each data word regenerated in step (d) with a corresponding data word read in step (e) and, for each comparison: (i) if the compared data words are equivalent, inverting one of the data words and storing the inverted data word in the memory location in which said read data word was located; or (ii) if the compared data words are not equivalent, storing one of said compared data words in the memory location in which said read data word was located and generating an error status signal; (g) reading each data word stored in memory in step (f); (h) generating a second series of data words each of which is the inverse to the corresponding data word in said predetermined series of data words; (i) comparing each data word read from memory in step (g) with the corresponding data word generated in step (h); and (j) generating an error status signal for each comparison performed in step (i) if the compared data words are not equivalent.
Claim 11
Dependent Claim
44 words
The method of claim 7 further comprising the step of storing, for each comparison performed in step (i), a first predetermined pattern in the memory location in which said data word read in step (g) was located, if said compared data words are equivalent.
Claim 12
Dependent Claim
45 words
The method of claim 8 further comprising the step of storing, for each comparison performed in step (i), a second predetermined pattern in the memory location in which said data word read in step (g) was located, if said compared data words are not equivalent.
Claim 13
Dependent Claim
11 words
The method of claim 7 wherein said predetermined order is pseudo-random.
Claim 14
Dependent Claim
17 words
The method of claim 10 wherein said memory addresses are generated by a linear feedback shift register.
Claim 15
Dependent Claim
16 words
The method of claim 11 wherein said linear feedback shift register generates an address of zero.
Claim 16
Dependent Claim
16 words
The method of claim 7 wherein said predetermined series of data words is a pseudo-random series.
Claim 17
Dependent Claim
28 words
The method of claim 7 wherein step (a) comprises pseudo-randomly generating the addresses of blocks of memory, each of said blocks comprising a plurality of sequential memory addresses.
Claim 18
Dependent Claim
54 words
The method of claim 7 further comprising the step of: (k) utilizing the error status signals generated in steps (f) and (j) to store a portion of the memory address of each data word read in steps (e) and (g) that is not equivalent to the data word compared in steps (f) or (i).
Claim 19
Dependent Claim
26 words
The method of claim 15 wherein said portion of the memory address of each data word is stored as a single bit in an accumulating register.
Claim 20
Dependent Claim
25 words
The method of claim 16 wherein said portion of the memory address of each data word is the upper five bits of said memory address.
Claim 21
Dependent Claim
22 words
The method of claim 7 wherein said one of said compared data words stored in step (f) is said regenerated data word.
Claim 22
Dependent Claim
154 words
A linear feedback shift register for generating a pseudo-random series of digital numbers, said linear feedback shift register comprising: a plurality of stages, each stage storing either a zero or a one and each stage having an output determined by its stored digital value; a feedback path connecting one or more of said outputs to an input of one of said stages; a decoder for receiving a plurality of said outputs of said stages and determining when each of said received outputs has a first predetermined value or a second predetermined value; zero generating means for generating a zero in each of said plurality of stages in response to said decoder detecting the existence of said first predetermined value such that each of said outputs is a zero; and means for generating a one in at least one of said stages in response to said decoder detecting the existence of said second predetermined value.
Claim 23
Dependent Claim
154 words
A linear feedback shift register for generating a pseudo-random series of digital numbers, said linear feedback shift register comprising: a plurality of stages, each stage storing either a zero or a one and each stage having an output determined by its stored digital value; a feedback path connecting one or more of said outputs to an input of one of said stages; a decoder for receiving a plurality of said outputs of said stages and determining when each of said received outputs has a first predetermined value or a second predetermined value; zero generating means for generating a zero in each of said plurality of stages in response to said decoder detecting the existence of said first predetermined value such that each of said outputs is a zero; and means for generating a one in at least one of said stages in response to said decoder detecting the existence of said second predetermined value.
Claim 24
Dependent Claim
15 words
The linear feedback shift register of claim 19 wherein said second predetermined value is zero.
Claim 25
Dependent Claim
129 words
A linear feedback shift register for generating a pseudo-random series of digital numbers, said linear feedback shift register comprising: a plurality of stages, each stage storing either a zero or a one and each stage having an output determined by its stored digital value; first and second feedback paths and connection means for connecting either said first feedback path or said second feedback path to one of said stages, a decoder for receiving a plurality of said outputs of said stages and determining when each of said received outputs has a predetermined value; and zero generating means for generating a zero in each of said plurality of stages in response to said decoder detecting the existence of said predetermined value such that each of said outputs is a zero.
Claim 26
Dependent Claim
129 words
A linear feedback shift register for generating a pseudo-random series of digital numbers, said linear feedback shift register comprising: a plurality of stages, each stage storing either a zero or a one and each stage having an output determined by its stored digital value; first and second feedback paths and connection means for connecting either said first feedback path or said second feedback path to one of said stages, a decoder for receiving a plurality of said outputs of said stages and determining when each of said received outputs has a predetermined value; and zero generating means for generating a zero in each of said plurality of stages in response to said decoder detecting the existence of said predetermined value such that each of said outputs is a zero.
Claim 27
Dependent Claim
23 words
The linear feedback shift register of claim 21 wherein said predetermined value is the last number in said predetermined pseudo-random series of numbers.
Claim 28
Dependent Claim
120 words
In a computer storage system having a memory device comprising a plurality of sections, each of said sections comprising a plurality of memory storage locations, a device for indicating which of said sections of memory has a malfunctioning memory storage location, said device comprising: testing means for testing each of said memory storage locations to determine which of said memory storage locations are malfunctioning, a decoder for receiving the memory address of each memory storage location determined to be malfunctioning by said testing means and, for each received address, outputting a signal indicating which of said plurality of sections contains the memory storage location corresponding to said received address; and a storage device for storing the outputs of said decoder.
Claim 29
Dependent Claim
120 words
In a computer storage system having a memory device comprising a plurality of sections, each of said sections comprising a plurality of memory storage locations, a device for indicating which of said sections of memory has a malfunctioning memory storage location, said device comprising: testing means for testing each of said memory storage locations to determine which of said memory storage locations are malfunctioning, a decoder for receiving the memory address of each memory storage location determined to be malfunctioning by said testing means and, for each received address, outputting a signal indicating which of said plurality of sections contains the memory storage location corresponding to said received address; and a storage device for storing the outputs of said decoder.
Claim 30
Dependent Claim
15 words
The computer storage system of claim 23 wherein said storage device comprises an accumulating register.
Claim 31
Dependent Claim
38 words
The computer storage device of claim 24 wherein said accumulating register has one bit corresponding to each of said sections, the value of each of said bits indicating whether said corresponding section contains a malfunctioning memory storage location.
Claim 32
Dependent Claim
21 words
The computer storage device of claim 23 wherein said decoder selects the upper five bits of each of said received addresses.
References Cited (Backward Citations)
US4293950A
Cited
US4369511A
Cited
US4713605A
Cited
US4715034A
Cited
US4672610A
Cited
US4780627A
Cited
US4782487A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-07-15 | 1995-01-14 | 1995-07-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-07-15 | 1999-01-14 | 1999-07-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-07-15 | 2003-01-14 | 2003-07-16 | $7700.00 | Window Closed / Lapsed |