# US 2008/0304343 A1 · Method and apparatus for testing a circuit

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2008/0304343 A1
- Document ID: US20080304343A1
- Status: Published application
- Kind: A1
- Application number: 11/758,743
- Filed: 2007-06-06
- Published: 2008-12-11
- Earliest claimed: 2007-06-06
- Assignees: Sony Computer Entertainment Inc.
- Inventors: Hiroshi Yoshihara
- Web page: https://patentgrep.com/patent/US20080304343A1

## CPC

- G11C 29/36: Data generation devices, e.g. data inverters
- G11C 2029/0405: {comprising complete test loop}
- G11C 2029/3602: {Pattern generator}
- G11C: STATIC STORES (semiconductor memory devices H10B)

## Abstract

A system and method for testing a memory array are disclosed which may include establishing a stored data vector, including a plurality of data bits, within at least one circuit; applying one or more logical operations on the stored data vector to generate a succession of original data vectors at the at least one circuit; transmitting the succession of original data vectors through a memory array to provide a succession of exercised data vectors; comparing the succession of exercised data vectors to the succession of respective original data vectors; and determining whether the memory array passes or fails based on the comparing step.

## Claims

### Claim 1

A method for testing a memory array, comprising:
(a) establishing a stored data vector, including a plurality of data bits, within at least one circuit;
(b) applying one or more logical operations on the stored data vector to generate a succession of original data vectors at the at least one circuit;
(c) transmitting the succession of original data vectors through a memory array to provide a succession of exercised data vectors;
(d) comparing the succession of exercised data vectors to the succession of respective original data vectors; and
(e) determining whether the memory array passes or fails based on the comparing step.

### Claim 2 (depends on 1)

The method of claim 1, wherein the step of applying the one or more logical operations is performed recursively.

### Claim 3 (depends on 1)

The method of claim 1, wherein steps (b) and (c) are performed sufficiently rapidly to dynamically test the memory array.

### Claim 4 (depends on 1)

The method of claim 1, wherein the comparing step comprises:
comparing a given original data vector to an exercised version of the given original data vector once for each cycle of a clock signal input to the at least one circuit.

### Claim 5

An apparatus for testing a memory array, the apparatus operable to:
(a) establish a stored data vector, including a plurality of data bits, within at least one circuit;
(b) apply one or more logical operations on the stored data vector to generate a succession of original data vectors at the at least one circuit;
(c) transmit the succession of original data vectors through a memory array to provide a succession of exercised data vectors;
(d) compare the succession of exercised data vectors to the succession of respective original data vectors; and
(e) determine whether the memory array passes or fails based on a comparison result.

### Claim 6 (depends on 5)

The apparatus of claim 5, wherein the apparatus is operable to perform the applying step recursively.

### Claim 7 (depends on 5)

The apparatus of claim 5, wherein the apparatus is operable to generate the original data vectors and to transmit the original data vectors through the memory array sufficiently rapidly to dynamically test the memory array.

### Claim 8 (depends on 5)

The apparatus of claim 5, wherein the apparatus is operable to:
compare a given original data vector to an exercised version of the given original data vector once for each cycle of a clock signal input to the at least one circuit.

### Claim 9

A method for testing a memory array, comprising:
(a) applying a first set of one or more logical operations to generate a plurality of successive data vectors;
(b) storing the succession of data vectors in the memory array;
(c) applying a second set of one or more logical operations to generate a plurality of successive expectation data values;
(d) reading the plurality of data vectors from the memory array;
(e) comparing the plurality of expectation data values to the plurality of respective read data vectors; and
(f) determining whether the memory array passes or fails based on the comparing step.

### Claim 10 (depends on 9)

The method of claim 9, wherein at least one of the step of applying a first set of one or more operations, and the step of applying a second set of one or more operations, is performed recursively.

### Claim 11 (depends on 9)

The method of claim 9, wherein at least one of:
the applying the first set of one or more logical operations comprises: first applying the first set of one or more logical operations to an initial data vector supplied to a write data generator; and
the applying the second set of one or more logical operations comprises first applying the second set of one or more logical operations to an initial expectation data value supplied to an expectation data generator.

### Claim 12 (depends on 9)

The method of claim 9, wherein steps (a) through (d) are performed sufficiently rapidly to dynamically test the memory array.

### Claim 13 (depends on 9)

The method of claim 9, wherein at least one of:
the first and second sets of one or more logical operations are the same; and
an initial data vector used in the step of generating the plurality of data vectors and an initial expectation data value used in the step of generating the plurality of expectation values are the same.

