# US 2022/0035707 A1 · Generating a protected and balanced codeword

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

- Number: US 2022/0035707 A1
- Document ID: US20220035707A1
- Status: Published application
- Kind: A1
- Application number: 17/111,235
- Filed: 2020-12-03
- Published: 2022-02-03
- Earliest claimed: 2020-07-28
- Assignees: Micro Technology, Inc.
- Applicants: Micro Technology, Inc.
- Inventors: Christophe Vincent Antoine Laurent
- Web page: https://patentgrep.com/patent/US20220035707A1

## CPC

- G06F 11/1012: {using codes or arrangements adapted for a specific type of error (G06F11/1048 takes precedence)}
- G06F 11/1076: {Parity data used in redundant arrays of independent storages, e.g. in RAID systems}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Methods, systems, and devices for generating a balanced codeword protected by an error correction code are described. A memory device may receive data bits for storage. Based on the data bits, the memory device may generate a codeword that includes the data bits, parity bits, and placeholder bits. The memory device may balance the codeword by inverting one or more packets of the codeword. After balancing the codeword, the memory device may store at least a portion of the codeword in memory so that a later operation or a decoding process reveals the packets that were inverted as part of the balancing process. Accordingly, the memory device may re-invert the appropriate packets to recover the original data bits.

## Claims

### Claim 1

A method, comprising:
constructing a codeword comprised of data bits, placeholder bits, and parity bits, wherein the placeholder bits occupy a plurality of positions in the codeword;
inverting one or more packets of bits of the codeword to modify a ratio of logic values associated with the codeword;
storing a portion of the codeword in a set of memory cells, the portion of the codeword comprising the data bits and the parity bits and excluding the placeholder bits;
reconstructing the codeword based at least in part on the stored data bits, the stored parity bits, and a set of bits, wherein the set of bits occupy the plurality of positions in the reconstructed codeword previously occupied by the placeholder bits; and
determining the one or more packets of bits that were inverted based at least in part on an error detected in the reconstructed codeword.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
decoding the reconstructed codeword to detect the error; and
inverting the one or more packets of bits based at least in part on determining the one or more packets of bits that were inverted.

### Claim 3 (depends on 1)

The method of claim 1, wherein each bit of the placeholder bits comprises a logic zero except for a first bit which comprises a logic one before the one or more packets of bits are inverted, and wherein each bit of the set of bits comprises a logic zero.

### Claim 4 (depends on 3)

The method of claim 3, wherein each bit of the placeholder bits is mapped to at least two consecutively-index packets.

### Claim 5 (depends on 1)

The method of claim 1, wherein the codeword is logically divided into a quantity of packets comprising the one or more packets, and wherein a quantity of the placeholder bits is equal to the quantity of the one or more packets plus one.

### Claim 6 (depends on 1)

The method of claim 1, wherein each bit of the placeholder bits comprises a logic zero, at least before the one or more packets of bits are inverted, and wherein each bit of the set of bits comprises a logic zero.

### Claim 7 (depends on 1)

The method of claim 1, further comprising:
inputting, into a decoder, the set of bits from a voltage reference permanently coupled with the decoder; and
decoding, based at least in part on inputting the set of bits, the reconstructed codeword using the decoder, wherein the error is detected based at least in part on the decoding.

### Claim 8 (depends on 7)

The method of claim 7, further comprising:
reading, in response to a request for the data bits, the stored data bits and the stored parity bits from the set of memory cells; and
inputting the stored data bits and the stored parity bits into the decoder, wherein the reconstructed codeword is decoded based at least in part on inputting the stored data bits and the stored parity bits.

### Claim 9 (depends on 1)

The method of claim 1, further comprising:
inputting the stored data bits and the stored parity bits into a decoder to decode the reconstructed codeword, wherein the decoder is configured with the set of bits as default logic values.

### Claim 10 (depends on 1)

The method of claim 1, wherein each bit of the set of bits is associated with a respective inversion pattern for the codeword, the method further comprising:
determining that the error in the reconstructed codeword comprises an error in a bit, of the set of bits, that is associated with an inversion pattern comprising the one or more packets of bits.

### Claim 11 (depends on 1)

The method of claim 1, wherein the constructed codeword comprises the data bits in a second plurality of positions in the codeword and the parity bits in a third plurality of positions in the codeword, and wherein the reconstructed codeword comprises the stored data bits in the second plurality of positions and the stored parity bits in the third plurality of positions.

### Claim 12 (depends on 1)

The method of claim 1, wherein inverting the one or more packets inverts a placeholder bit, the method further comprising:
determining that a bit of the set of bits is associated with the inverted placeholder bit and has a different logic value than the inverted placeholder bit, wherein the error in the codeword is detected based at least in part on the determination.

### Claim 13 (depends on 12)

The method of claim 12, wherein the bit associated with the inverted placeholder bit occupies a position in the reconstructed codeword that was previously occupied by the inverted placeholder bit.

### Claim 14

A method, comprising:
inverting a plurality of bits of a codeword to modify a ratio of logic values associated with the codeword, the codeword comprising data bits, placeholder bits, and parity bits;
storing the codeword, excluding the placeholder bits, in a set of memory cells associated with the codeword;
decoding the stored data bits, the stored parity bits, and a set of bits;
determining the plurality of bits that were inverted based at least in part on an error detected in the set of bits during the decoding.

### Claim 15 (depends on 14)

The method of claim 14, further comprising:
inverting the plurality of bits based at least in part on determining that the plurality of bits were inverted; and
communicating the data bits to requesting device based at least in part on inverting the plurality of bits.

