Three-dimensional memory array and method for storing data...

Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

06591394

ABSTRACT:

BACKGROUND
Conventional memory design assumes that high-speed read access is an important goal. Accordingly, conventional two-dimensional semiconductor memories, such as DRAMs, SRAMs, ROMs, EEPROMs, and Flash memories, are designed to maximize speed. These memories achieve fast access time at the expense of large chip area and high chip cost. To increase circuit performance, some conventional memory devices store data bits and error checking and correcting (ECC) bits near each other to reduce the portions of the memory device that are activated. By localizing the data bits and ECC bits within a region of the memory device, more than one bit is retrieved from a single activated row line, thereby reducing the power consumed by a memory cycle. While localizing data bits and ECC bits within a region of the memory device can increase circuit performance, such a data distribution scheme can result in non-correctable memory errors. Most ECC circuitry is capable of correcting only single-bit errors within a given word. For example, with a Hamming (72, 64) code scheme, only a single-bit error in 72 bits of stored data can be corrected. Storing data bits and ECC code bits in physically-contiguous regions of the memory array increases the probability that a media defect will affect more than a single bit in any data word, thereby increasing the probability of a non-correctable error.
In contrast to conventional memory arrays, three-dimensional memory arrays, such as those described in U.S. Pat. No. 6,034,882 to Johnson, provide important economies in terms of reduced size and associated reductions in manufacturing cost. Manufacturing defects or age-related fatigue of such high bit-density memory devices can raise the probability of bit errors. Accordingly, the disadvantages associated with storing data bits and ECC code bits in physically-contiguous regions of the memory array can be more exaggerated in three-dimensional memory arrays as compared to conventional memory arrays.
SUMMARY
The present invention is defined by the following claims, and nothing in this section should be taken as a limitation on those claims.
By way of introduction, the preferred embodiments described below provide a three-dimensional memory array and method for storing data bits and ECC bits therein. In one preferred embodiment, a three-dimensional memory array of the type that includes multiple vertically-stacked layers of memory cells is provided. The three-dimensional memory array comprises a plurality of memory cells arranged in a plurality of physically-independent sub-arrays, and data bits and error checking and correcting (ECC) bits of a word are stored in respective ones of the physically-independent sub-arrays. By spatially diffusing data bits and ECC bits from a word, the likelihood of multiple-bit errors within the word is reduced. This is advantageous since most ECC circuitry is capable of correcting only single-bit errors within a given word. Other preferred embodiments are disclosed.
The preferred embodiments will now be described with reference to the attached drawings.


