A method for repairing a main memory comprises the steps of: utilizing a spare memory to repair a main memory, wherein the spare memory includes a plurality of spare memory units; allocating a spare memory unit; determining whether available permutations of the allocated spare memory unit cover a newly found defect in the main memory; removing permutations of the spare memory unit failing to cover newly found defects in the main memory; and allocating another spare memory unit to repair the newly found defects if available permutations of the allocated spare memory unit fails to cover the newly found defects.
Legal claims defining the scope of protection, as filed with the USPTO.
1. A method for repairing a main memory, comprising the steps of: utilizing a spare memory to repair the main memory, wherein the spare memory includes a plurality of spare memory units, wherein each spare memory unit in said plurality of spare memory units has a plurality of permutations, wherein each permutation has a reparable capacity; determining a shape of a newly found defect in the main memory, wherein said newly found defect has a defective data address; allocating a first spare memory unit; determining a first permutation in the first spare memory unit, wherein the first permutation has a reparable capacity sufficient to cover said defective data address; wherein said first permutation, a corresponding spare memory address, and a covered defective data address are neither an entire row nor an entire column at a same time; and allocating a second spare memory unit to repair the newly found defect if available permutation in the first spare memory unit fail to cover the defective data address of the newly found defect.
2. The method of claim 1 , wherein the newly found defect and a previously-found defect constitute an intersection address, and said method further comprising the step of comparing the intersection address with the permutations of the first spare memory unit.
3. The method of claim 2 , further comprising the step of selecting a permutation closest to the intersection address.
4. The method of claim 1 , wherein the permutations of the first spare memory unit are recorded by marking a plurality of flags.
5. The method of claim 1 , further comprising the step of displaying a message of failure to repair if a defect of the main memory exceed a maximal reparable capacity of the spare memory.
6. The method of claim 1 , wherein the method is applied to a built-in self-test circuit, wherein the built-in self-test circuit includes a spare memory which is built inside the main memory or separate from the main memory.
7. The method of claim 1 , which uses an off-line software and an external spare memory to repair the main memory.
8. A method for repairing a main memory, comprising the steps of: utilizing a spare memory to repair the main memory, wherein the spare memory includes a plurality of spare memory units, wherein the main memory has at least one defective permutation, and wherein said spare memory units have a plurality of available permutations; comparing the defective permutations of the main memory with available permutations in an allocated spare memory unit; excluding available permutation which fail to cover defective permutations of the main memory; and utilizing remaining available permutations to repair the main memory; wherein the available permutations in the spare memory unit sufficient to cover defective permutations in the main memory, a corresponding spare memory address, and a covered permutations in the main memory are neither an entire row nor an entire column at a same time.
9. The method of claim 8 , wherein newly found defects and previously found defects constitute a new permutation, and the method further comprising the step of comparing the new permutation with available permutations of the spare memory unit.
10. The method of claim 8 , wherein the available permutations of the spare memory unit are recorded by marking a plurality of flags.
11. The method of claim 8 , further comprising the step of displaying a message of failure to repair if a defect of the main memory exceed the maximal reparable capacity of the spare memory unit.
12. The method of claim 8 , wherein the method is applied to a built-in self-test circuit, wherein the built-in self-test circuit includes a spare memory which is built inside the main memory or separate from the main memory.
13. The method of claim 8 , wherein the method uses an off-line software and an external spare memory to repair the main memory.
14. A system for repairing memory, comprising: a spare memory configured to provide a plurality of spare memory units; a built-in self-test circuit connected to the memory and spare memory for testing defects of the memory and corresponding addresses of the defects; a built-in self-repair circuit connected to the spare memory for allocating spare memory units in accordance with addresses of defects provided by the built-in self-test circuit; and a spare memory redundancy analysis table configured to record available permutations in the spare memory sufficient to cover the defects of the memory; wherein the available permutations in the spare memory for the defects in the memory, a corresponding spare memory address, and a covered main memory address are neither an entire row nor an entire column at a same time.
15. The system of claim 14 , wherein the spare memory redundancy analysis table is allocated in the built-in self-repair circuit.
16. The system of claim 14 , wherein the spare memory redundancy analysis table is provided by an off-line software.
17. The system of claim 14 , wherein the spare memory redundancy analysis table further records addresses of the defects.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
July 7, 2008
January 10, 2012
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.