×

NAND memory management

  • US 8,943,385 B2
  • Filed: 10/23/2012
  • Issued: 01/27/2015
  • Est. Priority Date: 10/23/2012
  • Status: Active Grant
First Claim
Patent Images

1. An apparatus comprising:

  • a memory controller logic to;

    apply a binary parity check code to a binary string; and

    convert the binary string to a ternary stringdetermine, for each ternary combination in a set of 2187 ternary combinations, a number of neighbors which have a hamming distance of 1 from the ternary combination;

    order the set of 2187 ternary combinations in ascending order of the number of neighbors which having a hamming distance of 1;

    remove from the set of 2187 ternary combinations a subset of 139 ternary combinations to produce a set of 2048 ternary combinations;

    select as a root a ternary combination which has 11 neighbors;

    assign vertices for all ternary combinations which have a hamming distance of 1 from the root;

    iteratively populate the mapping tree with nodes having a hamming distance of 1 from their respective neighbors.

View all claims
  • 2 Assignments
Timeline View
Assignment View
    ×
    ×