Abstract
We present bit-stuffing schemes which encode arbitrary data sequences into two-dimensional (2-D) constrained arrays. We consider the class of 2-D runlength-limited (RLL) (d, ∞) constraints as well as the 'no isolated bits' (n.i.b.) constraint, both defined on the square lattice. The bit stuffing technique was previously introduced and applied to the class of 2-D (d, ∞) constraints. Analytical lower bounds on the rate of these encoders were derived. For d = 1, a more general scheme was analyzed and shown to obtain improved performance. We extend the (1, ∞)-construction to (d, ∞) constraints where d ≥ 2. We then suggest a bit-stuffing scheme for the n.i.b. constraint, based on a capacity-achieving scheme for a one-dimensional RLL (0, 3) constraint. Simulation results demonstrate the performance of the proposed schemes.
Original language | English (US) |
---|---|
Title of host publication | Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05 |
Pages | 1478-1482 |
Number of pages | 5 |
Volume | 2005 |
DOIs | |
State | Published - Dec 1 2005 |
Event | 2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, Australia Duration: Sep 4 2005 → Sep 9 2005 |
Other
Other | 2005 IEEE International Symposium on Information Theory, ISIT 05 |
---|---|
Country | Australia |
City | Adelaide |
Period | 9/4/05 → 9/9/05 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics