US5621682A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Memory system
Assignee: Toshiba Corp
•
Filing: 1994-12-28
•
Granted: 1997-04-15
•
Expires: 2014-12-28
Abstract
Abstract According to the present invention, a memory system comprises storing section having a plurality of memory elements each of which stores one of n-value storage states corresponding to data "0", "1", . . . , "n-1", and including a plurality of information memory elements for storing n-value information data and a plurality of check memory elements for storing check data, converting section for respectively converting the information data and the check data stored in the memory elements into binary codes having a plurality of bits each constituted by 0 or 1, the binary codes corresponding to the information data and the check data, and detecting/correcting section for detecting and correcting an error on the basis of the binary codes corresponding to the check data and the information data.
Inventors
- 👤 Toru Tanzawa
- 👤 Tomoharu Tanaka
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 12:04
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/08; G06F11/10; G06F11/1008; G06F11/1072; G11; G11C; G11C11/00; G11C11/56; G11C11/5621; G11C16/00; G11C16/02; G11C16/04; G11C16/0483; G11C2211/00; G11C2211/56; G11C2211/564; G11C2211/5641; G11C29/00
Claims Analysis
Total Claims: 45
Claim 1
Independent Claim
127 words
A memory system comprising: storing means having a plurality of memory elements each of which stores one of n-value storage states corresponding to data "0", "1", . . . , "n-1", said storing means including a plurality of information memory elements for storing n-value information data and a plurality of check memory elements for storing check data; converting means for respectively converting the information data and the check data stored in said plurality of memory elements into binary codes having a plurality of bits each constituted by 0 or 1, the binary codes corresponding to the information data and the check data; and detecting/correcting means for detecting and correcting an error on the basis of said binary codes corresponding to the check data and the information data.
Claim 2
Dependent Claim
127 words
A memory system comprising: storing means having a plurality of memory elements each of which stores one of n-value storage states corresponding to data "0", "1", . . . , "n-1", said storing means including a plurality of information memory elements for storing n-value information data and a plurality of check memory elements for storing check data; converting means for respectively converting the information data and the check data stored in said plurality of memory elements into binary codes having a plurality of bits each constituted by 0 or 1, the binary codes corresponding to the information data and the check data; and detecting/correcting means for detecting and correcting an error on the basis of said binary codes corresponding to the check data and the information data.
Claim 3
Dependent Claim
47 words
A system according to claim 1, wherein said converting means includes means for converting the information data and check data into binary codes including intermediate binary codes which are combinations of binary codes each of which data is stored in one of said plurality of memory elements.
Claim 4
Dependent Claim
23 words
A system according to claim 1, wherein said storing means stores the n-value information data by combinations of said plurality of memory elements.
Claim 5
Dependent Claim
62 words
A system according to claim 1, wherein said information memory element includes a second converting means for causing said check memory element to generate a binary code corresponding to data to be stored in one of said plurality of memory elements, and writing means for causing said plurality of memory elements to perform n-value storage on the basis of the binary code.
Claim 6
Dependent Claim
77 words
A system according to claim 1, wherein said converting means includes means for converting storage data of a memory element into a binary code having a plurality of bits each constituted by 0 or 1, and said detecting/correcting means includes means for detecting/correcting an error on the basis of information data and check data and outputting a data code represented by combinations of data of said plurality of memory elements on the basis of the binary code.
Claim 7
Dependent Claim
74 words
A system according to claim 5, further comprising means for generating a binary code corresponding to data to be stored in said plurality of said check memory elements on the basis of the binary code converted from the data code and corresponding to data to be stored in said plurality of said information memory elements to cause said plurality of information memory elements to perform n-value storage on the basis of the binary code.
Claim 8
Dependent Claim
60 words
A system according to claim 1, wherein said converting means includes means for converting data such that, when a size of data in said plurality of memory elements changes by one, a binary code of the data has a Hamming distance of 1, for that of the data whose size in said plurality of memory elements is different by one.
Claim 9
Dependent Claim
46 words
A system according to claim 1, wherein said plurality of memory elements perform n-value storage using charge amounts stored in said plurality of memory elements and correspond to n data "0", "1", . . . , "n-1" in an order of magnitudes of the charge amounts.
Claim 10
Dependent Claim
34 words
A system according to claim 1, wherein said plurality of memory elements is a nonvolatile memory cell obtained by stacking and forming a charge storage layer and a control gate on a semiconductor layer.
Claim 11
Dependent Claim
20 words
A system according to claim 1, wherein a storage state of said plurality of memory elements is changed by one.
Claim 12
Dependent Claim
50 words
A system according to claim 1, wherein said storing means stores n-bit (2 n <N M <2 n+1 ) information having a relation n<2 M using combinations of said M (M: an integer of not less than 2) and N-value (N: an integer of not less than 3) memory elements.
Claim 13
Dependent Claim
110 words
A memory system comprising: an EEPROM including a plurality of first memory cells each of which stores information data selected from at least three storage states and a plurality of second memory cells each of which stores check data selected from at least three storage states; a converter for converting the information data stored in said first memory cells and check data stored in said second memory cells into binary codes, respectively, each of said binary codes having a plurality of bits each constituted by 0 or 1; detecting/correcting means for detecting and correcting an error by using the converted binary codes of the information data and the check data.
Claim 14
Dependent Claim
110 words
A memory system comprising: an EEPROM including a plurality of first memory cells each of which stores information data selected from at least three storage states and a plurality of second memory cells each of which stores check data selected from at least three storage states; a converter for converting the information data stored in said first memory cells and check data stored in said second memory cells into binary codes, respectively, each of said binary codes having a plurality of bits each constituted by 0 or 1; detecting/correcting means for detecting and correcting an error by using the converted binary codes of the information data and the check data.
Claim 15
Dependent Claim
40 words
A memory system according to claim 12, wherein said binary codes including intermediate binary code and said detecting/correcting means for detecting and correcting an error by using the converted intermediate binary codes of the information data and the check data.
Claim 16
Dependent Claim
96 words
A memory system comprising: memory cells each of which stores one of N-levels, where N is an integer of not less than 3; inverting means for inverting M-sets of an intermediate binary code into data composed of n-bits, where M is an integer of not less than 2 and n is an integer satisfied with a relation of 2 n <N M <2 n+1 , and there is one to one correspondence between the intermediate binary code and the N-levels; and reading means for reading the M-sets of an intermediate binary code from N memory cells.
Claim 17
Dependent Claim
96 words
A memory system comprising: memory cells each of which stores one of N-levels, where N is an integer of not less than 3; inverting means for inverting M-sets of an intermediate binary code into data composed of n-bits, where M is an integer of not less than 2 and n is an integer satisfied with a relation of 2 n <N M <2 n+1 , and there is one to one correspondence between the intermediate binary code and the N-levels; and reading means for reading the M-sets of an intermediate binary code from N memory cells.
Claim 18
Dependent Claim
39 words
A system according to claim 14, wherein said N-levels correspond to said intermediate binary code such that the difference between the intermediate binary code corresponding to one level and that corresponding to the neighboring level is only one digit.
Claim 19
Dependent Claim
17 words
A system according to claim 15, wherein said level is given by a magnitude of charge amounts.
Claim 20
Dependent Claim
27 words
A system according to claim 16, wherein said memory cell is obtained by stacking and forming a charge storage layer and control gate on a semiconductor layer.
Claim 21
Dependent Claim
17 words
A system according to claim 14, wherein N is 3, M is 2 and n is 3.
Claim 22
Dependent Claim
41 words
A system according to claim 14, comprising: converting means for converting the information data into binary codes including intermediate binary codes which are combinations of binary codes each of which data is stored in one of said plurality of memory cells.
Claim 23
Dependent Claim
23 words
A system according to claim 14, wherein said storing means stores the n-value information data by combinations of said plurality of memory cells.
Claim 24
Dependent Claim
67 words
A system according to claim 14, wherein said memory cells include information memory cells and check memory cells, comprising: converting means for causing said check memory cells to generate a binary code corresponding to data to be stored in one of said plurality of memory cells, and writing means for causing said plurality of memory cells to perform n-value storage on the basis of the binary code.
Claim 25
Dependent Claim
57 words
A system according to claim 14, comprising: converting means for converting data such that, when a size of data in said plurality of memory cells changes by one, a binary code of the data has a Hamming distance of 1, for that of the data whose size in said plurality of memory cells is different by one.
Claim 26
Dependent Claim
46 words
A system according to claim 14, wherein said plurality of memory cells perform n-value storage using charge amounts stored in said plurality of memory cells and correspond to n data "0", "1", . . . , "n-1" in an order of magnitudes of the charge amounts.
Claim 27
Dependent Claim
33 words
A system according to claim 14, wherein said plurality of memory cells are nonvolatile memory cells obtained by stacking and forcing a charge storage layer and a control gate on a semiconductor layer.
Claim 28
Dependent Claim
20 words
A system according to claim 14, wherein a storage state of said plurality of memory cells is changed by one.
Claim 29
Dependent Claim
50 words
A system according to claim 14, wherein said memory cells store n-bit (2 n <N M <2 n+1 ) information having a relation n<2 M using combinations of said M (M: an integer of not less than 2) and N-value (N: an integer of not less than 3) memory cells.
Claim 30
Dependent Claim
29 words
A system according to claim 14, further comprising error checking and correcting means for checking and correcting data composed of one or plural sets of an intermediate binary code.
Claim 31
Dependent Claim
39 words
A system according to claim 27, wherein said N-levels correspond to said intermediate binary code such that the difference between the intermediate binary code corresponding to one level and that corresponding to a neighboring level is only one digit.
Claim 32
Dependent Claim
17 words
A system according to claim 28, wherein said level is given by a magnitude of charge amounts.
Claim 33
Dependent Claim
27 words
A system according to claim 29, wherein said memory cells are obtained by stacking and forming a charge storage layer and control gate on a semiconductor layer.
Claim 34
Dependent Claim
17 words
A system according to claim 27, wherein N is 3, M is 2 and n is 3.
Claim 35
Dependent Claim
84 words
A system according to claim 14, further comprising: converting means for converting data composed of three bits into two sets of an intermediate binary code, in which there is one to one correspondence between the intermediate binary code and the levels; check data generating means for generating check data from data composed of one or plural sets of an intermediate binary code; and error checking and correcting means for checking and correcting data composed of one or plural sets of the intermediate binary code.
Claim 36
Dependent Claim
39 words
A system according to claim 32, wherein said N-levels correspond to said intermediate binary code such that the difference between the intermediate binary code corresponding to one level and that corresponding to the neighboring level is only one digit.
Claim 37
Dependent Claim
17 words
A system according to claim 33, wherein said level is given by a magnitude of charge amounts.
Claim 38
Dependent Claim
27 words
A system according to claim 34, wherein said memory cells are obtained by stacking and forming a charge storage layer and control gate on a semiconductor layer.
Claim 39
Dependent Claim
17 words
A system according to claim 32, wherein N is 3, M is 2 and n is 3.
Claim 40
Dependent Claim
128 words
A memory system comprising: memory cells each of which stores one of N-levels, where N is an integer of not less than 3; converting means for converting data composed of n-bits into M-sets of an intermediate binary code, where M is an integer of not less than 2 and n is an integer satisfied with a relation of 2 n <N M <2 n+1 , and there is one to one correspondence between the intermediate binary code and the N-levels; writing means for writing the M-sets of an intermediate binary code into M memory cells; reading means for reading the M-sets of an intermediate binary code into M memory cells; and inverting means for inverting the M-sets of an intermediate binary code into the data composed of n-bits.
Claim 41
Dependent Claim
128 words
A memory system comprising: memory cells each of which stores one of N-levels, where N is an integer of not less than 3; converting means for converting data composed of n-bits into M-sets of an intermediate binary code, where M is an integer of not less than 2 and n is an integer satisfied with a relation of 2 n <N M <2 n+1 , and there is one to one correspondence between the intermediate binary code and the N-levels; writing means for writing the M-sets of an intermediate binary code into M memory cells; reading means for reading the M-sets of an intermediate binary code into M memory cells; and inverting means for inverting the M-sets of an intermediate binary code into the data composed of n-bits.
Claim 42
Dependent Claim
39 words
A system according to claim 37, wherein said N-levels correspond to said intermediate binary code such that the difference between the intermediate binary code corresponding to one level and that corresponding to the neighboring level is only one digit.
Claim 43
Dependent Claim
17 words
A system according to claim 38, wherein said level is given by a magnitude of charge amounts.
Claim 44
Dependent Claim
27 words
A system according to claim 39, wherein said memory cells are obtained by stacking and forming a charge storage layer and control gate on a semiconductor layer.
Claim 45
Dependent Claim
17 words
A system according to claim 37, wherein N is 3, M is 2 and n is 3.
References Cited (Backward Citations)
US4959812A
Cited
US5043940A
Cited
US5268870A
Cited
US5424898A
Cited
JPH0560199A
Cited
US5450363A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-04-14 | 2000-10-14 | 2001-04-15 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-04-14 | 2004-10-14 | 2005-04-15 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-04-14 | 2008-10-14 | 2009-04-15 | $7700.00 | Window Closed / Lapsed |