A Universal Algorithm for Generating Optimal and Nearly Optimal Run-length-limited, Charge-constrained Binary Sequences
P.E. Bender, Jack K. Wolf · 2005
This paper presents an algorithm for run-length-limiting and charge-constraining binary data. These constraints are specified by the three parameters (d, k, c). The first two constraint, d and k, put a lower and an upper bound on the run-lengths. The third parameter, c, puts an upper bound on the absolute accumulated charge. An algorithm is optimal if its maximum average rate equals the capacity of the constraint. The algorithm that this paper presents, known as the bit stuff algorithm, is a variable rate algorithm that is both simple and universal. It is optimal for the (d, /spl infin/, /spl infin/), the (d,d + l, /spl infin/), and the (2c - 2, /spl infin/, c) constraints. It is nearly optimal for all other constraints.