Channel capacity of M-ary multitrack runlength limited channels

Bane V. Vasic; Steven W. McLaughlin; Olgica Milenkovic

doi:10.1109/ISIT.1997.613054

Channel capacity of M-ary multitrack runlength limited channels

Bane V. Vasic, Steven W. McLaughlin, Olgica Milenkovic

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

1 Scopus citations

Abstract

We consider M-ary, multitrack runlength 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 runlength 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 a significant increase of per-track capacity for more restrictive clocking, i.e. When kd.

Original language	English (US)
Title of host publication	Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997
Pages	139
Number of pages	1
DOIs	https://doi.org/10.1109/ISIT.1997.613054
State	Published - 1997
Externally published	Yes
Event	1997 IEEE International Symposium on Information Theory, ISIT 1997 - Ulm, Germany Duration: Jun 29 1997 → Jul 4 1997

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8095

Conference

Conference	1997 IEEE International Symposium on Information Theory, ISIT 1997
Country/Territory	Germany
City	Ulm
Period	6/29/97 → 7/4/97

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.1997.613054

Cite this

Channel capacity of M-ary multitrack runlength limited channels. / Vasic, Bane V.; McLaughlin, Steven W.; Milenkovic, Olgica.
Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997. 1997. p. 139 613054 (IEEE International Symposium on Information Theory - Proceedings).

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

Vasic, BV, McLaughlin, SW & Milenkovic, O 1997, Channel capacity of M-ary multitrack runlength limited channels. in Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997., 613054, IEEE International Symposium on Information Theory - Proceedings, pp. 139, 1997 IEEE International Symposium on Information Theory, ISIT 1997, Ulm, Germany, 6/29/97. https://doi.org/10.1109/ISIT.1997.613054

@inproceedings{b1d228829aec4025aee64c7038b51a14,

title = "Channel capacity of M-ary multitrack runlength limited channels",

abstract = "We consider M-ary, multitrack runlength 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 runlength 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 a 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",

doi = "10.1109/ISIT.1997.613054",

language = "English (US)",

isbn = "0780339568",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "139",

booktitle = "Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997",

note = "1997 IEEE International Symposium on Information Theory, ISIT 1997 ; Conference date: 29-06-1997 Through 04-07-1997",

}

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, multitrack runlength 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 runlength 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 a significant increase of per-track capacity for more restrictive clocking, i.e. When kd.

AB - We consider M-ary, multitrack runlength 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 runlength 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 a 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

U2 - 10.1109/ISIT.1997.613054

DO - 10.1109/ISIT.1997.613054

M3 - Conference contribution

AN - SCOPUS:0030658365

SN - 0780339568

SN - 9780780339569

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 139

BT - Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997

T2 - 1997 IEEE International Symposium on Information Theory, ISIT 1997

Y2 - 29 June 1997 through 4 July 1997

ER -

Channel capacity of M-ary multitrack runlength limited channels

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this