NAND memory management
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.
2 Assignments
0 Petitions
Accused Products
Abstract
Apparatus, systems, and methods to manage NAND memory are described. In one embodiment, a memory controller logic is configured to apply a binary parity check code to a binary string and convert the binary string to a ternary string.
-
Citations
9 Claims
-
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 string determine, 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 Dependent Claims (2, 3, 4)
-
5. A system comprising:
-
a 3-level NAND memory device having a plurality of memory cells; a processor to access the 3-level NAND memory device; and a 3-level NAND memory controller logic to; apply a binary parity check code to a binary string; and convert the binary string to a ternary string determine, 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 Dependent Claims (6, 7)
-
-
8. A computer-implemented method comprising:
-
applying a binary parity check code to a binary string; and converting the binary string to a ternary string determining, 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; ordering the set of 2187 ternary combinations in ascending order of the number of neighbors which having a hamming distance of 1; removing from the set of 2187 ternary combinations a subset of 139 ternary combinations to produce a set of 2048 ternary combinations; selecting as a root a ternary combination which has 11 neighbors; assigning vertices for all ternary combinations which have a hamming distance of 1 from the root Iteratively populating the mapping tree with nodes having a hamming distance of 1 from their respective neighbors; and writing the ternary string to a 3-level NAND memory. - View Dependent Claims (9)
-
Specification