← Back to Patent Explorer
US5841710A Expired / Lapsed US ⏱️ 0.0 years remaining

Dynamic address remapping decoder

Assignee: Round Rock Research LLC
•
Filing: 1997-02-14
•
Granted: 1998-11-24
•
Expires: 2017-02-14
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A memory system comprising a memory controller, first and second memory-arrays and a decoder is provided. The memory arrays comprise at least one section having all good memory locations, and at least one section having at least one faulty memory location. The decoder is responsive to the memory controller for selectively enabling data transfer between the controller and the sections of the first and second memory arrays having all good memory locations.

Inventors

  • 👤 Corey L. Larsen

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-03 08:46
CPC Classifications
G; G11; G11C; G11C29/00; G11C29/70; G11C29/88

Claims Analysis

Total Claims: 21
Claim 1
Independent Claim 107 words
A memory system comprising: a memory controller; a first memory array comprising at least one section having all good memory locations, and at least one section having at least one faulty memory location; a second memory array comprising at least one section having all good memory locations, and at least one section having at least one faulty memory location; and a decoder coupled to said memory controller, said first memory array, and said second memory array, said decoder being responsive to said memory controller for selectively enabling data transfer between said controller and the sections of the first and second memory arrays having all good memory locations.
Claim 2
Dependent Claim 107 words
A memory system comprising: a memory controller; a first memory array comprising at least one section having all good memory locations, and at least one section having at least one faulty memory location; a second memory array comprising at least one section having all good memory locations, and at least one section having at least one faulty memory location; and a decoder coupled to said memory controller, said first memory array, and said second memory array, said decoder being responsive to said memory controller for selectively enabling data transfer between said controller and the sections of the first and second memory arrays having all good memory locations.
Claim 3
Dependent Claim 42 words
The system as defined in claim 1, wherein the sum of the memory locations in the sections of the first and second memory arrays having all good memory locations equals approximately the total number of memory locations in said first memory array.
Claim 4
Dependent Claim 62 words
The system as defined in claim 1, wherein said at least one section having all good memory locations in said first memory array comprises one half of an address space defined by said first memory array, and wherein said at least one section having at least one faulty memory location in said first memory array comprises one half of said address space.
Claim 5
Dependent Claim 62 words
The system as defined in claim 3, wherein said at least one section having all good memory locations in said second memory array comprises one half of an address space defined by said second memory array, and wherein said at least one section having at least one faulty memory location in said second memory array comprises one half of said address space.
Claim 6
Dependent Claim 35 words
The system as defined in claim 3, wherein the decoder is configured to direct data having an address in the section of the first memory array having all good memory locations to its original address.
Claim 7
Dependent Claim 46 words
The system as defined in claim 3, wherein the decoder is configured to redirect data having an address in the section of the first memory array having at least one faulty memory location to the section of the second memory array having all good memory locations.
Claim 8
Dependent Claim 34 words
The system as defined in claim 3, wherein the decoder enables the data stored in the section of the first memory array having all good memory locations to be retrieved from its original address.
Claim 9
Dependent Claim 57 words
The system as defined in claim 3, wherein the decoder enables the data stored in the section of the second memory array having all good memory locations to be retrieved in response to a request for retrieval of data which is addressed to the section of the first memory array having at least one faulty memory location.
Claim 10
Dependent Claim 31 words
The system as defined in claim 1, wherein said memory locations are defined by addresses, and wherein said addresses comprise at least one significant bit having one of two logical states.
Claim 11
Dependent Claim 40 words
The system as defined in claim 5, wherein the at least one significant bit defines a boundary separating the sections having all good memory locations from the sections having at least one faulty memory location in the first memory array.
Claim 12
Dependent Claim 87 words
A memory system comprising: a memory controller; a first memory array having at least one good and at least one faulty memory location; a second memory array having at least one good and at least one faulty memory location; a decoder responsive to the memory controller for enabling data storage in and retrieval from at least one of the first and second memory arrays, so that the first and second memory arrays appear to the memory controller as a single memory array having all good memory locations.
Claim 13
Dependent Claim 87 words
A memory system comprising: a memory controller; a first memory array having at least one good and at least one faulty memory location; a second memory array having at least one good and at least one faulty memory location; a decoder responsive to the memory controller for enabling data storage in and retrieval from at least one of the first and second memory arrays, so that the first and second memory arrays appear to the memory controller as a single memory array having all good memory locations.
Claim 14
Dependent Claim 40 words
The system of claim 11 wherein said memory controller is configured to output a row address comprising a plurality of row address bits, and wherein said decoder is responsive to fewer than three of said plurality of row address bits.
Claim 15
Dependent Claim 16 words
The system of claim 12 wherein said decoder is responsive to a single row address bit.
Claim 16
Dependent Claim 40 words
The system of claim 11 wherein said memory controller is configured to output a column address comprising a plurality of column address bits, and wherein said decoder is responsive to fewer than three of said plurality of column address bits.
Claim 17
Dependent Claim 16 words
The system of claim 14 wherein said decoder is responsive to a single column address bit.
Claim 18
Dependent Claim 66 words
The system as defined in claim 11, wherein the first memory array is segmented into at least one section having all good memory locations and at least one section having at least one faulty memory location, and wherein the second memory array is segmented into at least one section having all good memory locations and at least one section having at least one faulty memory location.
Claim 19
Dependent Claim 50 words
The system as defined in claim 16, wherein said memory locations are each defined by a row address comprising a plurality of bits and a column address comprising a plurality of bits, and wherein said sections are defined by logical states of fewer than six row and column address bits.
Claim 20
Dependent Claim 22 words
The system as defined in claim 17, wherein said sections are defined by a logical state of a single row address bit.
Claim 21
Dependent Claim 59 words
The system as defined in claim 16, wherein said at least one section of the first memory array having all good memory locations occupies a portion of memory address space which is complementary to and contiguous with the portion of address space occupied by said at least one section of the second memory array having all good memory locations.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2001-11-23 2002-05-25 2002-11-24 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2005-11-23 2006-05-25 2006-11-24 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2009-11-23 2010-05-25 2010-11-24 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag