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

Checkboard memory self-test

Assignee: International Business Machines Corp
•
Filing: 1989-10-06
•
Granted: 1992-03-31
•
Expires: 2009-10-06
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The invention is a system and method for high-efficiency checkerboard memory self-test. A random pattern generator configuration includes a linear feedback shift register and a multiple input signature register. The random pattern generator is used to step through the memory addresses in generating the checkerboard pattern. The two least significant address lines connecting the random pattern generator and the memory array are connected together via an exclusive OR gate. Because these address lines indicate the parity of the current and next memory addresses to be generated in the random pattern generator, the output of the exclusive OR gate indicates whether the next memory address to be generated is of the same or different type of state compared to the current memory address. The output of the exclusive OR gate can thus be connected to the data input shift register of the memory array to permit conditional shifting of the checkerboard data pattern into the memory array. One logic state is input to the current memory address when the output of the exclusive OR gate is a logical one and the other logical state is input to the current memory address when the output of the exclusive OR gate is a logical zero.

Inventors

  • 👤 George E. Hack

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-24 03:04
CPC Classifications
G; G11; G11C; G11C29/00; G11C29/04; G11C29/08; G11C29/12; G11C29/18; G11C29/20; G01; G01R; G01R31/00; G01R31/28; G01R31/317; G01R31/3181; G01R31/31813; G01R31/3183; G01R31/318385

Claims Analysis

Total Claims: 13
Claim 1
Independent Claim 282 words
A method for a checkerboard self-test of memory circuits having a random pattern generator connected to address lines and data input lines thereof, the random pattern generator including means for stepping through each memory address, including a current memory address and a next memory address having a parity, during a random pattern generator cycle, the address lines including a least significant address line and a next least significant address line each having a binary state, the memory circuits having a multiple input signature register connected to output lines thereof, comprising the steps of: providing the random pattern generator with known seed data; continuously monitoring the parity of the current memory address and the next memory address to appear in the random pattern generator by using the binary state of the least significant and the next least significant address lines of the random pattern generator; writing checkerboard data into the memory circuits during a first random pattern generator cycle; outputting the checkerboard data from the memory circuits to the multiple input signature register during a second random pattern generator cycle; writing checkerboard data into the memory circuits during a third random pattern generator cycle, the data written during the third random pattern generator cycle being a complement of the data written during the first random pattern generator cycle; outputting the checkerboard data from the memory circuits to the multiple input signature register during a fourth random pattern generator cycle, thereby generating a data signature in the multiple input signature register; and comparing the data signature in the multiple input signature register with that which would be generated by the memory circuits if such are operating properly and provided with the same seed data.
Claim 2
Independent Claim 282 words
A method for a checkerboard self-test of memory circuits having a random pattern generator connected to address lines and data input lines thereof, the random pattern generator including means for stepping through each memory address, including a current memory address and a next memory address having a parity, during a random pattern generator cycle, the address lines including a least significant address line and a next least significant address line each having a binary state, the memory circuits having a multiple input signature register connected to output lines thereof, comprising the steps of: providing the random pattern generator with known seed data; continuously monitoring the parity of the current memory address and the next memory address to appear in the random pattern generator by using the binary state of the least significant and the next least significant address lines of the random pattern generator; writing checkerboard data into the memory circuits during a first random pattern generator cycle; outputting the checkerboard data from the memory circuits to the multiple input signature register during a second random pattern generator cycle; writing checkerboard data into the memory circuits during a third random pattern generator cycle, the data written during the third random pattern generator cycle being a complement of the data written during the first random pattern generator cycle; outputting the checkerboard data from the memory circuits to the multiple input signature register during a fourth random pattern generator cycle, thereby generating a data signature in the multiple input signature register; and comparing the data signature in the multiple input signature register with that which would be generated by the memory circuits if such are operating properly and provided with the same seed data.
Claim 3
Dependent Claim 45 words
The method of claim 1 wherein said step of continuously monitoring the parity of the current memory address and the next memory address includes comparing the binary state of the least significant address line with the binary state of the next least significant address line.
Claim 4
Dependent Claim 97 words
The method of claim 1 wherein said steps of writing checkerboard data into the memory circuits during the first and third random pattern generator cycles includes writing a first binary state at each memory address determined to be of the first binary state during the step of continuously monitoring the parity of the current memory address and the next memory address, and writing a second binary state at each memory address determined to be of the second binary state during the step of continuously monitoring the parity of the current memory address and the next memory address.
Claim 5
Dependent Claim 44 words
The method of claim 3 wherein said step of continuously monitoring the parity of the current memory and the next memory address includes comparing the binary state of the least significant address line with the binary state of the next least significant address line.
Claim 6
Independent Claim 382 words
A method for a self-test of memory circuits having a random pattern generator connected to address lines and data input lines thereof, the random pattern generator including means for stepping through each memory address, including a current memory address and a next memory address having a parity, during a random pattern generator cycle, the address lines including a least significant address line and a next least significant address line each having a binary state, the memory circuits having a multiple input signature register connected to output lines thereof, comprising the steps of: providing the random pattern generator with known seed data; writing random data into the memory circuits during a first random pattern generator cycle; outputting data from the memory circuits to the multiple input signature register during a second random pattern generator cycle; writing random data into the memory circuits during a third random pattern generator cycle, the data written during the third random pattern generator cycle being a complement of the data written during the first random pattern generator cycle; outputting the random data from the memory circuits to the multiple input signature register during a fourth random pattern generator cycle; writing checkerboard data into the memory circuits during a fifth random pattern generator cycle; outputting the checkerboard data from the memory circuits to the multiple input signature register during a sixth random pattern generator cycle; writing checkerboard data into the memory circuits during a seventh random pattern generator cycle, the data written during the seventh random pattern generator cycle being a complement of the data written during the fifth random pattern generator cycle; outputting the checkerboard data from the memory circuits to the multiple input signature register during an eighth random pattern generator cycle, thereby generating a data signature in the multiple input signature register; continuously monitoring the parity of the current memory address and the next memory address to appear in the random pattern generator during the fifth and seventh random pattern generator cycles by using the binary state of the least significant and the next least significant address lines of the random pattern generator; and comparing the data signature in the multiple input signature register with that which would be generated by the memory circuits if such are operating properly and provided with the same seed data.
Claim 7
Independent Claim 382 words
A method for a self-test of memory circuits having a random pattern generator connected to address lines and data input lines thereof, the random pattern generator including means for stepping through each memory address, including a current memory address and a next memory address having a parity, during a random pattern generator cycle, the address lines including a least significant address line and a next least significant address line each having a binary state, the memory circuits having a multiple input signature register connected to output lines thereof, comprising the steps of: providing the random pattern generator with known seed data; writing random data into the memory circuits during a first random pattern generator cycle; outputting data from the memory circuits to the multiple input signature register during a second random pattern generator cycle; writing random data into the memory circuits during a third random pattern generator cycle, the data written during the third random pattern generator cycle being a complement of the data written during the first random pattern generator cycle; outputting the random data from the memory circuits to the multiple input signature register during a fourth random pattern generator cycle; writing checkerboard data into the memory circuits during a fifth random pattern generator cycle; outputting the checkerboard data from the memory circuits to the multiple input signature register during a sixth random pattern generator cycle; writing checkerboard data into the memory circuits during a seventh random pattern generator cycle, the data written during the seventh random pattern generator cycle being a complement of the data written during the fifth random pattern generator cycle; outputting the checkerboard data from the memory circuits to the multiple input signature register during an eighth random pattern generator cycle, thereby generating a data signature in the multiple input signature register; continuously monitoring the parity of the current memory address and the next memory address to appear in the random pattern generator during the fifth and seventh random pattern generator cycles by using the binary state of the least significant and the next least significant address lines of the random pattern generator; and comparing the data signature in the multiple input signature register with that which would be generated by the memory circuits if such are operating properly and provided with the same seed data.
Claim 8
Independent Claim 129 words
A system for checkerboard memory self-test comprising: a memory array having address lines, input lines, and output lines, the address lines including a least significant address line and a next least significant address line each having a binary state; a multiple input signature register connected to the output lines of the memory array; a random pattern generator connected to the address lines and input lines of the memory array, the random pattern generator capable of stepping through each memory address, including a current memory address and a next memory address having a parity; and means connected to the address lines and the input lines of the memory array for monitoring the parity of the current memory address and the next memory address to appear in the random pattern generator.
Claim 9
Independent Claim 129 words
A system for checkerboard memory self-test comprising: a memory array having address lines, input lines, and output lines, the address lines including a least significant address line and a next least significant address line each having a binary state; a multiple input signature register connected to the output lines of the memory array; a random pattern generator connected to the address lines and input lines of the memory array, the random pattern generator capable of stepping through each memory address, including a current memory address and a next memory address having a parity; and means connected to the address lines and the input lines of the memory array for monitoring the parity of the current memory address and the next memory address to appear in the random pattern generator.
Claim 10
Dependent Claim 41 words
The system of claim 6 wherein said means comprises an exclusive OR gate connected between the address lines and the input lines, the least significant and the next least significant address lines connected to the input of the exclusive OR gate.
Claim 11
Dependent Claim 26 words
The system of claim 7 wherein said means further comprises: AND, OR, and AND gates sequentially connected between the exclusive OR gate and the input lines.
Claim 12
Independent Claim 133 words
A system for functional and checkerboard memory self-test comprising: a memory array having address lines, input lines, and output lines; a multiple input signature register connected to the output lines of the memory array; a random pattern generator based upon a primitive polynomial and connected to the address lines and input lines of the memory array, the random pattern generator capable of stepping through each memory address, including a current memory address and a next memory address having a parity, the random pattern generator having at least one stage in addition to the number of address lines; and means connected to the address lines and the input lines of the memory array for monitoring the parity of the current memory address and the next memory address to appear in the random pattern generator.
Claim 13
Independent Claim 133 words
A system for functional and checkerboard memory self-test comprising: a memory array having address lines, input lines, and output lines; a multiple input signature register connected to the output lines of the memory array; a random pattern generator based upon a primitive polynomial and connected to the address lines and input lines of the memory array, the random pattern generator capable of stepping through each memory address, including a current memory address and a next memory address having a parity, the random pattern generator having at least one stage in addition to the number of address lines; and means connected to the address lines and the input lines of the memory array for monitoring the parity of the current memory address and the next memory address to appear in the random pattern generator.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1995-03-31 1995-09-30 1996-03-31 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1999-03-31 1999-09-30 2000-03-31 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2003-03-31 2003-09-30 2004-03-31 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag