# US 2006/0242451 A1 · Memory Checking Device and Method for Checking a Memory

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

- Number: US 2006/0242451 A1
- Document ID: US20060242451A1
- Status: Published application
- Kind: A1
- Application number: 11/278,889
- Filed: 2006-04-06
- Published: 2006-10-26
- Earliest claimed: 2005-04-07
- Assignees: Infineon Technologies AG
- Inventors: Udo Ausserlechner
- Web page: https://patentgrep.com/patent/US20060242451A1

## CPC

- G06F 11/1008: {in individual solid state devices (G06F11/1004 takes precedence)}
- G11C 29/42: using error correcting codes [ECC] or parity check
- G11C 29/52: Protection of memory contents; Detection of errors in memory contents
- G11C 2029/0409: {Online test}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G11C: STATIC STORES (semiconductor memory devices H10B)

## Abstract

A memory checking device for cells arranged in memory rows and columns, wherein, in a state of integrity, the memory has parity values for two memory rows or two columns that differ from each other with the same parity value calculation rule or with different parity value calculation rules or are equal with different parity value calculation rules. The checking device includes a reader for reading out the binary memory values of the two memory columns or rows. The memory checking device includes a checking unit designed to calculate the parity value according to the calculation rule valid for the corresponding memory column or row for the two memory columns or the two rows, and to compare it with an expected parity value for the state of integrity, and, in the case of a deviation, to provide an error indication in one of the rows or one of the columns.

## Claims

### Claim 1

A memory checking device for a memory having memory cells arranged in memory rows and memory columns and having binary memory values, wherein, in a state of integrity, the memory is occupied such that parity values for two memory rows or for two memory columns differ from each other with equal parity value calculation rules or are equal with different parity value calculation rules, wherein the memory checking device comprises:
a checking unit adapted to calculate one parity value each for the two memory columns or the two memory rows according to the calculation rule valid for the corresponding memory column or the corresponding memory row, and to compare it with an expected parity value for the state of integrity.

### Claim 2 (depends on 1)

A memory checking device according to claim 1, wherein, in the state of integrity, parity values for two memory rows arranged adjacently in a memory or two memory columns arranged adjacently in the memory differ from each other with the same parity value calculation rule or are equal with different parity value calculation rules, wherein the reader is adapted to read out the memory cells of the two memory rows arranged adjacently in the memory or the memory cells of the two memory columns arranged adjacently in the memory, and wherein the checking unit is adapted to calculate the parity values for the two adjacently arranged memory columns or the two adjacently arranged memory rows and to compare them with the expected parity value for the state of integrity.

### Claim 3 (depends on 1)

A memory checking device according to claim 1, wherein, in the state of integrity of the memory, the parity values for consecutive memory rows or for consecutive memory columns are set by a parity value mask, wherein the parity value mask is a sequence alternately comprising the binary values zero and one, and wherein the checking unit is adapted to calculate the parity values for consecutive memory rows or for consecutive memory columns and to provide an indication of an error in one of the memory rows or one of the memory columns when the calculated parity values for the consecutive memory rows or for the consecutive memory columns do not correspond to the parity values of the respective parity mask.

### Claim 4 (depends on 1)

A memory checking device according to claim 1, wherein, in the state of integrity, the memory is occupied such that parity values for two memory rows differ from each other with equal parity value calculation rules or are equal with different parity value calculation rules, and wherein parity values for two memory columns differ from each other with equal parity value calculation rules or are equal with different parity value calculation rules,
wherein the reader is adapted to read out the two memory rows and the two memory columns,
wherein the checking unit is adapted to calculate the corresponding parity values according to the parity value calculation rule valid for the corresponding memory column and the corresponding memory row for the two memory rows and the two memory columns, and to provide an indication of an error in one of the memory rows and one of the memory columns when the calculated parity values do not correspond to the corresponding expected parity values for the state of integrity.

### Claim 5 (depends on 1)

A memory checking device according to claim 1, wherein the checking unit is adapted to perform a modulo two addition or an EXCLUSIVE-OR operation in the parity value calculation.

### Claim 6 (depends on 1)

A memory checking device according to claim 1, wherein the checking unit is adapted to use a bit of a memory address for a memory row or a memory column in the calculation of a parity value.

### Claim 7 (depends on 1)

A memory checking device according to claim 1, wherein the memory has a memory capacity of at the most 1000 bits, wherein the reader is adapted to be able to read out a memory of the size of at the most 1000 bits.

### Claim 8 (depends on 1)

