High throughput bit correction of data inside a word buffer for a product code decoder

Patent metadata

Field	Value
Publication number	US-10846175-B2
Application number	US-201815950137-A
Country	US
Kind code	B2
Filing date	Apr 10, 2018
Priority date	Apr 10, 2018
Publication date	Nov 24, 2020
Grant date	Nov 24, 2020

Abstract

A product code decoder to implement a method of bit correction in a codeword buffer to support error correcting code (ECC). The method loads a location entry from a correction queue, where the location entry includes a data word address and bit location information. The method performs a fast path data word address comparison to determine whether data from the data word address is being processed by a previous entry from the correction queue. The method further combines a correction of the data at the data word address specified by the location entry with a correction of a copy of the data being processed based on a previous location entry, in response to a fast path data word address comparison match, and stores the combined data in the codeword buffer.

First claim

What is claimed is:

1. A method for implementing bit correction in a codeword buffer to support error correcting code (ECC) using a product code decoder, the method comprising:
loading a codeword buffer location entry from a correction queue, the location entry including a data word address and bit location information;
performing a fast path data word address comparison to determine whether a copy of the data at the data word address is being processed by a previous location entry from the correction queue; and
combining a correction of the data at the data word address specified by the location entry with a correction of a copy of the data being processed based on the previous location entry, in response to a fast path data word address comparison match; and
storing the combined data in the codeword buffer.

2. The method of claim 1 , further comprising:
modifying data loaded from the codeword buffer, in response to a subsequent fast path data word address comparison not matching.

3. The method of claim 1 , further comprising:
accessing the data from the data word address in the codeword buffer.

4. The method of claim 1 , further comprising:
decoding the bit location information to determine a bit location in the data to be modified.

5. The method of claim 1 , further comprising:
storing bit location information in a correction queue entry received from the product code decoder.

6. The method of claim 1 , wherein the fast path data word address comparison compares the data word address with each data word address from a previous two location entries from the correction queue.

7. The method of claim 1 , wherein the method has an error correction rate of one correction per clock for data within the codeword buffer.

8. A bit correction circuit comprising:
a codeword buffer to store a received product code;
an error location decode to determine a bit location of a correction;
a fast path data word address compare to determine whether an input data word address matches a previous data word address; and
combination logic to update the bit location of the correction, the combination logic controlled by the fast path data word address compare that determines inputs for the combination logic.

9. The bit correction circuit of claim 8 , further comprising:
a correction queue to store a set of location entries to be processed by the bit correction circuit.

10. The bit correction circuit of claim 8 , further comprising:
a set of registers to store previous data word addresses being processed by the bit correction circuit.

11. The bit correction circuit of claim 8 , further comprising:
a set of registers to store modified data for recombination by the combination logic.

12. The bit correction circuit of claim 8 , wherein the combination logic includes a multiplexor controlled by the fast path data word address compare and at least one XOR gate.

13. The bit correction circuit of claim 8 , wherein the bit correction circuit has an error correction rate of one correction per clock for the codeword buffer.

14. A memory system comprising:
a set of memory devices to store data;
a host interface to receive a request to store or access data in the set of memory devices; and
a controller including error code correction utilizing a product code decoder, the product code decoder including a bit correction circuit, the bit correction circuit including, a codeword buffer to store a received product code,
an error location decode to determine a bit location of a correction,
a fast path data word address compare to determine whether an input data word address matches a previous data word address, and
combination logic to update the bit location of the correction, the combination logic controlled by the fast path data word address compare that determines inputs for the combination logic.

15. The memory system of claim 14 , further comprising:
a correction queue to store a set of location entries to be processed by the bit correction circuit.

16. The memory system of claim 14 , further comprising:
a set of registers to store previous data word addresses being processed by the bit correction circuit.

17. The memory system of claim 16 , wherein the set of registers store previous data word addresses received over a preceding two clock cycles.

18. The memory system of claim 14 , further comprising:
a set of registers to store modified data for recombination by the combination logic.

19. The memory system of claim 14 , wherein the combination logic includes a multiplexor controlled by the fast path data word address compare and at least one XOR gate.

20. The memory system of claim 14 , wherein the bit correction circuit has an error correction rate of one correction per clock for the codeword buffer.

Assignees

• Micron Technology Inc

Inventors

• Parthasarathy Sivagnanam
• Richardson Nicholas J
• Khayat Patrick R
• Doru Shantilal

Classifications

• H03M13/2909 Primary

  Product codes · CPC title

• H03M13/2927

  Decoding strategies · CPC title

• H03M13/2948

  Iterative decoding (H03M13/2957 takes precedence) · CPC title

• G06F11/1012

  using codes or arrangements adapted for a specific type of error (G06F11/1048 takes precedence) · CPC title

• H03M13/152

  Bose-Chaudhuri-Hocquenghem [BCH] codes · CPC title