Encoder and decoder design for near-balanced codes

Patent metadata

Field	Value
Publication number	US-9985647-B2
Application number	US-201615061650-A
Country	US
Kind code	B2
Filing date	Mar 4, 2016
Priority date	Mar 4, 2015
Publication date	May 29, 2018
Grant date	May 29, 2018

Abstract

Methods of encoding a near-symbol balanced (NSB) sequence may include selecting, with a controller, a constraint based on an amount of bits, determining, with the controller, a plurality of sections in a codebook based on permutations defined by the selected constraint, and partitioning, with the controller, a section among the plurality of sections into a plurality of partitions until each of the plurality of partitions include a number of entries equal to or less than a predetermined number of entries.

First claim

What is claimed is:

1. A method of encoding a near-symbol balanced (NSB) sequence, comprising:
selecting with a controller a constraint based on an amount of bits;
determining, with the controller, a plurality of sections in a codebook based on permutations defined by the selected constraint; and
partitioning, with the controller, a section among the plurality of sections into a plurality of partitions until each of the plurality of partitions include a number of entries equal to or less than a predetermined number of entries.

2. The method of claim 1 , wherein the partitioning step is performed until each of the partitions include 256 entries or less.

3. The method of claim 1 , further comprising setting a plurality of thresholds that define to which section among the plurality of sections a number maps.

4. The method of claim 1 , wherein the section among the plurality of sections is partitioned based on a Chu-Vandermonde identity.

5. The method of claim 1 , wherein the controller is implemented on a PCRAM device.

6. The method of claim 1 , wherein the constraint includes a lower constraint based on a minimum number of times an alphabet appears in a sequence.

7. The method of claim 1 , wherein the constraint includes an upper constraint based on a maximum number of times an alphabet appears in a sequence.

8. A system for encoding a near-symbol balanced (NSB) sequence, including:
a controller suitable for:
selecting a constraint based on an amount of bits;
determining a plurality of sections in a codebook based on permutations defined by the selected constraint; and
partitioning a section among the plurality of sections into a plurality of partitions until each of the plurality of partitions includes a number of entries equal to or less than a predetermined number of entries.

9. The system of claim 8 , wherein the predetermined number of entries is 256 entries.

10. The system of claim 8 , wherein the controller is further suitable for setting a plurality of thresholds that define to which section among the plurality of sections a number maps.

11. The system of claim 8 , wherein the section among the plurality of sections is partitioned based on a Chu-Vandermonde identity.

12. The system of claim 8 , wherein the controller is implemented on a PCRAM device.

13. The system of claim 8 , wherein the constraint includes a lower constraint based on a minimum number of times an alphabet appears in a sequence.

14. The system of claim 8 , wherein the constraint includes an upper constraint based on a maximum number of times an alphabet appears in a sequence.

Assignees

• Sk Hynix Inc

Inventors

• Lee Frederick K H
• Marrow Marcus

Classifications

• H03M7/14 Primary

  Conversion to or from non-weighted codes · CPC title

• H03M13/1515

  Reed-Solomon codes · CPC title

• H03M13/1102

  Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes · CPC title

• H03M13/23

  using convolutional codes, e.g. unit memory codes · CPC title

• H03M13/2957

  Turbo codes and decoding · CPC title