Channel capacity of M-ary multitrack runlength limited channels

Bane V Vasic, Steven W. McLaughlin, Olgica Milenkovic

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

We consider M-ary, multi-track run-length limited (d,k) constrained channels with and without clock redundancy. We calculate the Shannon capacities of these channels and present some simple 100% efficient codes. To compute capacity a constraint graph equivalent to the usual run-length limited constraint graph is used. The introduced graph model has a vertex labeling independent of N, the number of tracks to be written on (in parallel), which provides computational savings when the number of tracks is large. We show that increasing the number of tracks provides significant increase of per-track capacity for more restrictive clocking, i.e. when k<d, but it does not have much influence on the channel capacity when k>d.

Original languageEnglish (US)
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
PublisherIEEE
Pages139
Number of pages1
StatePublished - 1997
Externally publishedYes
EventProceedings of the 1997 IEEE International Symposium on Information Theory - Ulm, Ger
Duration: Jun 29 1997Jul 4 1997

Other

OtherProceedings of the 1997 IEEE International Symposium on Information Theory
CityUlm, Ger
Period6/29/977/4/97

Fingerprint

Run Length
Channel Capacity
Channel capacity
Labeling
Redundancy
Clocks
Vertex Labeling
Graph Model
Graph in graph theory
Calculate

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Applied Mathematics
  • Modeling and Simulation
  • Theoretical Computer Science
  • Information Systems

Cite this

Vasic, B. V., McLaughlin, S. W., & Milenkovic, O. (1997). Channel capacity of M-ary multitrack runlength limited channels. In IEEE International Symposium on Information Theory - Proceedings (pp. 139). IEEE.

Channel capacity of M-ary multitrack runlength limited channels. / Vasic, Bane V; McLaughlin, Steven W.; Milenkovic, Olgica.

IEEE International Symposium on Information Theory - Proceedings. IEEE, 1997. p. 139.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Vasic, BV, McLaughlin, SW & Milenkovic, O 1997, Channel capacity of M-ary multitrack runlength limited channels. in IEEE International Symposium on Information Theory - Proceedings. IEEE, pp. 139, Proceedings of the 1997 IEEE International Symposium on Information Theory, Ulm, Ger, 6/29/97.
Vasic BV, McLaughlin SW, Milenkovic O. Channel capacity of M-ary multitrack runlength limited channels. In IEEE International Symposium on Information Theory - Proceedings. IEEE. 1997. p. 139
Vasic, Bane V ; McLaughlin, Steven W. ; Milenkovic, Olgica. / Channel capacity of M-ary multitrack runlength limited channels. IEEE International Symposium on Information Theory - Proceedings. IEEE, 1997. pp. 139
@inproceedings{b1d228829aec4025aee64c7038b51a14,
title = "Channel capacity of M-ary multitrack runlength limited channels",
abstract = "We consider M-ary, multi-track run-length limited (d,k) constrained channels with and without clock redundancy. We calculate the Shannon capacities of these channels and present some simple 100{\%} efficient codes. To compute capacity a constraint graph equivalent to the usual run-length limited constraint graph is used. The introduced graph model has a vertex labeling independent of N, the number of tracks to be written on (in parallel), which provides computational savings when the number of tracks is large. We show that increasing the number of tracks provides significant increase of per-track capacity for more restrictive clocking, i.e. when kd.",
author = "Vasic, {Bane V} and McLaughlin, {Steven W.} and Olgica Milenkovic",
year = "1997",
language = "English (US)",
pages = "139",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "IEEE",

}

TY - GEN

T1 - Channel capacity of M-ary multitrack runlength limited channels

AU - Vasic, Bane V

AU - McLaughlin, Steven W.

AU - Milenkovic, Olgica

PY - 1997

Y1 - 1997

N2 - We consider M-ary, multi-track run-length limited (d,k) constrained channels with and without clock redundancy. We calculate the Shannon capacities of these channels and present some simple 100% efficient codes. To compute capacity a constraint graph equivalent to the usual run-length limited constraint graph is used. The introduced graph model has a vertex labeling independent of N, the number of tracks to be written on (in parallel), which provides computational savings when the number of tracks is large. We show that increasing the number of tracks provides significant increase of per-track capacity for more restrictive clocking, i.e. when kd.

AB - We consider M-ary, multi-track run-length limited (d,k) constrained channels with and without clock redundancy. We calculate the Shannon capacities of these channels and present some simple 100% efficient codes. To compute capacity a constraint graph equivalent to the usual run-length limited constraint graph is used. The introduced graph model has a vertex labeling independent of N, the number of tracks to be written on (in parallel), which provides computational savings when the number of tracks is large. We show that increasing the number of tracks provides significant increase of per-track capacity for more restrictive clocking, i.e. when kd.

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

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

M3 - Conference contribution

SP - 139

BT - IEEE International Symposium on Information Theory - Proceedings

PB - IEEE

ER -