Two-dimensional bit-stuffing schemes with multiple transformers

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

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish (US)
Title of host publicationProceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05
Pages1478-1482
Number of pages5
Volume2005
DOIs
StatePublished - Dec 1 2005
Event2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, Australia
Duration: Sep 4 2005Sep 9 2005

Other

Other2005 IEEE International Symposium on Information Theory, ISIT 05
CountryAustralia
CityAdelaide
Period9/4/059/9/05

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

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

Cite this