On the information rate of binary-input channels with memory

Abstract

Standard forward sum-product trellis processing of simulated channel output is used to compute the uniform-input and nonuniform-input information rates for discrete-time binary-input channels. This method extends to finite-state channel input processes. The capacity of binary-input channels can be closely approximated by increasing the memory.