Enumerative modulation coding with arbitrary constraints and postmodulation error correction coding for data storage systems

Masud Mansuripur

doi:10.1117/12.45930

1 July 1991 Enumerative modulation coding with arbitrary constraints and postmodulation error correction coding for data storage systems

Masud Mansuripur

Author Affiliations +

Proceedings Volume 1499, Optical Data Storage '91; (1991) https://doi.org/10.1117/12.45930
Event: Optical Data Storage, 1991, Colorado Springs, CO, United States

Abstract

Modulation constraints of practically any degree of complexity can be described by a state transition table with a finite number (Omega) of states. Examples include all (d,k;c) codes (where (Omega) <EQ 2(k + 1)(2c + 1)), more general codes with run-length limitations, and run- length limited codes which exclude certain bit-patterns. From the state transition table we construct a trellis diagram for code words of arbitrary length L_O. If desired, the trellis may be confined in the beginning and/or at the end to a subset of states. We then show a simple method of enumeration that assigns a number to each code word in the trellis according to is lexicographic order. All the necessary information for enumerative encoding and decoding of binary data will be subsequently stored in an array of size L_O X (Omega) ; both encoding and decoding can be achieved with a few simple operations using this table. In short, arbitrarily long blocks of data can be encoded into sequences that satisfy arbitrary constraints, with algorithms that are easy to implement. Since no additional constraints are imposed, the rates approach Shannon's noiseless channel capacity in the limit of long sequences. We present ideas for correction of random errors that occur in modulated sequences, so that errors in readout can be corrected prior to demodulation. The post-modulation error correction codes are necessary when modulation code words are long, in which case small errors can destroy large quantities of data. Also introduced in this paper is a simple, efficient algorithm for burst-error-correction. The primary application of the ideas of this paper is in the area of data encoding/decoding as applied in magnetic and optical data storage systems.

Citation Download Citation

Masud Mansuripur "Enumerative modulation coding with arbitrary constraints and postmodulation error correction coding for data storage systems", Proc. SPIE 1499, Optical Data Storage '91, (1 July 1991); https://doi.org/10.1117/12.45930

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available