A generalized state-splitting algorithm

Abstract

In this correspondence 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 eigenvectors with approximate eigenmatrices to yield a framework for designing encoders with smaller sliding-block windows and therefore lower error propagation. © 1997 IEEE.