### Claim 16 (depends on 14)

The method of claim 14, wherein each bit of the placeholder bits comprises a logic zero except for a first bit which comprises a logic one before the plurality of bits are inverted, and wherein each bit of the set of bits comprises a logic zero.

### Claim 17 (depends on 14)

The method of claim 14, wherein a logic value of the placeholder bits before the plurality of bits are inverted matches a logic value of the set of bits.

### Claim 18 (depends on 14)

The method of claim 14, further comprising:
communicating, to a decoder, the set of bits from a voltage reference permanently coupled with the decoder, wherein the decoding is based at least in part on communicating the set of bits to the decoder.

### Claim 19 (depends on 14)

The method of claim 14, further comprising:
constructing the codeword, wherein the codeword comprises the data bits in a first set of positions, the placeholder bits in a second set of positions, and the parity bits in a third set of positions; and
reconstructing the codeword for the decoding, wherein the reconstructed codeword comprises the stored data bits in the first set of positions, the set of bits in the second set of positions, and the stored parity bits in the third set of positions.

### Claim 20 (depends on 14)

The method of claim 14, wherein the set of bits are associated with a one hot coding scheme, and wherein the plurality of bits is determined based at least in part on the one hot coding scheme and a location of the error in the set of bits.

### Claim 21 (depends on 14)

The method of claim 14, further comprising:
storing an extra set of bits in the set of memory cells associated with the codeword to further modify the ratio of logic values associated with the codeword;
reading the stored extra set of bits from the set of memory cells along with the stored data bits and the stored parity bits; and
excluding the stored extra set of bits from the decoding.

### Claim 22 (depends on 14)

The method of claim 14, further comprising:
detecting at least a second error in the data bits or parity bits based at least in part on the decoding;
correcting the error in the set of bits and the second error in the data bits or the parity bits; and
inverting, after correcting the errors, the plurality of bits based at least in part on determining that the plurality of bits were inverted.

### Claim 23 (depends on 14)

The method of claim 14, wherein the plurality of bits comprises bits that, when inverted together, prevent a decoder from detecting the inversion.

### Claim 24

A method, comprising:
inverting a set of bits of a codeword that comprises data bits, placeholder bits, and parity bits that are mapped to a plurality of packets, wherein the set of bits comprises bits that are mapped to one or more packets of the plurality of packets;
storing the codeword, minus the placeholder bits, in memory, wherein storing the codeword comprises storing the data bits and the parity bits;
inputting the stored data bits, the stored parity bits, and a second set of bits into a decoder, wherein each bit of the second set of bits is associated with a respective placeholder bit; and
determining the set of bits that were inverted based at least in part on an error detected in the second set of bits input into the decoder.

### Claim 25 (depends on 24)

The method of claim 24, wherein each bit of the placeholder bits comprises a logic zero except for a first bit which comprises a logic one before the set of bits are inverted, and wherein each bit of the second set of bits comprises a logic zero.

### Claim 26 (depends on 24)

The method of claim 24, wherein a quantity of the placeholder bits is equal to a quantity of the plurality of packets plus one.

### Claim 27 (depends on 24)

The method of claim 24, further comprising:
inputting the placeholder bits as logic zeros into an encoder to generate the codeword; and
inputting the second set of bits as logic zeros into the decoder.

### Claim 28 (depends on 24)

The method of claim 24, further comprising:
discarding the placeholder bits after inverting the set of bits.

### Claim 29 (depends on 24)

The method of claim 24, further comprising:
interpreting the second set of bits as balancing information bits that indicate respective inversion patterns for the codeword, wherein the set of bits is associated with an inversion pattern indicated by a location of the error in the second set of bits.

### Claim 30 (depends on 24)

The method of claim 24, further comprising:
arranging the data bits in a first set of positions of the codeword, the placeholder bits in a second set of positions of the codeword, and the parity bits in a third set of positions of the codeword; and
arranging the stored data bits, the stored parity bits, and the second set of bits to be input into the decoder, wherein stored data bits are arranged in the first set of positions, the second set of bits are arranged in the second set of positions, and the stored parity bits are arranged in the third set of positions.

### Claim 31 (depends on 24)

The method of claim 24, wherein the placeholder bits and the second set of bits have logic values that are independent of the data bits.

### Claim 32

A method for encoding information bits, decoding information bits, or both, comprising:
associating predetermined value bits to the information bits;
computing and storing parity bits based, at least in part, on the information bits and the predetermined value bits;
retrieving the parity bits and reconstructing the information bits based on the parity bits and the predetermined value bits; and
encoding the information bits, decoding the information bits, or both, based on computing, storing, and retrieving parity bits and reconstructing the information bits;
wherein the storing and retrieving the parity bits is exclusive of storing and retrieving the predetermined value bits.

### Claim 33 (depends on 32)

The method of claim 32, wherein encoding and decoding comprises encoding and decoding according to a x Hot Coding.

### Claim 34 (depends on 33)

The method of claim 33, wherein the parity bits are configured to correct at least x intentional errors in the information bits encoded and decoded according to the x Hot Coding with respect to the predetermined value bits.

### Claim 35 (depends on 34)

The method of claim 34, wherein the information bits comprise balancing information bits, flag bits, or other bits associated to data bits, and wherein computing the parity bits is based on the data bits, reconstructing the information bits is based on the data bits, or both.

### Claim 36 (depends on 32)

The method of claim 32, wherein computing the parity bits and reconstructing the information are based on hard-wired predetermined value bits.