### Claim 14 (depends on 9)

The method of claim 9, wherein the comparing step compares one said read data vector to one said expectation data value for each cycle of a clock signal input to the memory array.

### Claim 15

An apparatus for testing a memory array, wherein the apparatus is operable to:
(a) apply a first set of one or more logical operations to generate a plurality of successive data vectors;
(b) store the succession of data vectors in the memory array;
(c) apply a second set of one or more logical operations to generate a plurality of successive expectation data values;
(d) read the plurality of data vectors from the memory array;
(e) compare the plurality of expectation data values to the plurality of respective read data vectors; and
(f) determine whether the memory array passes or fails based on a result of the comparison,
wherein the apparatus is operable to perform the testing sufficiently rapidly to dynamically test the memory array.

### Claim 16 (depends on 15)

The apparatus of claim 15, wherein the apparatus is operable to at least one of:
apply the first set of one or more operations recursively; and
apply the second set of one or more operations recursively.

### Claim 17 (depends on 15)

The apparatus of claim 15, wherein at least one of:
the apparatus is operable to first apply the first set of one or more logical operations to an initial data vector supplied to a write data generator; and
first apply the second set of one or more logical operations to an initial expectation data value supplied to an expectation data generator.

### Claim 18 (depends on 15)

The apparatus of claim 15, wherein the apparatus is operable to compare one said read data vector to one said expectation data value for each cycle of a clock signal input to the memory array.

### Claim 19

A method for testing a memory array, comprising:
providing a initial data vector, having a plurality of bits, in a write circuit;
performing at least one logical operation on the data vector to generate a plurality of successive data vectors; and
storing the plurality of successive data vectors in a plurality of respective locations in the memory array.

### Claim 20 (depends on 19)

The method of claim 19, wherein at least one of:
the performing step is conducted recursively;
the performing step executing the performing step once for each cycle of a clock signal input to the write circuit;
the performing step and the storing step are repeated sufficiently rapidly to dynamically test the memory array;
the performing step comprises toggling at least one bit of each data vector, of the succession of data vectors, to provide a next data vector in the succession of data vectors; and
the performing step comprises toggling each bit of each data vector, of the succession of data vectors, to provide a next data vector in the succession of data vectors.

### Claim 21 (depends on 19)

The method of claim 19, further comprising:
providing an initial expectation data value, having a plurality of bits, in an expectation data circuit; and
recursively performing at least one logical operation on the expectation data value to generate a plurality of successive expectation data values.

### Claim 22 (depends on 19)

The method of claim 19, wherein at least one of:
the initial expectation data value is equal to the initial data vector;
the plurality of successive expectation data values are the same as the plurality of generated respective data vectors; and
the plurality of successive expectation data values are equal to the complements of the plurality of respective read data vectors.

### Claim 23 (depends on 21)

The method of claim 21, further comprising:
reading a plurality of data vectors from the memory array; and
comparing each said generated expectation data value to a respective one of the read data vectors; and
generating a test result from the comparing step.

### Claim 24 (depends on 23)

The method of claim 23, wherein the reading step comprises:
reading the data vectors from the memory array in a same order as the data vectors were generated in the performing step; and
comparing each bit of each generated expectation data value to a bit of corresponding bit order in the respective one of the read data vectors.

### Claim 25 (depends on 24)

The method of claim 24, further comprising at least one of:
consolidating a result of the comparing step into a form suitable for communication to a control circuit within one cycle of a clock signal input to the memory array; and
consolidating a result of the comparing step into a single bit.

### Claim 26

An apparatus for testing a memory array, wherein the apparatus is operable to:
provide a initial data vector, having a plurality of bits, in a write circuit;
perform at least one logical operation on the data vector to generate a plurality of successive data vectors; and
store the plurality of successive data vectors in a plurality of respective locations in the memory array.

### Claim 27 (depends on 26)

The apparatus of claim 26, wherein the apparatus is operable to at least one of:
recursively perform the at least one logical operation;
perform the logical operation once for each cycle of a clock signal input to the write circuit;
generate the plurality of successive data vectors and store the successive data vectors in the memory array sufficiently rapidly to dynamically test the memory array;
toggle at least one bit of each data vector, of the succession of data vectors, to provide a next data vector in the succession of data vectors; and
toggle each bit of each data vector, of the succession of data vectors, to provide a next data vector in the succession of data vectors.

### Claim 28 (depends on 26)

