Two-dimensional bit-stuffing schemes with multiple transformers

Sharon Aviran; Paul H. Siegel; Jack K. Wolf

doi:10.1109/ISIT.2005.1523589

Two-dimensional bit-stuffing schemes with multiple transformers

Sharon Aviran, Paul H. Siegel, Jack K. Wolf

Biomedical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Scopus citations

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	https://doi.org/10.1109/ISIT.2005.1523589
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

Access to Document

10.1109/ISIT.2005.1523589

Fingerprint Dive into the research topics of 'Two-dimensional bit-stuffing schemes with multiple transformers'. Together they form a unique fingerprint.

Cite this

@inproceedings{dc242ee4c2ad47ceacdff2340d4cf0f6,

title = "Two-dimensional bit-stuffing schemes with multiple transformers",

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.",

author = "Sharon Aviran and Siegel, {Paul H.} and Wolf, {Jack K.}",

year = "2005",

month = dec,

day = "1",

doi = "10.1109/ISIT.2005.1523589",

language = "English (US)",

isbn = "0780391519",

volume = "2005",

pages = "1478--1482",

booktitle = "Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05",

note = "2005 IEEE International Symposium on Information Theory, ISIT 05 ; Conference date: 04-09-2005 Through 09-09-2005",

}

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

T2 - 2005 IEEE International Symposium on Information Theory, ISIT 05

Y2 - 4 September 2005 through 9 September 2005

ER -