A Generalized State Splitting Algorithm

Copyright [©] (1997) by IEEE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distrubuted for profit. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee.

In this paper we describe a generalization of the state-splitting algorithm (also known as the ACH algorithm) for constructing encoders which encode arbitrary data into constrained systems of sequences. In the generalized algorithm, we replace approximate cigenvectors with approximate eigenmatrices to yield a framework for designing encoders with smaller sliding-block windows and therefore lower error propagation.

By: Jonathan J. Ashley and Brian H. Marcus

Published in: IEEE Transactions on Information Theory, volume 43, (no 4), pages 1326-38 in 1997

Please obtain a copy of this paper from your local library. IBM cannot distribute this paper externally.

Questions about this service can be mailed to reports@us.ibm.com .