The apparatus of claim 26, wherein the apparatus is further operable to:
provide an initial expectation data value, having a plurality of bits, in an expectation data circuit; and
perform at least one logical operation recursively on the expectation data value to generate a plurality of successive expectation data values.

### Claim 29 (depends on 28)

The apparatus of claim 28, wherein at least one of:
the initial expectation data value is equal to the initial data vector;
the plurality of successive expectation data values are the same as the plurality of generated respective data vectors; and
the plurality of successive expectation data values are equal to the complements of the plurality of respective read data vectors.

### Claim 30 (depends on 28)

The apparatus of claim 28, wherein the apparatus is further operable to:
read a plurality of data vectors from the memory array;
compare each said generated expectation data value to a respective one of the read data vectors; and
generate a test result from the comparing step.

### Claim 31 (depends on 28)

The apparatus of claim 28, wherein the apparatus is further operable to:
read the data vectors from the memory array in a same order as the data vectors were generated in the performing step; and
compare each bit of each generated expectation data value to a bit of corresponding bit order in the respective one of the read data vectors.

### Claim 32 (depends on 31)

The apparatus of claim 31, wherein the apparatus is operable to at least one of:
consolidate a result of the comparing step into a form suitable for communication to a control circuit within one cycle of a clock signal input to the memory array; and
consolidate a result of the comparing step into a single bit.

### Claim 33 (depends on 26)

The apparatus of claim 26, further comprising:
a write data generator in communication with the memory array.

### Claim 34 (depends on 33)

The apparatus of claim 33, wherein the write data generator and the memory array are disposed within an array macro.

### Claim 35 (depends on 32)

The apparatus of claim 32, wherein the write data generator comprises:
a plurality of data-latches connected in series to form a scan chain.

### Claim 36

A method for testing a memory array, comprising:
(a) providing an initial expectation data value, having a plurality of bits, in an expectation data circuit;
(b) conducting at least one logical operation on the expectation data value to generate a plurality of successive expectation data values
(c) reading a plurality of data vectors from the memory array;
(d) comparing each said generated expectation data value to a corresponding one of the read data vectors, each said generated expectation data value and each said corresponding read data vector forming a vector pair; and
(e) determining whether the memory array passes or fails based on the comparing step.

### Claim 37 (depends on 36)

The method of claim 36, wherein the conducting step is performed recursively.

### Claim 38 (depends on 36)

The method of claim 36, wherein the conducting step comprises at least one of:
toggling at least one bit of each expectation data value; and
toggling each bit of each expectation data value.

### Claim 39 (depends on 36)

The method of claim 36, wherein the comparing step comprises at least one of:
performing at least one logical operation using each said generated expectation data value and its corresponding read data vector as inputs; and
comparing each bit of each generated expectation data value to a bit of corresponding bit order in the corresponding one of the read data vectors.

### Claim 40 (depends on 36)

The method of claim 36 further comprising performing each of steps (b), (c), and (d) once in between successive instances of performing the determining step.

### Claim 41 (depends on 40)

The method of claim 40 wherein within each instance of performing steps (b), (c), and (d), the comparing step is performed last.

### Claim 42 (depends on 36)

The method of claim 36, wherein the determining step comprises:
indicating whether each generated expectation data value includes bits identical to the bits in the corresponding read data vector it is compared to in the comparing step.

### Claim 43

An apparatus for testing a memory array, wherein the apparatus is operable to:
(a) provide an initial expectation data value, having a plurality of bits, in an expectation data circuit;
(b) conduct at least one logical operation on the expectation data value to generate a plurality of successive expectation data values;
(c) read a plurality of data vectors from the memory array;
(d) compare each said generated expectation data value to a corresponding one of the read data vectors, each said generated expectation data value and each said corresponding read data vector forming a vector pair; and
(e) determine whether the memory array passes or fails based on a result of the comparison.

### Claim 44 (depends on 43)

The apparatus of claim 43, further comprising:
a read circuit in communication with the memory array; and
a comparison circuit in communication with the expectation data circuit.

### Claim 45 (depends on 44)

The apparatus of claim 44, wherein:
the read circuit comprises a plurality of data latches;
the expectation data circuit comprises a plurality of data latches; and
the comparison circuit comprises a plurality of digital logic gates, wherein each said digital logic gate is operable to perform at least one logical operation on one bit of a given read data vector and one bit, of corresponding bit order, of an expectation data value being compared to the given read data vector, thereby providing a multi-bit comparison result.
