Efficient encoding for non-binary error correction codes
AssigneeGylicon Ltd
InventorClaudio Tocalli
Life of this patent
Estimating the term…
Loading patent…
AssigneeGylicon Ltd
InventorClaudio Tocalli
Estimating the term…
Encoding bits with a Q-ary linear error correction code defined over a binary-extension Galois field GF(2k), defined by a quasi-cyclic parity-check matrix comprising: first, second and third circulant sub-matrices comprising respective circulants respectively having first, second and third shifts and defined by first, second and third parameters belonging to the Galois field GF(2k), the second shift equal to a difference between a number of rows of each circulant and the first shift. A first set of parity-check bits is determined according to a fourth circulant having a shift equal to a difference between the number of rows and the first and third shifts and defined by the multiplicative inverse of a product between the first and third parameters, and to the second and third circulant sub-matrices. A second set of parity-check bits is determined according to the first set of parity-check bits and the first and second circulant sub-matrices.
A controller for a solid state storage device, wherein the controller is configured for encoding information bits with a Q-ary linear error correction code defined over a binary-extension Galois field GF(2k), wherein the Q-ary linear error correction code is defined by a quasi-cyclic parity-check matrix having an information section associated with the information bits and a parity section associated with parity bits, wherein the parity section has an approximate lower triangular form and comprises a plurality of circulants, the parity section comprises:
A solid state storage device comprising, memory cells and a controller, wherein the controller is configured for encoding information bits with a Q-ary linear error correction code defined over a binary-extension Galois field GF(2k), wherein the Q-ary linear error correction code is defined by a quasi-cyclic parity-check matrix having an information section associated with the information bits and a parity section associated with parity bits, wherein the parity section has an approximate lower triangular form and comprises a plurality of circulants, wherein the parity section comprises:
Dependencies are inferred from the claim text.