By Topic

The capacity-cost function of discrete additive noise channels with and without feedback

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Alajaji, F. ; Dept. of Math. & Stat., Queen''s Univ., Kingston, Ont., Canada ; Whalen, N.

We consider modulo-q additive noise channels, where the noise process is a stationary irreducible and aperiodic Markov chain of order k. We begin by investigating the capacity-cost function (C(β)) of such additive-noise channels without feedback. We establish a tight upper bound to (C(β)) which holds for general (not necessarily Markovian) stationary q-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 C(β) which along with the upper bound can be easily calculated using the Blahut algorithm for the computation of channel capacity. Numerical results indicate that these bounds form a tight envelope on C(β). We next examine the effect of output feedback on the capacity-cost function of these channels and establish a lower bound to the capacity-cost function with feedback (CFB(β)). We show (both analytically and numerically) that for a particular feedback encoding strategy and a class of Markov noise sources, the lower bound to CFB(β) is strictly greater than C(β). This demonstrates that feedback can increase the capacity-cost function of discrete channels with memory

Published in:

Information Theory, IEEE Transactions on  (Volume:46 ,  Issue: 3 )