By Topic

Capacity of Time-Varying Channels With Causal Channel Side Information

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)
Goldsmith, A.J. ; Dept. of Electr. Eng., Stanford Univ., CA ; Medard, M.

We derive the capacity of time-varying channels with memory that have causal channel side information (CSI) at the sender and receiver. We obtain capacity of block-memoryless and asymptotically block-memoryless channels with block-memoryless or weakly decorrelating side information. Our coding theorems rely on causal generation of the codewords relative to the causal transmitter CSI. The CSI need not be perfect, and we consider the case where the transmitter and receiver have the same causal CSI as well as the case where the transmitter CSI is a deterministic function of the receiver CSI. For block-memoryless and asymptotically block-memoryless channels, our coding strategy averages mutual information density over multiple transmission blocks to achieve the maximum average mutual information. We apply the coding theorem associated with the block-memoryless channel to determine the capacity and optimal input distribution of intersymbol interference (ISI) time-varying channels with causal perfect CSI about the time-varying channel. The capacity of this channel cannot be found through traditional decomposition methods

Published in:

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