Share Email Print
cover

Proceedings Paper

Strictest (0,G/I) constraints achieved by high-rate block codes for class-IV PRML channels
Author(s): Khaled A. S. Abdel-Ghaffar; Jos H. Weber
Format Member Price Non-Member Price
PDF $17.00 $21.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Significant improvements in magnetic storage densities have been made feasible recently by the application of partial response signaling combined with maximum-likelihood sequence estimation (PRML). To enhance the performance of this technique when applied to the class- IV partial response channel, which is recognized as being appropriate to model the magnetic recording channel, it is often required to bound the number of consecutive zeros in the recorded data sequence by some positive integer G and the number of consecutive zeros in each of the odd and the even subsequences of the recorded data sequence by some positive integer I. Such a constraint is referred to as a (0, G/I) constraint. Codes are used to map arbitrary unconstrained sequences to (0, G/I) constrained sequences. We investigate the strictest possible constraints that can be achieved by block codes of high rates and compare between these constraints and the strictest possible constraints that can be achieved by arbitrary coding schemes.

Paper Details

Date Published: 8 December 1995
PDF: 10 pages
Proc. SPIE 2605, Coding and Signal Processing for Information Storage, (8 December 1995); doi: 10.1117/12.228238
Show Author Affiliations
Khaled A. S. Abdel-Ghaffar, Univ. of California/Davis (United States)
Jos H. Weber, Delft Univ. of Technology (Netherlands)


Published in SPIE Proceedings Vol. 2605:
Coding and Signal Processing for Information Storage
Raghuveer M. Rao; Soheil A. Dianat; Steven W. McLaughlin; Martin Hassner, Editor(s)

© SPIE. Terms of Use
Back to Top