Data mapping scheme for generalized product codes

US10079613B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-10079613-B2
Application numberUS-201615356069-A
CountryUS
Kind codeB2
Filing dateNov 18, 2016
Priority dateNov 18, 2016
Publication dateSep 18, 2018
Grant dateSep 18, 2018

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

Memory systems and operating methods thereof comprise a memory storage and an error control coding (ECC) unit. The memory storage stores data which is split into a plurality of data chunks. The error control coding (ECC) unit is suitable for arranging each data chunk into codewords, each data chunk is arranged as part of at least two codewords, and mapping the codewords by reverse indexing the data chunks.

First claim

Opening claim text (preview).

What is claimed is: 1. A memory system, comprising: a memory storage storing data split into a plurality of data chunks; and an error control coding (ECC) unit suitable for: reading data, representing a communication, from the memory storage; constructing codewords with the plurality of data chunks of the read data, wherein each of the data chunks is shared by at least two codewords; mapping the codewords with the data chunks by a multi-dimension mapping scheme with reverse indexing to convert between two different representations of the same data chunks to update syndrome values for two codewords sharing the same data chunk, wherein mapping complexity of the multi-dimension mapping scheme is reduced to O(N) or less, and N is the number of data chunks in a single codeword; and detecting and correcting errors in the data read from the memory device using the multi-dimension mapping scheme with reverse indexing to correctly represent the communication. 2. The memory system of claim 1 , wherein the multi-dimension mapping scheme with reverse indexing includes at least a representation of indexing a data chunk location within a constituent codeword. 3. The memory system of claim 1 , wherein the multi-dimension mapping scheme with reverse indexing includes at least a representation of indexing a data chunk location within a general product code (GPC) codeword. 4. The memory system of claim 1 , further comprising a lookup table (LUT). 5. The memory system of claim 4 , wherein the ECC unit is further suitable for mapping the codewords by making computations for the reverse indexing using the LUT. 6. The memory system of claim 1 , wherein the plurality of data chunks is split according to a general product code structure. 7. A method, comprising: reading data, representing a communication, from the memory storage; constructing codewords with a plurality of data chunks of the read data, with an error control coding (ECC) unit, wherein each of the data chunks is shared by at least two codewords; mapping the codewords with the data chunks using a multi-dimension mapping scheme with reverse indexing to convert between two different representations of the same data chunk to update syndrome values for two codewords sharing the same data chunk, wherein mapping complexity of the multi-dimension mapping scheme is reduced to O(N) or less, and N is the number of data chunks in a single codeword; and detecting and correcting errors in the data read from the memory device using the multi-dimension mapping scheme with reverse indexing to correctly represent the communication. 8. The method of claim 7 , wherein the multi-dimension mapping scheme with reverse indexing includes at least a representation of indexing a data chunk location within a constituent codeword. 9. The method of claim 7 , wherein the multi-dimension mapping scheme with reverse indexing includes at least a representation of indexing a data chunk location within a general product code (GPC) codeword. 10. The method of claim 7 , further comprising providing a lookup table (LUT). 11. The method of claim 10 , further comprising mapping the codewords by making computations for the reverse indexing using the LUT. 12. The method of claim 7 , wherein the plurality of data chunks is split according to a general product code structure. 13. A memory device, comprising: a memory storage storing data split into a plurality of data chunks; and an error control coding (ECC) unit configured to: read data, representing a communication, from the memory storage; construct codewords with the plurality of data chunks of the read data, wherein each of the data chunks is shared by at least two codewords; map the codewords with the data chunks by a multi-dimension mapping scheme with reverse indexing to convert between two different representations of the same data chunk to update syndrome values for two codewords sharing the same data chunk, wherein mapping complexity of the multi-dimension mapping scheme is reduced to O(N) or less, and N is the number of data chunks in a single codeword; and detect and correct errors in the data read from the memory device using the multi-dimension mapping scheme with reverse indexing to correctly represent the communication. 14. The memory device of claim 13 , wherein the multi-dimension mapping scheme with reverse indexing includes at least a representation of indexing a data chunk location within a constituent codeword. 15. The memory device of claim 13 , wherein the multi-dimension mapping scheme with reverse indexing includes at least a representation of indexing a data chunk location within a general product code (GPC) codeword. 16. The memory device of claim 13 , further comprising a lookup table (LUT). 17. The memory device of claim 16 , wherein the ECC unit is further configured to map the codewords by making computations for the reverse indexing using the LUT. 18. The memory device of claim 13 , wherein the plurality of data chunks is split according to a general product code structure.

Assignees

Inventors

Classifications

  • in sector programmable memories, e.g. flash disk (G06F11/1072 takes precedence) · CPC title

  • Management of blocks · CPC title

  • Protection of memory contents; Detection of errors in memory contents · CPC title

  • in relation to data integrity, e.g. data losses, bit errors · CPC title

  • Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP] · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US10079613B2 cover?
Memory systems and operating methods thereof comprise a memory storage and an error control coding (ECC) unit. The memory storage stores data which is split into a plurality of data chunks. The error control coding (ECC) unit is suitable for arranging each data chunk into codewords, each data chunk is arranged as part of at least two codewords, and mapping the codewords by reverse indexing the …
Who is the assignee on this patent?
Sk Hynix Inc
What technology area does this patent fall under?
Primary CPC classification H03M13/2909. Mapped technology areas include Electricity.
When was this patent published?
Publication date Tue Sep 18 2018 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 1 related publication on this page (citations in our corpus or others sharing the same primary CPC).