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 |
Fingerprint
ASJC Scopus subject areas
- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics
Cite this
Two-dimensional bit-stuffing schemes with multiple transformers. / Aviran, Sharon; Siegel, Paul H.; Wolf, Jack K.
Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05. Vol. 2005 2005. p. 1478-1482 1523589.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Two-dimensional bit-stuffing schemes with multiple transformers
AU - Aviran, Sharon
AU - Siegel, Paul H.
AU - Wolf, Jack K.
PY - 2005/12/1
Y1 - 2005/12/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=33749451042&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33749451042&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2005.1523589
DO - 10.1109/ISIT.2005.1523589
M3 - Conference contribution
AN - SCOPUS:33749451042
SN - 0780391519
SN - 9780780391512
VL - 2005
SP - 1478
EP - 1482
BT - Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05
ER -