Capacity, power spectral density, and codes for the one-pairs constraint

S. W. McLaughlin, P. Lee, R. Cloke, Bane V Vasic

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

Abstract

We consider a new constraint for improved timing recovery in partial response digital magnetic recording. The one-pairs constraint is an upper bound on the maximum number of symbols between pairs of ones in a coded sequence and can be considered as an alternative to the widely-used (0,G/I) constraint. We derive the capacity of this constraint, compute the power spectral density for maxentropic one-pairs constrained codes and give rate 16/17 and 24/25 block codes for this constraint.

Original languageEnglish (US)
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Pages321
Number of pages1
DOIs
Publication statusPublished - 1998
Externally publishedYes
Event1998 IEEE International Symposium on Information Theory, ISIT 1998 - Cambridge, MA, United States
Duration: Aug 16 1998Aug 21 1998

Other

Other1998 IEEE International Symposium on Information Theory, ISIT 1998
CountryUnited States
CityCambridge, MA
Period8/16/988/21/98

    Fingerprint

ASJC Scopus subject areas

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

Cite this

McLaughlin, S. W., Lee, P., Cloke, R., & Vasic, B. V. (1998). Capacity, power spectral density, and codes for the one-pairs constraint. In IEEE International Symposium on Information Theory - Proceedings (pp. 321). [708926] https://doi.org/10.1109/ISIT.1998.708926