A memory checking device according to claim 1, wherein, in the state of integrity, the memory comprises a binary memory value of one in a protection memory cell in a predefined memory row and a predefined memory column in the memory to provide information that the contents of the memory cells of the memory may not be overwritten, wherein, in the state of integrity, the memory comprises a binary parity value of one in the predefined memory row or a binary parity value of one in the predefined memory column at the same time, and
wherein the reader is adapted to read out the predefined memory row or the predefined memory column including the protection memory cell, and wherein the checking unit is adapted to calculate the parity value for the predefined memory row or the predefined memory column, wherein the device further includes:
a writer for writing memory values into the memory, wherein the writer is adapted to perform the writing of memory values into the memory when there is no indication of an error in the predefined memory row or the predefined memory column and a calculated binary parity value of zero for the predefined memory row or the predefined memory column, and not to perform the writing of memory values into the memory when there is an indication of an error in the predefined memory row or the predefined memory column.

### Claim 9 (depends on 1)

A memory checking device according to claim 1, wherein, in the state of integrity, the memory comprises a binary memory value of zero in a protection memory cell in a predefined memory row and a predefined memory column in the memory to provide information that the contents of the memory cells of the memory may not be overwritten, wherein, in the state of integrity, the memory comprises a binary parity value of zero in the predefined memory row or a binary parity value of zero in the predefined memory column at the same time, and
wherein the reader is adapted to read out the predefined memory row or the predefined memory column including the protection memory cell, and wherein the checking unit is adapted to calculate the parity value for the predefined memory row or the predefined memory column, wherein the device further includes:
a writer for writing memory values into the memory, wherein the writer is adapted to perform the writing of memory values into the memory when there is no indication of an error in the predefined memory row or the predefined memory column and a calculated binary parity value of one for the predefined memory row or the predefined memory column, and not to perform the writing of memory values into the memory when there is an indication of an error in the predefined memory row or the predefined memory column.

### Claim 10 (depends on 1)

A memory checking device according to claim 1, having a reader for reading out the binary memory values of the two memory columns or the two memory rows, and in which the checking unit is adapted, in the case of a deviation, to provide an indication of an error in one of the memory rows or one of the memory columns to thereby check the memory.

### Claim 11

A method for checking a memory having memory cells arranged in memory rows and memory columns and having binary memory values, wherein, in a state of integrity, the memory is occupied such that parity values for two memory rows or for two memory columns differ from each other with equal parity value calculation rules or are equal with different parity value calculation rules, wherein the method includes:
calculating the parity value for the two memory columns or the two memory rows according to the calculation rule valid for the corresponding memory column or the corresponding memory row; and
comparing the calculated parity values with an expected parity value for the state of integrity.

### Claim 12 (depends on 11)

A method according to claim 11, further comprising:
reading out the binary memory values of the two memory columns or the two memory rows; and
providing an indication of an error in one of the memory rows or one of the memory columns in the case of a deviation of the calculated parity value from an expected parity value for the state of integrity to thereby check the memory.

### Claim 13

A memory occupation device for a memory having memory cells, which are arranged in memory rows and memory columns and may store binary memory values, wherein the memory occupation device comprises:
a unit for determining the memory values to be stored in the corresponding memory cells of the memory, wherein the unit for determining is adapted to determine the memory values such that parity values for two memory rows or for two memory columns differ from each other with the same parity value calculation rule or are equal with different parity value calculation rules; and
a writer for writing the memory values determined by the unit for determining into the corresponding memory cells of the memory to occupy the memory.

### Claim 14 (depends on 13)

A memory occupation device according to claim 13, wherein the unit for determining is adapted to determine the memory values of the memory cells of two adjacently arranged memory rows or two adjacently arranged memory columns such that the parity values of the two adjacent memory rows or the two adjacent memory columns differ from each other with the same parity value calculation rule or are equal with a different parity value calculation rule.

### Claim 15 (depends on 13)

A memory occupation device according to claim 13, wherein the unit for determining is adapted to determine memory values for memory cells of consecutive memory rows or memory values for memory cells of consecutive memory columns such that parity values for the consecutive memory rows or the consecutive memory columns are set by a parity value mask, wherein the parity value mask is a sequence alternately comprising the binary values 0 and 1.

### Claim 16 (depends on 13)

A memory occupation device according to claim 13, wherein the unit for determining is adapted to determine the memory values such that parity values for two memory rows differ from each other with the same parity value calculation rule or are equal with different parity value calculation rules, and that parity values for two memory columns differ from each other with the same parity value calculation rule or are equal with different parity value calculation rules.

### Claim 17 (depends on 13)

A memory occupation device according to claim 13, wherein the unit for determining is adapted to perform a modulo two addition or an EXCLUSIVE-OR operation of memory values to be written into memory cells with a parity value that a memory row or a memory column is to have in the state of integrity of the memory, when determining the memory values for the memory cells.

### Claim 18 (depends on 13)

A memory occupation device according to claim 13, wherein the unit for determining is adapted to use a bit of a memory address for a memory row or a memory column when determining a memory value for a memory cell.

### Claim 19 (depends on 13)

