# US 2012/0250438 A1 · Dynamic random access memory address line test technique

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

- Number: US 2012/0250438 A1
- Document ID: US20120250438A1
- Status: Published application
- Kind: A1
- Application number: 13/135,374
- Filed: 2011-07-01
- Published: 2012-10-04
- Earliest claimed: 2011-03-28
- Inventors: Peiyuan Liu; Henri Girard
- Web page: https://patentgrep.com/patent/US20120250438A1

## CPC

- G11C 29/56004: {Pattern generation}
- G11C 29/024: {in decoders}
- G11C 29/025: {in signal lines}
- G11C 11/401: forming cells needing refreshing or charge regeneration, i.e. dynamic cells
- G11C: STATIC STORES (semiconductor memory devices H10B)

## Abstract

Verification of the address connections of a memory (14) having multiplexed banks rows and columns commences by selecting a first address location having a bank/row/column value and then writing a pattern to a second location corresponding to the first location where one of the column, row, bank addresses could become stuck high or low. A second pattern gets written to the first location and a comparison occurs between the second pattern and first pattern written to the second location. If the data is the same, then that particular row/column/bank addresses is stuck.

## Claims

### Claim 1

A method for testing at least one address connection of a memory having multiplexed banks, rows, and columns, comprising the steps of:
(a) obtaining a first memory address by setting all ones or all zeros to one of bank, row, and column address;
(b) writing a first data pattern to a second memory address corresponding to the first memory address with one the selected bank, row, and column values stuck at a fixed logic state;
(c) writing a second data pattern to a first memory address; and
(d) comparing the second data pattern and data read from the second memory addresses, respectively, to determine whether a match exists therebetween as occurs when one of the one the selected bank, row and column values of the first memory address is stuck at a fixed logic state.

### Claim 2 (depends on 1)

The method according to claim 1 wherein the steps (a)-(d) are repeated for different bank, row, and column values of the first address.

### Claim 3 (depends on 2)

The method according to claim 2 further comprising the step of toggling the bank, row values, address values separately.

### Claim 4

Apparatus for testing at least one address connection of a memory having multiplexed banks, rows, and columns, comprising the steps of:
(a) means for obtaining a first memory address by setting all ones or all zeros to one of the bank, row, and column address;
(b) means for writing a first data pattern to a second memory address corresponding to the first memory address with one the selected bank, row, and column values stuck at a fixed logic state;
(c) means for writing a second data pattern to a first memory address; and
(d) means for comparing the second data pattern and data read from the second memory addresses, respectively, to determine whether a match exists therebetween as occurs when one of the one the selected bank, row and column values of the first memory address is stuck at a fixed logic state.

### Claim 5 (depends on 4)

The apparatus method according to claim 4 wherein the means for writing the first pattern, the means for writing the second pattern, and the comparing means collectively perform for different bank, row, and column values of the first address.
