# US 2021/0175904 A1 · Very Low Complexity SECDED Codes

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2021/0175904 A1
- Document ID: US20210175904A1
- Status: Published application
- Kind: A1
- Application number: 16/909,794
- Filed: 2020-06-23
- Published: 2021-06-10
- Earliest claimed: 2019-12-09
- Assignees: Western Digital Technologies, Inc.
- Applicants: Western Digital Technologies, Inc.
- Inventors: Ishai ILANI
- Web page: https://patentgrep.com/patent/US20210175904A1

## CPC

- H03M 13/033: {Theoretical methods to calculate these checking codes}
- H03M 13/1174: {Parity-check or generator matrices built from sub-matrices representing known block codes such as, e.g. Hamming codes, e.g. generalized LDPC codes}
- H03M 13/1168: {wherein the sub-matrices have column and row weights greater than one, e.g. multi-diagonal sub-matrices}
- H03M 13/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/17 takes precedence)
- H03M 13/19: Single error correction without using particular properties of the cyclic codes, e.g. Hamming codes, extended or generalised Hamming codes
- H03M 13/2903: {Methods and arrangements specifically for encoding, e.g. parallel encoding of a plurality of constituent codes}
- H03M 13/2906: {using block codes (H03M13/2957 takes precedence)}
- H03M 13/616: {Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations}
- H03M 13/134: {Non-binary linear block codes not provided for otherwise}
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)

## Abstract

A data storage device has a controller that is configured to generate SECDED codes based on a plurality (at least 2) of codes, where each of the constituent codes is a cyclic code over a finite field of size 2m for some integer m. Any 2 constituent codes are associated with 2m1 and 2m2, where m1 and m2 are coprime (i.e., gcd(m1,m2)=1) where gcd is the greatest common divisor. In such a case, it is possible to generate a cyclic code of length (2m1−1)*(2m2−1), which will be a long code, but enjoy the complexity, in encoding and decoding, of the small fields of the constituent codes.

## Claims

### Claim 1

A data storage device, comprising:
a controller configured to:
determine a first Galois Field GF(2m1) and a second Galois Field GF(2m2) for a codeword, wherein m1+m2+1=m and m is an integer;
generate a single error correcting cyclic code of a first length;
generate a SECDED cyclic code of a second length;
generate a first binary matrix corresponding to the single error correcting cyclic code;
generate a second binary matrix corresponding to the SECDED cyclic code;
generate a parity check matrix;
rotate the single error correcting cyclic code of the first length until an error is present in the parity check matrix; and
rotate the SECDED cyclic code of the second length until the error is present in the parity check matrix.

### Claim 2 (depends on 1)

The data storage device of claim 1, wherein the rotating the single error correcting cyclic code of the first length rotates by a rotation amount equal to m1.

### Claim 3 (depends on 1)

The data storage device of claim 1, wherein rotating the SECDED cyclic code of the second length rotates by a rotation amount equal to m2+1.

### Claim 4 (depends on 1)

The data storage device of claim 1, wherein m is equal to a number of parity bits for the codeword.

### Claim 5 (depends on 1)

The data storage device of claim 1, wherein the parity check matrix is shortened by discarding a number of columns that is equal to a length of the codeword plus m.

### Claim 6 (depends on 1)

The data storage device of claim 1, wherein the first length is equal to 2m1−1.

### Claim 7 (depends on 6)

The data storage device of claim 6, wherein the second length is equal to 2m2−1.

### Claim 8 (depends on 7)

The data storage device of claim 7, wherein m1 and m2 are different.

### Claim 9 (depends on 8)

The data storage device of claim 8, wherein the greatest common divisor for m1 and m2 is 1.

### Claim 10

A data storage device, comprising:
a memory device; and
a controller coupled to the memory device, the controller configured to:
generate two constituent codes of unequal length from a codeword of a first length;
rotate at least one constituent code of the two constituent codes until an error within the at least one constituent code is present in a parity portion;
determine a location of the error; and
decode the codeword.

### Claim 11 (depends on 10)

The data storage device of claim 10, wherein a greatest common divisor of:
a length of a first constituent code of the two constituent codes; and
a length of a second constituent code of the two constituent codes is equal to 1.

### Claim 12 (depends on 10)

The data storage device of claim 10, wherein at least one constituent code is a SECDED constituent code.

### Claim 13 (depends on 10)

The data storage device of claim 10, wherein the two constituent codes each have a length that is less than the first length.

### Claim 14 (depends on 10)

The data storage device of claim 10, wherein the controller is further configured to generate a parity matrix for a first constituent code of the at least one constituent code.

### Claim 15 (depends on 14)

The data storage device of claim 14, wherein the parity matrix has a number of rows that is equal to a number of parity bits for the first constituent code.

### Claim 16 (depends on 15)

The data storage device of claim 15, wherein the parity matrix has a number of columns that is equal to a length of the first constituent code.

### Claim 17 (depends on 10)

The data storage device of claim 10, wherein a number of parity bits for each constituent code is equal.

### Claim 18

A data storage device, comprising:
a memory device; and
means to generate a cyclic code without codewords of weight 2 using CRT, wherein the means to generate are coupled to the memory device.

### Claim 19 (depends on 18)

The data storage device of claim 18, further comprising means to create a SECDED constituent code from a codeword.

### Claim 20 (depends on 19)

The data storage device of claim 19, wherein the cyclic code includes the SECDED constituent code and a second constituent code.