A memory occupation device according to claim 13, wherein the unit for determining is adapted to determine a parity definition value to be written into a predefined memory cell of a memory row by means of a combination of a parity value associated with the memory row and all further memory values of the memory values to be written into the corresponding memory row, or to determine a parity definition value to be written into a predefined memory cell of a memory column by means of a combination of a parity value associated with the memory column and all further memory values of the memory values to be written into the corresponding memory column.

### Claim 20 (depends on 19)

A memory occupation device according to claim 19, wherein the unit for determining is adapted to arrange the parity definition values for each of the memory rows in a common memory column and to arrange the parity definition values for each of the memory columns in a common memory row.

### Claim 21 (depends on 20)

A memory occupation device according to claim 20, wherein the unit for determining is adapted to determine the memory values to be written into the memory cells of the memory such that the parity value for the common memory column and the parity value for the common memory row is a binary value of one, respectively.

### Claim 22 (depends on 13)

A memory occupation device according to claim 13, wherein the unit for determining is adapted to allocate a binary memory value of one to a protection memory cell of the memory arranged in a predefined memory row and in a predefined memory column to provide information that the contents of the memory cells of the memory may not be overwritten, and wherein the unit for determining is further adapted to determine the memory values of the memory cells in the predefined memory row such that the parity value of the predefined memory row has a binary value of one, or to determine the memory values of the memory cells in the predefined memory column such that the parity value of the predefined memory column has a binary value of one.

### Claim 23 (depends on 13)

A memory occupation device according to claim 13, wherein the unit for determining is adapted to allocate a binary memory value of zero to a protection memory cell of the memory arranged in a predefined memory row and in a predefined memory column to provide information that the contents of the memory cells of the memory may not be overwritten, and wherein the unit for determining is further adapted to determine the memory values of the memory cells of the predetermined memory row such that the parity value of the predefined memory row has a binary value of zero, or to determine the memory values of the memory cells in the predefined memory column such that the parity value of the predefined memory column has a binary value of zero.

### Claim 24

A method for occupying memory cells of a memory, which are arranged in memory rows and memory columns in the memory and may store binary memory values, wherein the method comprises:
determining the memory values to be stored in the corresponding memory cells of the memory, wherein the determining is done such that parity values for two memory rows or for two memory columns differ from each other with the same parity value calculation rule or are equal with different parity value calculation rules; and
writing the determined memory values into the corresponding memory cells of the memory to occupy the memory.

### Claim 25

A computer program with program code executable on a computer for performing a method for checking a memory having memory cells arranged in memory rows and memory columns and having binary memory values, wherein, in a state of integrity, the memory is occupied such that parity values for two memory rows or for two memory columns differ from each other with equal parity value calculation rules or are equal with different parity value calculation rules, wherein the method comprises:
calculating the parity value for the two memory columns or the two memory rows according to the calculation rule valid for the corresponding memory column or the corresponding memory row; and
comparing the calculated parity values with an expected parity value for the state of integrity.

### Claim 26

A computer program with program code executable on a computer for performing a method for occupying memory cells of a memory, which are arranged in memory rows and memory columns in the memory and may store binary memory values, wherein the method comprises:
determining the memory values to be stored in the corresponding memory cells of the memory, wherein the determining is done such that parity values for two memory rows or for two memory columns differ from each other with the same parity value calculation rule or are equal with different parity value calculation rules; and
writing the determined memory values into the corresponding memory cells of the memory to occupy the memory.

### Claim 27

A memory checking device for a memory having memory cells arranged in memory rows and memory columns and having binary memory values, wherein, in a state of integrity, the memory is occupied such that parity values for two memory rows or for two memory columns differ from each other with equal parity value calculation rules or are equal with different parity value calculation rules, wherein the memory checking device includes:
a reader for reading out the binary memory values of the two memory columns or the two memory rows; and
a checking unit adapted to calculate one parity value each for the two memory columns or the two memory rows according to the calculation rule valid for the corresponding memory column or the corresponding memory row, and to compare it with an expected parity value for the state of integrity, and, in the case of a deviation, to provide an indication of an error in one of the memory rows or one of the memory columns to thereby check the memory.

### Claim 28

A method for checking a memory having memory cells arranged in memory rows and memory columns and having binary memory values, wherein, in a state of integrity, the memory is occupied such that parity values for two memory rows or for two memory columns differ from each other with equal parity value calculation rules or are equal with different parity value calculation rules, wherein the method includes:
reading out the binary memory values of the two memory columns or the two memory rows;
calculating the parity value for the two memory columns or the two memory rows according to the calculation rule valid for the corresponding memory column or the corresponding memory row;
comparing the calculated parity values with an expected parity value for the state of integrity; and
providing an indication of an error in one of the memory rows or one of the memory columns in the case of a deviation of the calculated parity value from an expected parity value for the state of integrity to thereby check the memory.
