# US 6,732,229 B1 · Method and apparatus for memory redundancy with no critical delay-path

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

- Number: US 6,732,229 B1
- Document ID: US6732229B1
- Status: Granted
- Kind: B1
- Application number: 09/503,751
- Filed: 2000-02-14
- Granted: 2004-05-04
- Earliest claimed: 1999-02-24
- Assignees: Monolithic System Technology, Inc.
- Inventors: Wingyu Leung; Jui-Pin Tang
- Web page: https://patentgrep.com/patent/US6732229B1

## CPC

- G11C 29/78: {using programmable devices}
- G11C: STATIC STORES (semiconductor memory devices H10B)

## Abstract

A memory redundancy scheme is provided for re-routing data signal paths to disconnect defective memory blocks in a memory array. Each memory block is provided with a corresponding routing unit. Each routing unit is coupled to its corresponding memory block and at least one additional adjacent memory block. The routing units are configured to route data between functional memory blocks and a data bus. The routing units are controlled by configuration values stored in a shifter circuit, which extends through the routing units. To replace a defective memory block, the address of the defective memory block is identified. Configuration values are serially loaded into the shifter circuit, wherein the configuration values are selected in response to the address of the defective memory block. The configuration values cause the routing units to bypass the defective memory block, connect a redundant memory block, and shift connections in the memory blocks located between the redundant memory block and the defective memory block.

## Claims

### Claim 1

A redundancy system comprising:
a plurality of circuit blocks;
a plurality of routing units configured to route read and write data between the circuit blocks and a data bus, wherein at least one shifter circuit extends through the routing units, the shifter circuit storing values for configuring the routing units; and
a routing unit programmer for loading the shifter circuit through a routing unit.

### Claim 2 (depends on 1)

The redundancy system of claim 1, wherein the shifter circuit comprises one or more series connected storage elements in each routing unit.

### Claim 3 (depends on 1)

The redundancy system of claim 1, wherein each of the routing units includes a router coupled between a predetermined number of the circuit blocks and the data bus.

### Claim 4 (depends on 3)

The redundancy system or claim 3, wherein each router is controlled by one or more values stored in the shifter circuit.

### Claim 5 (depends on 3)

The redundancy system of claim 3, wherein each of the routers is configured to connect one of the circuit blocks to the data bus.

### Claim 6 (depends on 3)

The redundancy system of claim 3, wherein the predetermined number is two or greater.

### Claim 7 (depends on 3)

The redundancy system of claim 3, wherein each router includes a plurality of transmission gates coupled in parallel to the data bus.

### Claim 8 (depends on 3)

The redundancy system of claim 3, wherein the predetermined number of circuit blocks are consecutive circuit blocks.

### Claim 9 (depends on 1)

The redundancy system of claim 1, wherein the data bus includes a plurality of data lines used to transmit both read data and write data.

### Claim 10 (depends on 1)

The redundancy system of claim 1, wherein the data bus includes a first set of data lines for carrying read data, and a second set of data lines for carrying write data.

### Claim 11 (depends on 1)

The redundancy system of claim 1, wherein the routing unit programmer comprises:
a first register for storing a first address associated with a first defective circuit block;
a counter for sequentially providing addresses associated with all of the circuit blocks; and
a first comparator coupled to the counter and the first register.

### Claim 12 (depends on 11)

The redundancy system of claim 11, further comprising a first sequential logic element coupled to an output of the first comparator, wherein the shifter circuit is loaded through the first sequential logic element.

### Claim 13 (depends on 11)

The redundancy system of claim 11, further comprising:
a second register for storing a second address associated with a second defective circuit block; and
a second comparator coupled to the counter and the second register.

### Claim 14 (depends on 13)

The redundancy system of claim 13, further comprising:
a first sequential logic element coupled to an output of the first comparator,
a second sequential logic element coupled to an output terminal of the second comparator, wherein the first and second sequential logic elements are connected in a circular queue.

### Claim 15 (depends on 14)

The redundancy system of claim 14, wherein the shifter circuit is loaded with valves from the first and second sequential logic elements.

### Claim 16

A method of replacing defective circuit blocks with redundant circuit blocks, the method comprising the steps of:
identifying a first address of a first defective circuit block;
identifying a second address of a second defective circuit block;
serially loading values into a shifter circuit, wherein the values are selected in response to the first address response to the first address and the second address;
bypassing the first defective circuit block and the second defective circuit block in response to values stored in the shifter circuit; and
connecting a first redundant circuit block in response to values stored in the shifter circuit;
connecting a first redundant circuit block and a second redundant circuit block in response to values stored in the shifter circuit.

### Claim 17 (depends on 16)

The method of claim 16, further comprising the steps of:
shifting connections to one or more circuit blocks located between the second defective circuit block and the first defective circuit block by one position in response to values stored in the shifter circuit; and
shifting connections to one or more circuit blocks located between the first and second redundant circuit blocks and the second defective circuit block by two positions in response to values stored in the shifter circuit.

### Claim 18 (depends on 16)

The method of claim 16, wherein the step of serially loading values into the shifter circuit comprises the steps of:
storing the first address in a first register;
storing the second address minus one in a second register;
sequentially comparing the first address and the second address minus one with addresses associated with a set of circuit blocks;
loading a value into the shifter circuit;
modifying the value loaded into the shifter circuit when the first address matches an address associated with a circuit block in the set of circuit blocks; and
modifying the value loaded into the shifter circuit when the second address minus one matches an address associated with a circuit block in the set of circuit blocks.

### Claim 19

A method of replacing defective circuit blocks with redundant circuit blocks, the method comprising the steps of:
identifying a first address of a first defective circuit block;
serially loading values into a shifter circuit, wherein the values are selected in response to the first address, wherein the step of serially loading values into the shifter circuit comprises the steps of:
storing the first address in a first register; sequentially comparing the first address with addresses associated with a set of circuit blocks;
loading a value into the shifter circuit; and
modifying the value loaded into the shifter circuit when the first address matches an address associated with a circuit block in the set of circuit blocks;
bypassing the first defective circuit block in response to values stored in the shifter circuit; and
connecting a first redundant circuit block in response to values stored in the shifter circuit.

### Claim 20

A method of replacing defective circuit blocks with redundant circuit blocks, the method comprising the steps of:
identifying a first address of a first defective circuit block;
identifying a second address of a second defective circuit block;
identifying a third address of a third defective circuit block;
serially loading values into a shifter circuit, wherein the values are selected in response to the first, second and third addresses;
bypassing the first, second and third defective circuit blocks in response to values stored in the shifter circuit; and
connecting first, second and third redundant circuit blocks in response to values stored in the shifter circuit.

### Claim 21 (depends on 20)

The method of claim 20, wherein the step of serially loading values into the shifter circuit further comprises the steps of:
storing the first address in a first register;
storing the second address minus one in a second register;
storing the third address minus two in a third register;
sequentially comparing the first address, the second address minus one, and the third address minus two with addresses associated with a set of circuit blocks;
loading a value into the shifter circuit;
modifying the value loaded into the shifter circuit when the first address matches an address associated with a circuit block in the set of circuit blocks;
modifying the value loaded into the shifter circuit when the second address minus one matches an address associated with a circuit block in the set of circuit blocks;
modifying the value loaded into the shifter circuit when the third address minus two matches an address associated with a circuit block in the set of circuit blocks.
