Flash code utilizing resizable-clusters

Abstract

With slice-based flash code, the smaller the size slice the more flexible it is to distribute cells among the bits and leave less unused levels. However, smaller size slices comes with a small overhead and it some cases worsen its efficiency. To get around this issue, this paper introduces a new technique called resizable- cluster method. This technique allows a cluster, a sequence of slices, to grow by acquiring adjacent empty slices. By integrating this technique to a slice-based flash code, it is able utilize the advantage of small size slices while minimizing the effect of any overhead.