Finite-State Modulation Codes for Data Storage

Brian H. Marcus; Paul H. Siegel; Jack K. Wolf

doi:10.1109/49.124467

IEEE Journal on Selected Areas in Communications

Paper

01 Jan 1992

Finite-State Modulation Codes for Data Storage

View publication

Abstract

This paper provides a self-contained exposition of modulation code design methods based upon the state splitting algorithm. The techniques are applied to the design of several codes of interest in digital data recording. © 1992 IEEE

Paper

Area-Efficient Architectures for the Viterbi Algorithm—Part II: Applications

C. Bernard Shung, Horng-Dar Lin, et al.

IEEE Transactions on Communications

Paper

State Splitting for Variable-Length Graphs

Roy Adler, Bruce Kitchens, et al.

IEEE Trans. Inf. Theory

Paper

Modulation and coding for information storage the success of certain modulation and coding techniques in data communications have inspired promising new applications in digital data storage

Paul H. Siegel, Jack K. Wolf

IEEE Communications Magazine

Paper

Construction of Encoders with Small Decoding Look-Ahead for Input-Constrained Channels

Jonathan J. Ashley, Brian H. Marcus, et al.

IEEE Trans. Inf. Theory

View all publications

Abstract

Related

Area-Efficient Architectures for the Viterbi Algorithm—Part II: Applications

State Splitting for Variable-Length Graphs

Modulation and coding for information storage the success of certain modulation and coding techniques in data communications have inspired promising new applications in digital data storage

Construction of Encoders with Small Decoding Look-Ahead for Input-Constrained Channels