Arithmetic Codes for Constrained Channels

A General Fixed Rate Arithmetic Coding Method for Constrained Channels

“…References [2,3] show how a fixed rate length-based (Lbased) arithmetic code can be applied to the problem of coding to a constrained channel, where the constraints are described by a channel finite state machine (CFSM). We assume familiarity with a companion paper [3] which provides references to other approaches to channel coding and which contains some background material on arithmetic coding. We employ the same terminology and system of notation as [3].…”

“…We assume familiarity with a companion paper [3] which provides references to other approaches to channel coding and which contains some background material on arithmetic coding. We employ the same terminology and system of notation as [3].…”

“…Such generalized {d,k) problems include a charge-limited constraint [4] or desired spectral null. In this paper, we extend the simpler approach of [3] to the general case, resulting in a more economical realization than that in [2]. For a description of L-based and P-based (probability-based) arithmetic compression codes, see [5].…”

“…For a description of L-based and P-based (probability-based) arithmetic compression codes, see [5]. The foundation for the application of arithmetic codes to the constrained channel appears in [3]; however, we provide a brief review.…”

“…As in [3], coding to a constrained channel corresponds to an expansion operation on the source data, and recovering the source data corresponds to a compression operation. It is convenient to describe the operations in terms of the compression operation.…”