US5265055A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Semiconductor memory having redundancy circuit
Assignee: Renesas Technology Corp
•
Filing: 1991-12-27
•
Granted: 1993-11-23
•
Expires: 2011-12-27
Abstract
Abstract A redundancy technique is introduced for a semiconductor memory and, more particularly a redundancy technique for a dynamic random access memory (DRAM) having a storage capacity of 16 mega bits or more. In such a DRAM, the efficiency of the redundancy technique is reduced, since a memory array is divided into a large number of memory mats. According to the present redundancy technique, in a semiconductor memory including a memory array which has a plurality of word lines, a plurality of bit lines arranged so that two-level crossings are formed between the word lines and the bit lines, and memory cells disposed at desired ones of the two-level crossings, there is provided, furthermore, a plurality of spare word (or bit) lines, address comparing circuits for storing therein a defective address existing in the memory array, to compare an address to be accessed with the defective address, and selection circuitry for replacing a word or bit line including a defective memory cell by a spare word (or bit) line in accordance with the result of the comparison. The memory array of the semiconductor memory is divided into M memory mats (where M ≧2), the number m of word or bit lines which are simultaneously replaced by spare word (or bit) lines, is less than the number M and equal to a divisor thereof, and the number L of spare word (or bit) lines per one memory mat and the number R of address comparing circuits satisfy a relation L<R≦LM/m and, preferably, L<R<LM/m.
Inventors
- 👤 Masashi Horiguchi
- 👤 Jun Etoh
- 👤 Masakazu Aoki
- 👤 Kiyoo Itoh
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-03 22:53
CPC Classifications
G; G11; G11C; G11C29/00; G11C29/70; G11C29/78; G11C29/80; G11C29/808; G11C29/781
Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
211 words
A semiconductor memory including: a memory array which has a plurality of word lines, a plurality of bit lines arranged so that two-level crossings are formed between the word lines and the bit lines, memory cells disposed at desired ones of the two-level crossings, and a plurality of spare word lines; a plurality of address comparing means for storing therein defective word line addresses existing in the memory array, respectively, so as to compare each address to be accessed with the stored addresses; means for replacing a defective word line by a spare word line in accordance with an output of a respective one of said plurality of address comparing means; and wherein said semiconductor memory is characterized in that: the memory array is divided into M memory mats, where M is an integer and M≧2, the number m of memory mats in which word lines thereof are respectively simultaneously replaced by spare word lines is less than the number M and is equal to a divisor of the number M, and the number L which corresponds to the number of logically independent spare word lines in each one of said M memory mats and the number R which corresponds to the number of address comparing means satisfy a relation L<R<LM/m.
Claim 2
Dependent Claim
211 words
A semiconductor memory including: a memory array which has a plurality of word lines, a plurality of bit lines arranged so that two-level crossings are formed between the word lines and the bit lines, memory cells disposed at desired ones of the two-level crossings, and a plurality of spare word lines; a plurality of address comparing means for storing therein defective word line addresses existing in the memory array, respectively, so as to compare each address to be accessed with the stored addresses; means for replacing a defective word line by a spare word line in accordance with an output of a respective one of said plurality of address comparing means; and wherein said semiconductor memory is characterized in that: the memory array is divided into M memory mats, where M is an integer and M≧2, the number m of memory mats in which word lines thereof are respectively simultaneously replaced by spare word lines is less than the number M and is equal to a divisor of the number M, and the number L which corresponds to the number of logically independent spare word lines in each one of said M memory mats and the number R which corresponds to the number of address comparing means satisfy a relation L<R<LM/m.
Claim 3
Dependent Claim
46 words
A semiconductor memory according to claim 1, wherein a spare word line is activated in accordance with the output of one of said plurality of address comparing means indicative of a logical correspondence between the word line being accessed and defective word line address stored therein.
Claim 4
Dependent Claim
79 words
A semiconductor memory according to claim 1, wherein R address comparing means are divided in L groups and each one of said L groups is coupled to a respective one of L means each one effecting a logical sum of the outputs of R/L address comparing means, and wherein L signals, outputted from said L means and indicative of a logical sum at each of said L groups, are used for selecting spare word lines in each memory mat.
Claim 5
Dependent Claim
24 words
A semiconductor memory according to claim 3, wherein each one of said L means for effecting a logical sum includes a logical OR circuit.
Claim 6
Dependent Claim
27 words
A semiconductor memory according to claim 1, wherein the semiconductor memory is a dynamic random access memory having a storage capacity of 16 mega bits or more.
Claim 7
Dependent Claim
25 words
A semiconductor memory according to claim 5, wherein said memory is used in a microcomputer whereby access of the memory is effected via a bus.
Claim 8
Dependent Claim
19 words
A semiconductor memory according to claim 6, wherein the microcomputer and the semiconductor memory are formed on one chip.
Claim 9
Dependent Claim
211 words
A semiconductor memory including: a memory array which has a plurality of word lines, a plurality of bit liens arranged so that two-level crossings are formed between the word lines and the bit lines, memory cells disposed at desired ones of the two-level crossings, and a plurality of spare bit lines; a plurality of address comparing means for storing therein defective bit line addresses existing in the memory array, respectively, so as to compare each address to be accessed with the stored addresses; means for replacing a defective bit line by a spare bit line in accordance with an output of a respective one of said plurality of address comparing means; and wherein said semiconductor memory is characterized in that: the memory array is divided into M memory mats, where M is an integer and M≧2, the number m of memory mats in which bit lines thereof are respectively simultaneously replaced by spare bit lines is less than the number M and is equal to a divisor of the number M, and the number L which corresponds to the number of logically independent spare bit lines in each one of said M memory mats and the number R which corresponds to the number of address comparing means satisfy a relation L<R<LM/m.
Claim 10
Dependent Claim
211 words
A semiconductor memory including: a memory array which has a plurality of word lines, a plurality of bit liens arranged so that two-level crossings are formed between the word lines and the bit lines, memory cells disposed at desired ones of the two-level crossings, and a plurality of spare bit lines; a plurality of address comparing means for storing therein defective bit line addresses existing in the memory array, respectively, so as to compare each address to be accessed with the stored addresses; means for replacing a defective bit line by a spare bit line in accordance with an output of a respective one of said plurality of address comparing means; and wherein said semiconductor memory is characterized in that: the memory array is divided into M memory mats, where M is an integer and M≧2, the number m of memory mats in which bit lines thereof are respectively simultaneously replaced by spare bit lines is less than the number M and is equal to a divisor of the number M, and the number L which corresponds to the number of logically independent spare bit lines in each one of said M memory mats and the number R which corresponds to the number of address comparing means satisfy a relation L<R<LM/m.
Claim 11
Dependent Claim
47 words
A semiconductor memory according to claim 8, wherein a spare bit line is activated in accordance with the output of one of said plurality of address comparing means indicative of a logical correspondence between the bit line being accessed and the defective bit line address stored therein.
Claim 12
Dependent Claim
79 words
A semiconductor memory according to claim 8, wherein R address comparing means are divided into L groups and each one of said L groups is coupled to a respective one of L means each one effecting a logical sum of the outputs of R/L address comparing means, and wherein L signals, outputted from said L means and indicative of a logical sum at each of said L groups, are used for selecting spare bit lines in each memory mat.
Claim 13
Dependent Claim
24 words
A semiconductor memory according to claim 10, wherein each one of said L means for effecting a logical sum includes a logical OR circuit.
Claim 14
Dependent Claim
37 words
A semiconductor memory according to claim 8, wherein said semiconductor memory is used in a microcomputer whereby access of the memory is effected via a bus, and wherein the microcomputer and memory are formed on one chip.
References Cited (Backward Citations)
US4389715A
Cited
US4727516A
Cited
US4648075A
Cited
JPS60130139A
Cited
US4675895A
Cited
US4837747A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-11-22 | 1997-05-24 | 1997-11-23 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-11-22 | 2001-05-24 | 2001-11-23 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-11-22 | 2005-05-24 | 2005-11-23 | $7700.00 | Window Closed / Lapsed |