Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 46, NO. 3, MAY 2000 1131 [15] , "An upper bound to the capacity of discrete time Gaussian channel
 

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 feedback--II," IEEE Trans. Inform. Theory, vol. 40, pp. 588­593,
Mar. 1994.
[16] , "An upper bound to the capacity of discrete time Gaussian channel
with feedback--III," Bull. Kyushu Inst. Tech., Pure and Applied Math-
ematics, vol. 45, pp. 1­8, 1998.
The Capacity-Cost Function of Discrete Additive Noise
Channels With and Without Feedback
Fady Alajaji, Member, IEEE, and Nicholas Whalen
Abstract--We consider modulo- additive noise channels, where the
noise process is a stationary irreducible and aperiodic Markov chain of
order . We begin by investigating the capacity-cost function ( ( )) of
such additive-noise 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 Wyner­Ziv lower bound to the rate-distortion 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

  

Source: Alajaji, Fady - Department of Mathematics and Statistics, Queen's University (Kingston)

 

Collections: Engineering