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

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

25 Citations (Scopus)

Abstract

Modulation constraints of practically any degree of complexity can be described by a state transition table with a finite number approximately $OMEGA of states. Examples include all (d,k;c) codes (where approximately $OMEGA ≤ 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 L0. 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 its lexicographic order. All the necessary information for enumerative encoding and decoding of binary data will be subsequently stored in an array of size L0 × approximately $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. Ideas are presented for correction of random errors that occur in modulated sequences, so that errors in readout can be corrected prior to demodulation. These post- modulation error correction codes are necessary when modulation can be corrected prior to demodulation. These 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.

Original languageEnglish (US)
Title of host publicationProceedings of SPIE - The International Society for Optical Engineering
PublisherPubl by Int Soc for Optical Engineering
Pages72-86
Number of pages15
Volume1499
ISBN (Print)0819406082
StatePublished - 1991
EventOptical Data Storage '91 - Colorado Springs, CO, USA
Duration: Feb 25 1991Feb 27 1991

Other

OtherOptical Data Storage '91
CityColorado Springs, CO, USA
Period2/25/912/27/91

Fingerprint

Error correction
data storage
coding
Modulation
modulation
Data storage equipment
Decoding
Demodulation
decoding
Magnetic storage
demodulation
Optical data storage
Random errors
Channel capacity
binary data
channel capacity
enumeration
random errors
set theory
readout

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Condensed Matter Physics

Cite this

Mansuripur, M. (1991). Enumerative modulation coding with arbitrary constraints and postmodulation error correction coding for data storage systems. In Proceedings of SPIE - The International Society for Optical Engineering (Vol. 1499, pp. 72-86). Publ by Int Soc for Optical Engineering.

Enumerative modulation coding with arbitrary constraints and postmodulation error correction coding for data storage systems. / Mansuripur, Masud.

Proceedings of SPIE - The International Society for Optical Engineering. Vol. 1499 Publ by Int Soc for Optical Engineering, 1991. p. 72-86.

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

Mansuripur, M 1991, Enumerative modulation coding with arbitrary constraints and postmodulation error correction coding for data storage systems. in Proceedings of SPIE - The International Society for Optical Engineering. vol. 1499, Publ by Int Soc for Optical Engineering, pp. 72-86, Optical Data Storage '91, Colorado Springs, CO, USA, 2/25/91.
Mansuripur M. Enumerative modulation coding with arbitrary constraints and postmodulation error correction coding for data storage systems. In Proceedings of SPIE - The International Society for Optical Engineering. Vol. 1499. Publ by Int Soc for Optical Engineering. 1991. p. 72-86
Mansuripur, Masud. / Enumerative modulation coding with arbitrary constraints and postmodulation error correction coding for data storage systems. Proceedings of SPIE - The International Society for Optical Engineering. Vol. 1499 Publ by Int Soc for Optical Engineering, 1991. pp. 72-86
@inproceedings{2da9f131afe24e2887ba75b8c3e82cbd,
title = "Enumerative modulation coding with arbitrary constraints and postmodulation error correction coding for data storage systems",
abstract = "Modulation constraints of practically any degree of complexity can be described by a state transition table with a finite number approximately $OMEGA of states. Examples include all (d,k;c) codes (where approximately $OMEGA ≤ 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 L0. 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 its lexicographic order. All the necessary information for enumerative encoding and decoding of binary data will be subsequently stored in an array of size L0 × approximately $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. Ideas are presented for correction of random errors that occur in modulated sequences, so that errors in readout can be corrected prior to demodulation. These post- modulation error correction codes are necessary when modulation can be corrected prior to demodulation. These 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.",
author = "Masud Mansuripur",
year = "1991",
language = "English (US)",
isbn = "0819406082",
volume = "1499",
pages = "72--86",
booktitle = "Proceedings of SPIE - The International Society for Optical Engineering",
publisher = "Publ by Int Soc for Optical Engineering",

}

TY - GEN

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

AU - Mansuripur, Masud

PY - 1991

Y1 - 1991

N2 - Modulation constraints of practically any degree of complexity can be described by a state transition table with a finite number approximately $OMEGA of states. Examples include all (d,k;c) codes (where approximately $OMEGA ≤ 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 L0. 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 its lexicographic order. All the necessary information for enumerative encoding and decoding of binary data will be subsequently stored in an array of size L0 × approximately $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. Ideas are presented for correction of random errors that occur in modulated sequences, so that errors in readout can be corrected prior to demodulation. These post- modulation error correction codes are necessary when modulation can be corrected prior to demodulation. These 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.

AB - Modulation constraints of practically any degree of complexity can be described by a state transition table with a finite number approximately $OMEGA of states. Examples include all (d,k;c) codes (where approximately $OMEGA ≤ 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 L0. 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 its lexicographic order. All the necessary information for enumerative encoding and decoding of binary data will be subsequently stored in an array of size L0 × approximately $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. Ideas are presented for correction of random errors that occur in modulated sequences, so that errors in readout can be corrected prior to demodulation. These post- modulation error correction codes are necessary when modulation can be corrected prior to demodulation. These 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.

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

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

M3 - Conference contribution

AN - SCOPUS:0026368723

SN - 0819406082

VL - 1499

SP - 72

EP - 86

BT - Proceedings of SPIE - The International Society for Optical Engineering

PB - Publ by Int Soc for Optical Engineering

ER -