An upper bound on the capacity of channels with memory and constraint input

Abstract

A method for computing upper bounds on capacity for a class of time-invariant indecomposable finite state channels is presented. It extends a result for finite-input memoryless channels. Numerical results are provided for selected channels having memory and constraint (binary) input.