REFERENCES:
patent: 4646266 (1987-02-01), Ovshinsky et al.
patent: 5065389 (1991-11-01), Roth
patent: 5119291 (1992-06-01), Flannagan et al.
patent: 5313425 (1994-05-01), Lee et al.
patent: 5321824 (1994-06-01), Burke et al.
patent: 5432729 (1995-07-01), Carson et al.
patent: 5448728 (1995-09-01), Takano et al.
patent: 5469450 (1995-11-01), Cho et al.
patent: 5469451 (1995-11-01), Henmi
patent: 5559732 (1996-09-01), Birge
patent: 5559778 (1996-09-01), Inokuchi et al.
patent: 5708667 (1998-01-01), Hayashi
patent: 5761741 (1998-06-01), Robbins et al.
patent: 5784391 (1998-07-01), Konigsburg
patent: 5796694 (1998-08-01), Shirane
patent: 5835396 (1998-11-01), Zhang
patent: 5835509 (1998-11-01), Sako et al.
patent: 5915167 (1999-06-01), Leedy
patent: 5943254 (1999-08-01), Bakeman, Jr. et al.
patent: 6016269 (2000-01-01), Peterson et al.
patent: 6034882 (2000-03-01), Johnson et al.
patent: 6052816 (2000-04-01), Yoshinogawa
patent: 6108236 (2000-08-01), Barnett
patent: 6185122 (2001-02-01), Johnson et al.
patent: 6208545 (2001-03-01), Leedy
patent: 6216247 (2001-04-01), Creta et al.
patent: 6236587 (2001-05-01), Gudesen et al.
patent: 6321358 (2001-11-01), Anderson
patent: 6321360 (2001-11-01), Takeuchi et al.
patent: 6336175 (2002-01-01), Shaath et al.
patent: 6377526 (2002-04-01), Vining et al.
patent: 6446177 (2002-09-01), Tanaka et al.
patent: 6480463 (2002-11-01), Hunter et al.
patent: 2002/0034105 (2002-03-01), Kulkarni et al.
patent: 0 073 486 (1983-03-01), None
patent: 1 017 100 (2000-07-01), None
patent: WO 99/14763 (1999-03-01), None
Construction techniques for systematic SEC-DED codes with single byte error detection and partial correction capability for computer memory systems; Penzo, L. Sciuto, D. Silvano, C. ;IEEE ; On pp. 584-591; Mar. 1995.*
NN8803151, IBM Technical Disclosure Bulletin, “Incremental Directory Indexes for Write-Once Media”, Mar., 1988, vol. 30, Issue 10, pp. 151-155.
“Jack St. Clair Kilby,” Jones Telecommunications & Multimedia Encyclopedia, http://www.digitalcentury.com/ encyclo/update/kilby.html, 4 pages (1999).
“The ‘Chip’ Inventors (part 1),” Dan Murray, http://www.livingstonmontana.com/access/dan/150thechipinventors-1.html, 3 pages (1999).
T. R. Reid, “The Chip: How Two Americans Invented the Microchip and Launched a Revolution,” pp. 22-23 (1984).
“About Jack” http://www.ti.com/corp/docs/kilbyctr/jackbuilt.shtml, 6 pages (2002).
“Definition: integrated circuit,” http://www.its.bldrdoc.gov/fs-1037/dir-019/_2755.htm, 1 page (1996).
Meindl, “Definitions of Terms for Integrated Electronics,”IEEE Journal of Solid-State Circuits, p. 2 (Mar. 1967).
Muller et al., “Device Electronics for Integrated Circuits,” second edition, pp. 65 and 106 (1986).
“3D-ROM—A First Practical Step Towards 3D-IC,” Zhang, 7 pages, Jul. 2000.
“Reed-Solomon Codes,” http://www.4i2i.com/reed_solomon_codes.htm, 8 pages (1998).
“Three-Dimensional Memory Array and Method of Fabrication,” U.S. patent application Ser. No. 09/560,626, filed Apr. 28, 2000; inventor: Johan Knall.
“Write-Once Memory Array Controller, System, and Method,” U.S. patent application Ser. No. 09/638,427, filed Aug. 14, 2000; inventors: Derek J. Bosch, Christopher S. Moore, Daniel C. Steere, and J. James Tringali.
“Low-Cost Three-Dimensional Memory Array,” U.S. patent application Ser. No. 09/638,428, filed Aug. 14, 2000; inventors: Mark G. Johnson, Thomas H. Lee, Vivek Subramanian, and P. Michael Farmwald.
“Modular Memory Device,” U.S. patent application Ser. No. 09/638,334, filed Aug. 14, 2000; inventors: J. James Tringali, P. Michael Farmwald, Thomas H. Lee, Mark G. Johnson, and Derek J. Bosch.
“Memory Devices and Methods for Use Therewith,” U.S. patent application Ser. No. 09/748,589, filed Dec. 22, 2000; inventors: Roger W. March, Christopher S. Moore, Daniel Brown, Thomas H. Lee, and Mark G. Johnson.
“Computer Engineering: Hardware Design,” M. Morris Mano, Chapter 6-4 Error Detection and Correction, pp. 199-202 (1988).
Jul. 18, 2001 Information Disclosure Statement (2 pages).

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Three-dimensional memory array and method for storing data... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Three-dimensional memory array and method for storing data..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Three-dimensional memory array and method for storing data... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3100229

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.