 
Summary: IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 46, NO. 3, MAY 2000 1131
[15] , "An upper bound to the capacity of discrete time Gaussian channel
with feedbackII," IEEE Trans. Inform. Theory, vol. 40, pp. 588593,
Mar. 1994.
[16] , "An upper bound to the capacity of discrete time Gaussian channel
with feedbackIII," Bull. Kyushu Inst. Tech., Pure and Applied Math
ematics, vol. 45, pp. 18, 1998.
The CapacityCost Function of Discrete Additive Noise
Channels With and Without Feedback
Fady Alajaji, Member, IEEE, and Nicholas Whalen
AbstractWe consider modulo additive noise channels, where the
noise process is a stationary irreducible and aperiodic Markov chain of
order . We begin by investigating the capacitycost function ( ( )) of
such additivenoise channels without feedback. We establish a tight upper
bound to ( ( )) which holds for general (not necessarily Markovian)
stationary ary noise processes. This bound constitutes the counterpart
of the WynerZiv lower bound to the ratedistortion function of stationary
sources with memory. We also provide two simple lower bounds to ( )
which along with the upper bound can be easily calculated using the
Blahut algorithm for the computation of channel capacity. Numerical
