US20180122494A1 - Raid decoding architecture with reduced bandwidth - Google Patents
Raid decoding architecture with reduced bandwidth Download PDFInfo
- Publication number
- US20180122494A1 US20180122494A1 US15/859,716 US201815859716A US2018122494A1 US 20180122494 A1 US20180122494 A1 US 20180122494A1 US 201815859716 A US201815859716 A US 201815859716A US 2018122494 A1 US2018122494 A1 US 2018122494A1
- Authority
- US
- United States
- Prior art keywords
- codeword
- raid
- decoder
- syndrome
- parity data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Images
Classifications
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11C—STATIC STORES
- G11C29/00—Checking stores for correct operation ; Subsequent repair; Testing stores during standby or offline operation
- G11C29/04—Detection or location of defective memory elements, e.g. cell constructio details, timing of test signals
- G11C29/08—Functional testing, e.g. testing during refresh, power-on self testing [POST] or distributed testing
- G11C29/12—Built-in arrangements for testing, e.g. built-in self testing [BIST] or interconnection details
- G11C29/38—Response verification devices
- G11C29/42—Response verification devices using error correcting codes [ECC] or parity check
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/08—Error detection or correction by redundancy in data representation, e.g. by using checking codes
- G06F11/10—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
- G06F11/1076—Parity data used in redundant arrays of independent storages, e.g. in RAID systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/22—Detection or location of defective computer hardware by testing during standby operation or during idle time, e.g. start-up testing
- G06F11/26—Functional testing
- G06F11/27—Built-in tests
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11C—STATIC STORES
- G11C29/00—Checking stores for correct operation ; Subsequent repair; Testing stores during standby or offline operation
- G11C29/04—Detection or location of defective memory elements, e.g. cell constructio details, timing of test signals
- G11C29/08—Functional testing, e.g. testing during refresh, power-on self testing [POST] or distributed testing
- G11C29/12—Built-in arrangements for testing, e.g. built-in self testing [BIST] or interconnection details
- G11C29/44—Indication or identification of errors, e.g. for repair
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/13—Linear codes
- H03M13/15—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes
- H03M13/151—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes using error location or error correction polynomials
- H03M13/1515—Reed-Solomon codes
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/29—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
- H03M13/2906—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes using block codes
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11C—STATIC STORES
- G11C29/00—Checking stores for correct operation ; Subsequent repair; Testing stores during standby or offline operation
- G11C29/04—Detection or location of defective memory elements, e.g. cell constructio details, timing of test signals
- G11C2029/0411—Online error correction
Abstract
A RAID decoding system which performs a Built in Self-Test (BIST) includes: a RAID decoder, including: a storage, for storing a syndrome of a first Reed-Solomon (RS) codeword, a syndrome of a second RS codeword, and parity data of the first RS codeword and the second RS codeword; and an RS decoder which performs decoding on the first RS codeword and the second RS codeword according to the parity data to generate an updated syndrome of the first RS codeword and an updated syndrome of the second RS codeword. A MUX inputs the first and the second RS codeword to the RS decoder in a first iteration, and inputs the parity data to the RS decoder in following iterations for updating the syndromes of the first and the second RS codeword. The updated syndromes are used to perform error correction on the first RS codeword and the second RS codeword.
Description
- This application is a continuation application of U.S. patent application Ser. No. 15/073,665, which was filed on Mar. 18, 2016, the contents of which are included herein by reference.
- The present invention relates to error correcting code (ECC) technology, and more particularly, to a RAID ECC with a reduced bandwidth.
- Flash memory is a high performance, low power, non-volatile storage often used in portable devices. A disadvantage of Flash memory is that the cells slowly deteriorate over time meaning the accuracy of a held charge will also decrease. At some point, errors associated with the held charge cannot be corrected, and the cell becomes unusable.
- Error Correcting Code (ECC) technology can extend the lifetime of a cell by locating and correcting errors associated with the held charges. One example of an ECC code is low-density parity check (LDPC) decoding, which is a powerful form of ECC technology. Even LDPC codes, however, have a certain probability of failing at a particular Raw Error Bit rate. In cases where a valid codeword cannot be found via LDPC coding, secondary ECC solutions can be provided which detect/correct errors that cannot be remedied by LDPC alone. One example is an encoding RAID check.
- RAID is a virtual architecture which combines multiple disk drive components into a single logical unit. By striping codes across multiple disks, mirroring codes in a single disk to generate codes in another disk, and including parity symbols, valid codewords can be retrieved. RAID level 6 uses Reed-Solomon (RS) codes, each code consisting of 2-byte symbols. Data is written to multiple drives with double distributed parity, i.e. two parity blocks are distributed across all member disks. If an LDPC decoder cannot recover a valid codeword, the RAID parity can be used as the secondary ECC.
- Data is RAID encoded by being segmented into many chunks and having RAID parity (Reed-Solomon codes) added. The RAID data is then input to an LDPC encoder, and stored in a Flash memory, from where it can be output to an LDPC decoder. After LDPC decoding, if a codeword fails (i.e. LDPC ECC is insufficient to recover correct data), RAID decoding is performed by inputting the non-valid codeword into a RAID engine, and inputting the RAID parity data to generate a syndrome. After a certain number of iterations, the syndrome should satisfy the matrix equations, i.e. it should equal zero. At this point, the original data can be recovered via the updated syndrome.
- The drawbacks to the above method are that the RAID engine needs to be able to store an entire codeword, and that parity data of 64 bits (corresponding to four RS symbols) must be inputted to the RAID decoder in each iteration, which occupies a large bandwidth.
- It is therefore an aim of the present invention to provide a Built in Self-Test (BIST) which can save on the bandwidth and storage space required for a RAID decoding engine.
- The present invention therefore provides a RAID decoding system which performs a Built in Self-Test (BIST), the RAID decoding system comprising: a RAID decoder, comprising: a storage, for storing a syndrome of a first Reed-Solomon (RS) codeword, a syndrome of a second RS codeword, parity data of the first RS codeword and parity data of the second RS codeword; and an RS decoder which stores the first RS codeword and the second RS codeword, and performs decoding on the first RS codeword and the second RS codeword according to the parity data to generate an updated syndrome of the first RS codeword and an updated syndrome of the second RS codeword. The RAID decoding system further comprises a MUX, coupled between the storage and the RS decoder, for inputting the first RS codeword and the second RS codeword to the RS decoder in a first iteration, and for inputting the parity data of the first RS codeword and the parity data of the second codeword to the RS decoder in following iterations for respectively updating the syndrome of the first RS codeword and the syndrome of the second RS codeword. The updated syndrome of the first RS codeword and the updated syndrome of the second RS codeword are used to perform error correction on the first RS codeword and the second RS codeword. The updated syndromes of the first RS codeword and the updated syndrome of the second RS codeword are used to perform error correction on the first RS codeword and the second RS codeword when the updated syndrome of the first RS codeword and the updated syndrome of the second RS codeword both equal zero.
- The RS decoder comprises: a first RS decoder for storing the first RS codeword and for performing decoding on the first RS codeword according to the parity data to generate an updated syndrome of the first RS codeword; and a second RS decoder for storing the second RS codeword and for performing decoding on the second RS codeword according to the parity data to generate an updated syndrome of the second RS codeword.
- The RAID decoding system further comprises: an Error Insertion block for inserting errors into a first Reed-Solomon (RS) codeword and a second RS codeword; a Random Number Generator, for generating data to the Error Insertion block; a SEED pool, coupled between the Error Insertion block and the Random Number Generator, for storing values corresponding to the first RS codeword and the second RS codeword with errors inserted, and using those values to control the Random Number Generator to generate the first RS codeword with errors inserted and the second RS codeword with errors inserted when the updated syndrome of the first RS codeword and the updated syndrome of the second RS codeword both equal zero; and a Result Check block, coupled to the Random Number Generator and the RAID decoder, for receiving the first RS codeword with errors inserted and the second RS codeword with errors inserted and the error-corrected first RS codeword and the error-corrected second RS codeword, and determining correctness of the data.
- In an embodiment of the present invention, the second RS codeword is a mirror of the first RS codeword so that parity data of the first RS codeword is equal to the parity data of the second RS codeword, and the storage only stores the parity data of one of the first RS codeword and the second RS codeword, and further stores one of the first RS codeword with errors and the second RS codeword with errors. The MUX inputs the parity data of the first RS codeword and the parity data of the second codeword to the first RS decoder and second RS decoder by mirroring the parity data stored in the storage.
- These and other objectives of the present invention will no doubt become obvious to those of ordinary skill in the art after reading the following detailed description of the preferred embodiment that is illustrated in the various figures and drawings.
-
FIG. 1 is a diagram of a RAID encoding system according to the related art. -
FIG. 2 is a diagram of a RAID decoding system according to a first embodiment of the present invention. -
FIG. 3 is a diagram of a RAID decoder of the RAID decoding system shown inFIG. 2 . -
FIG. 4 is a diagram of the RAID decoding system shown inFIG. 2 performing a result check operation. -
FIG. 5 is a diagram of a RAID decoding system according to a second embodiment of the present invention. -
FIG. 6 is a diagram of a RAID decoder of the RAID decoding system shown inFIG. 5 . - The invention provides two embodiments for providing a functional BIST which can perform RAID decoding with a decreased bandwidth as compared to the prior arts.
- As detailed in the background, during RAID encoding, data is segmented into chunks and RAID parity is added using Reed-Solomon codes. This is illustrated in
FIG. 1 , which shows a RAID encoding system 100. The system 100 consists of aRandom Number Generator 110 and aRAID encoder 150. In RAID 6, a bandwidth of four RS symbols is used for the encoding, wherein each RS symbol is 2 bytes of data. Therefore, each chunk is coded using 64 bits of data. The data is generated by the RandomNumber Generator 110, which generates 32 bits of striped data that is then mirrored to create the four RS symbols. These 64 bits of data are then input to theRAID encoder 150 to generate the parity data. As the 64 bits of data are generated by mirroring 32 bits of originally generated data, the parity data can also be generated by mirroring. - A Built-In Self-Test (BIST) enables a system to calibrate its decoding engine by determining that error correction is performed accurately. In a standard BIST, errors are deliberately inserted into the data generated by the Random Number Generator. After decoding is performed, the resultant data can be examined to determine whether the error-free codeword can be recovered, as the exact location and value of the errors is known.
- In a prior art BIST, codewords with errors are input and stored in a RAID decoder. Parity data is input to the RAID decoding engine from outside to generate and update syndromes of the codewords, which can then be used to correct the data. The RAID decoding engine therefore needs to store both the corrected codeword and the original codeword with errors. The aim of the embodiments of the present invention is to reduce the bandwidth and required storage of the BIST.
-
FIG. 2 illustrates aRAID decoding system 200 according to a first exemplary embodiment of the invention. TheRAID decoding system 200 comprises aRandom Number Generator 210, anError Insertion block 220, aSEED pool 230, and aRAID decoder 250. TheRAID decoder 250 comprises four Reed-Solomon decoding engines 241-244, and astorage 245. When theRandom Number Generator 210 generates data, errors will be deliberately inserted by theError Insertion block 220. This codeword with errors will be input to theRAID decoder 250, and also input to theSEED pool 230, which stores data values identifying each block of the codeword so that the codeword with errors can be recovered later. As in the prior art, theRandom Number Generator 220 generates 32 bits of data, but the data will not be mirrored. Only the 32 bits generated by theRandom Number Generator 210 and corresponding to two Reed-Solomon codewords are input to theRAID decoder 250. - As only half the data is input to the
RAID decoder 250, only half of the RS decoding engines 241-244 need to be used. In this embodiment,RS decoding engines storage 245 only needs to store syndromes corresponding to two codewords, the parity data needed to decode the codewords can be stored in the remaining space of thestorage 245. It is noted that only half the parity data as compared to the prior art is required because no mirroring has occurred. - As illustrated in
FIG. 3 , the codeword with errors is initially input to the two Reed-Solomon decoding engines RAID decoder 250, with the output being sent to thestorage 245 for updating a syndrome respectively corresponding to each codeword. In a second iteration, the syndrome and the parity data of the two codewords is input to theRS decoding engines MUX 247. The parity data and updated syndromes are re-input for a number of iterations until the syndrome is equal to zero. At this point, a result check can take place. -
FIG. 4 illustrates the result check. TheSEED pool 230 is used to recover the original codewords with errors, by controlling theRandom Number Generator 210 tooutput 32 bits of data corresponding to the two codewords. TheRAID decoder 250 outputs the final updated syndromes of the two codewords and both the original codewords with errors and the final updated syndromes are sent to aResult Check block 260, where the final updated syndromes are used to correct the codewords. As the values and locations of the errors are known, it can be determined whether theRAID decoding system 200 has been able to recover the original codeword. - As well as the above-described embodiment, the present invention provides a second exemplary embodiment which can reduce the bandwidth and simplify the decoding procedure even more.
- A
RAID decoding system 500 according to the second embodiment is illustrated inFIG. 5 . TheRAID decoding system 500 comprises a Random.Number Generator 510, anError Insertion block 520 and aRAID decoder 550. TheRAID decoder 550 comprises four RS decoding engines 541-544, and astorage 545. In this embodiment, theRandom Number Generator 510 only outputs 16 bits, which are then mirrored to create 32 bits of data, or two codewords. The two codewords are input to theError Insertion block 520 and the resultant data is then input to theRAID decoder 550 without being input to a SEED pool. As the 32 bits of data only have one corresponding Reed-Solomon symbol (parity data), only half the storage space used in the first embodiment for storing the parity data is required in this second embodiment. The remaining space is used to directly store one of the codewords with errors. Please note that, as both codewords are identical, this stored codeword is equivalent to both the first and second codeword input, respectively, toRS decoding engines - The decoding process is illustrated in
FIG. 6 . In a first iteration, the input data (codeword with errors) is input to theRS decoding engines RS decoders MUX 547, but the parity is first mirrored before being input. The syndromes are updated accordingly, wherein if both RS decoders are functioning normally, the syndromes should be the same. When the updated syndrome is equal to zero, this indicates that the errors can be corrected, and the final updated syndrome is used to perform ECC on the codewords. - In this embodiment, the
RAID decoder 550 stores both the corrected codewords and the original codeword with errors. Therefore, all these values can be directly output to theResult Check module 260 for confirming that all errors have been located and corrected. - The above invention therefore provides two embodiments of functional BIST for a RAID decoder, wherein the bandwidth is reduced as compared to the prior art, and no external storage is required.
- Those skilled in the art will readily observe that numerous modifications and alterations of the device and method may be made while retaining the teachings of the invention. Accordingly, the above disclosure should be construed as limited only by the metes and bounds of the appended claims.
Claims (9)
1. A RAID decoding system which performs a Built in Self-Test (BIST), the RAID decoding system comprising:
a RAID decoder, comprising:
a storage, for storing a syndrome of a first Reed-Solomon (RS) codeword, a syndrome of a second Reed-Solomon (RS) codeword, parity data of the first RS codeword and parity data of the second RS codeword; and
an RS decoder which stores the first RS codeword and the second RS codeword, and performs decoding on the first RS codeword according to the parity data to generate an updated syndrome of the first RS codeword and performs decoding on the second RS codeword according to the parity data to generate an updated syndrome of the second RS codeword; and
a MUX, coupled between the storage and the RS decoder, for inputting the first RS codeword and the second RS codeword to the RS decoder in a first iteration, and for inputting the parity data of the first RS codeword and the parity data of the second codeword to the RS decoder in following iterations for respectively updating the syndrome of the first RS codeword and the syndrome of the second RS codeword;
wherein the updated syndrome of the first RS codeword and the updated syndrome of the second RS codeword are used to perform error correction on the first RS codeword and the second RS codeword to generate an error-corrected first RS codeword and an error-corrected second RS codeword.
2. The RAID decoding system of claim 1 , wherein the second RS codeword is a mirror of the first RS codeword so that the parity data of the first RS codeword is equal to the parity data of the second RS codeword, and the storage only stores the parity data of one of the first RS codeword and the second RS codeword, and further stores one of the first RS codeword with errors and the second RS codeword with errors.
3. The RAID decoding system of claim 2 , wherein the MUX inputs the parity data of the first RS codeword and the parity data of the second codeword to the RS decoder by mirroring the parity data stored in the storage.
4. The RAID decoding system of claim 2 , further comprising:
a Result Check block, coupled to the RAID decoder, for receiving the one of the first RS codeword with errors inserted and the second RS codeword with errors inserted and the error-corrected first RS codeword and the error-corrected second RS codeword, and determining correctness of the data.
5. The RAID decoding system of claim 1 , wherein the RS decoder comprises:
a first RS decoder for storing the first RS codeword and for performing decoding on the first RS codeword according to the parity data to generate the updated syndrome of the first RS codeword; and
a second RS decoder for storing the second RS codeword and for performing decoding on the second RS codeword according to the parity data to generate the updated syndrome of the second RS codeword.
6. The RAID decoding system of claim 1 , further comprising:
an Error Insertion block for inserting errors into the first RS codeword and the second RS codeword.
7. The RAID decoding system of claim 6 , further comprising:
a Random Number Generator, for generating data to the Error Insertion block; and
a SEED pool, coupled between the Error Insertion block and the Random Number Generator, for storing values corresponding to the first RS codeword with errors inserted and the second RS codeword with errors inserted, and using those values to control the Random Number Generator to generate the first RS codeword with errors inserted and the second RS codeword with errors inserted when the updated syndrome of the first RS codeword and the updated syndrome of the second RS codeword both equal zero.
8. The RAID decoding system of claim 7 , further comprising:
a Result Check block, coupled to the Random Number Generator and the RAID decoder, for receiving the first RS codeword with errors inserted and the second RS codeword with errors inserted and the error-corrected first RS codeword and the error-corrected second RS codeword, and determining correctness of the data.
9. The RAID decoding system of claim 1 , wherein the updated syndrome of the first RS codeword and the updated syndrome of the second RS codeword are used to perform error correction on the first RS codeword and the second RS codeword when the updated syndrome of the first RS codeword and the updated syndrome of the second RS codeword both equal zero.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US15/859,716 US20180122494A1 (en) | 2016-03-18 | 2018-01-01 | Raid decoding architecture with reduced bandwidth |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US15/073,665 US9899104B2 (en) | 2016-03-18 | 2016-03-18 | Raid decoding architecture with reduced bandwidth |
US15/859,716 US20180122494A1 (en) | 2016-03-18 | 2018-01-01 | Raid decoding architecture with reduced bandwidth |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/073,665 Continuation US9899104B2 (en) | 2016-03-18 | 2016-03-18 | Raid decoding architecture with reduced bandwidth |
Publications (1)
Publication Number | Publication Date |
---|---|
US20180122494A1 true US20180122494A1 (en) | 2018-05-03 |
Family
ID=59855972
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/073,665 Active 2036-04-01 US9899104B2 (en) | 2016-03-18 | 2016-03-18 | Raid decoding architecture with reduced bandwidth |
US15/859,716 Abandoned US20180122494A1 (en) | 2016-03-18 | 2018-01-01 | Raid decoding architecture with reduced bandwidth |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/073,665 Active 2036-04-01 US9899104B2 (en) | 2016-03-18 | 2016-03-18 | Raid decoding architecture with reduced bandwidth |
Country Status (3)
Country | Link |
---|---|
US (2) | US9899104B2 (en) |
CN (2) | CN107402860B (en) |
TW (1) | TWI627834B (en) |
Families Citing this family (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10387254B2 (en) * | 2017-10-12 | 2019-08-20 | Samsung Electronics Co, Ltd. | Bose-chaudhuri-hocquenchem (BCH) encoding and decoding tailored for redundant array of inexpensive disks (RAID) |
TWI625735B (en) * | 2017-11-01 | 2018-06-01 | 大心電子股份有限公司 | Memory management method and storage controller |
US11121806B2 (en) * | 2018-09-07 | 2021-09-14 | Qualcomm Incorporated | Decoding performance |
Family Cites Families (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE19725581C2 (en) | 1997-06-17 | 2000-06-08 | Siemens Ag | Method for checking the function of memory cells of an integrated memory |
KR100265949B1 (en) * | 1997-12-19 | 2000-09-15 | 강상훈 | METHOD FOR DESIGNING Nú½Ñ‡ NUMBER OF FIFO OF REED-SOLOMON DECODER |
US7571372B1 (en) * | 2005-06-23 | 2009-08-04 | Marvell International Ltd. | Methods and algorithms for joint channel-code decoding of linear block codes |
US7930586B1 (en) * | 2008-02-07 | 2011-04-19 | At&T Intellectual Property Ii, L.P. | Error rate reduction for memory arrays |
CN101309086A (en) * | 2008-06-27 | 2008-11-19 | 东南大学 | Systematical interpretation method of Reed-Solomon code cascade feedback systematic convolution code |
KR101623119B1 (en) * | 2010-02-01 | 2016-05-20 | 삼성전자주식회사 | Error control method of solid state drive |
US20110258520A1 (en) * | 2010-04-16 | 2011-10-20 | Segura Theresa L | Locating and correcting corrupt data or syndrome blocks |
US8522122B2 (en) * | 2011-01-29 | 2013-08-27 | International Business Machines Corporation | Correcting memory device and memory channel failures in the presence of known memory device failures |
US8914687B2 (en) * | 2011-04-15 | 2014-12-16 | Advanced Micro Devices, Inc. | Providing test coverage of integrated ECC logic en embedded memory |
US8954825B2 (en) * | 2012-03-06 | 2015-02-10 | Micron Technology, Inc. | Apparatuses and methods including error correction code organization |
WO2014003599A1 (en) * | 2012-06-29 | 2014-01-03 | Ems Corparation | Redundant disc encoding via erasure decoding |
KR101255265B1 (en) * | 2012-08-13 | 2013-04-15 | 주식회사 유니테스트 | Apparatus for error generating in solid state drive tester |
CN104052576B (en) * | 2014-06-07 | 2017-05-10 | 华中科技大学 | Data recovery method based on error correcting codes in cloud storage |
-
2016
- 2016-03-18 US US15/073,665 patent/US9899104B2/en active Active
-
2017
- 2017-01-03 TW TW106100009A patent/TWI627834B/en active
- 2017-03-08 CN CN201710136379.2A patent/CN107402860B/en active Active
- 2017-03-08 CN CN202011105319.2A patent/CN112346903B/en active Active
-
2018
- 2018-01-01 US US15/859,716 patent/US20180122494A1/en not_active Abandoned
Also Published As
Publication number | Publication date |
---|---|
TWI627834B (en) | 2018-06-21 |
CN107402860B (en) | 2020-11-06 |
CN107402860A (en) | 2017-11-28 |
US9899104B2 (en) | 2018-02-20 |
TW201735550A (en) | 2017-10-01 |
CN112346903B (en) | 2023-08-08 |
US20170271029A1 (en) | 2017-09-21 |
CN112346903A (en) | 2021-02-09 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US9673840B2 (en) | Turbo product codes for NAND flash | |
KR101422050B1 (en) | Method of error correction in a multibitpercell flash memory | |
US8769374B2 (en) | Multi-write endurance and error control coding of non-volatile memories | |
KR100645058B1 (en) | Memory managing technique capable of improving data reliability | |
US8166370B1 (en) | Efficient RAID ECC controller for RAID systems | |
WO2018142391A1 (en) | Device, system and method of implementing product error correction codes for fast encoding and decoding | |
US8806295B2 (en) | Mis-correction and no-correction rates for error control | |
US10333558B2 (en) | Decoding device and decoding method | |
US8635508B2 (en) | Systems and methods for performing concatenated error correction | |
US9391641B2 (en) | Syndrome tables for decoding turbo-product codes | |
US20220245023A1 (en) | Detection and correction of data bit errors using error correction codes | |
US20170331500A1 (en) | System and method for parallel decoding of codewords sharing common data | |
US11016844B2 (en) | Error correction code structure | |
US11082069B1 (en) | Decoding scheme for error correction code structure in data storage devices | |
US20170373706A1 (en) | Data dependency mitigation in parallel decoders for flash storage | |
US20180122494A1 (en) | Raid decoding architecture with reduced bandwidth | |
US10514980B2 (en) | Encoding method and memory storage apparatus using the same | |
JP2019057752A (en) | Memory system | |
US20180011757A1 (en) | Error correction code management of write-once memory codes | |
US11734107B2 (en) | Decoding scheme for error correction code structure | |
US20170161141A1 (en) | Method and apparatus for correcting data in multiple ecc blocks of raid memory | |
JP2020046823A (en) | Memory system | |
WO2017158430A1 (en) | Coding technique | |
JP2021141369A (en) | Memory system | |
CN113168882A (en) | Encoding method, decoding method and storage controller |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |