An improvement to the bit stuffing algorithm

Sharon Aviran, Paul H. Siegel, Jack Keil Wolf

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

The bit stuffing algorithm is a technique for coding constrained sequences by the insertion of bits into an arbitrary data sequence. This approach was previously introduced and applied to (d, k) constrained codes. Results show that the maximum average rate of the bit stuffing code achieves capacity when k = d + 1 or k = ∞, while it is suboptimal for all other (d, k) pairs. Furthermore, this technique was generalized to produce codes with an average rate that achieves capacity for all (d, k) pairs. However, this extension results in a more complicated scheme. This correspondence proposes a modification to the bit stuffing algorithm that maintains its simplicity. We show analytically that the proposed algorithm achieves improved average rates over bit stuffing for most (d, k) constraints. We further determine all constraints for which this scheme produces codes with an average rate equal to the Shannon capacity.

Original languageEnglish (US)
Pages (from-to)2885-2891
Number of pages7
JournalIEEE Transactions on Information Theory
Volume51
Issue number8
DOIs
StatePublished - Aug 1 2005

Fingerprint

coding

Keywords

  • (d,k)-constrained systems
  • Bit-stuffing encoder
  • Shannon capacity

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

An improvement to the bit stuffing algorithm. / Aviran, Sharon; Siegel, Paul H.; Wolf, Jack Keil.

In: IEEE Transactions on Information Theory, Vol. 51, No. 8, 01.08.2005, p. 2885-2891.

Research output: Contribution to journalArticle

Aviran, Sharon ; Siegel, Paul H. ; Wolf, Jack Keil. / An improvement to the bit stuffing algorithm. In: IEEE Transactions on Information Theory. 2005 ; Vol. 51, No. 8. pp. 2885-2891.
@article{db5818509156423a83f31b19d1f737b8,
title = "An improvement to the bit stuffing algorithm",
abstract = "The bit stuffing algorithm is a technique for coding constrained sequences by the insertion of bits into an arbitrary data sequence. This approach was previously introduced and applied to (d, k) constrained codes. Results show that the maximum average rate of the bit stuffing code achieves capacity when k = d + 1 or k = ∞, while it is suboptimal for all other (d, k) pairs. Furthermore, this technique was generalized to produce codes with an average rate that achieves capacity for all (d, k) pairs. However, this extension results in a more complicated scheme. This correspondence proposes a modification to the bit stuffing algorithm that maintains its simplicity. We show analytically that the proposed algorithm achieves improved average rates over bit stuffing for most (d, k) constraints. We further determine all constraints for which this scheme produces codes with an average rate equal to the Shannon capacity.",
keywords = "(d,k)-constrained systems, Bit-stuffing encoder, Shannon capacity",
author = "Sharon Aviran and Siegel, {Paul H.} and Wolf, {Jack Keil}",
year = "2005",
month = "8",
day = "1",
doi = "10.1109/TIT.2005.851764",
language = "English (US)",
volume = "51",
pages = "2885--2891",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "8",

}

TY - JOUR

T1 - An improvement to the bit stuffing algorithm

AU - Aviran, Sharon

AU - Siegel, Paul H.

AU - Wolf, Jack Keil

PY - 2005/8/1

Y1 - 2005/8/1

N2 - The bit stuffing algorithm is a technique for coding constrained sequences by the insertion of bits into an arbitrary data sequence. This approach was previously introduced and applied to (d, k) constrained codes. Results show that the maximum average rate of the bit stuffing code achieves capacity when k = d + 1 or k = ∞, while it is suboptimal for all other (d, k) pairs. Furthermore, this technique was generalized to produce codes with an average rate that achieves capacity for all (d, k) pairs. However, this extension results in a more complicated scheme. This correspondence proposes a modification to the bit stuffing algorithm that maintains its simplicity. We show analytically that the proposed algorithm achieves improved average rates over bit stuffing for most (d, k) constraints. We further determine all constraints for which this scheme produces codes with an average rate equal to the Shannon capacity.

AB - The bit stuffing algorithm is a technique for coding constrained sequences by the insertion of bits into an arbitrary data sequence. This approach was previously introduced and applied to (d, k) constrained codes. Results show that the maximum average rate of the bit stuffing code achieves capacity when k = d + 1 or k = ∞, while it is suboptimal for all other (d, k) pairs. Furthermore, this technique was generalized to produce codes with an average rate that achieves capacity for all (d, k) pairs. However, this extension results in a more complicated scheme. This correspondence proposes a modification to the bit stuffing algorithm that maintains its simplicity. We show analytically that the proposed algorithm achieves improved average rates over bit stuffing for most (d, k) constraints. We further determine all constraints for which this scheme produces codes with an average rate equal to the Shannon capacity.

KW - (d,k)-constrained systems

KW - Bit-stuffing encoder

KW - Shannon capacity

UR - http://www.scopus.com/inward/record.url?scp=23844539742&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=23844539742&partnerID=8YFLogxK

U2 - 10.1109/TIT.2005.851764

DO - 10.1109/TIT.2005.851764

M3 - Article

AN - SCOPUS:23844539742

VL - 51

SP - 2885

EP - 2891

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 8

ER -