By Topic

Capacity of finite alphabet channels with noisy 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
$33 $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)
Chong Li ; Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, 50011 ; Nicola Elia

In, the authors characterized the noisy feed- back capacity in terms of the residual directed information. However, this characterization may not be computable due to the probabilistic limit and code-functions in the formula. In this paper, we first explore a necessary and sufficient condition for the strong converse property of channels with noisy feedback. Then, for channels satisfying the strong converse property, we characterize the capacity in terms of the causal conditional directed information, which is a simplified version of the characterization in [1], This new characterization may be computable by applying some technical algorithms (e.g. dynamic programming) which are used in computing the well- known directed information.

Published in:

Communication, Control, and Computing (Allerton), 2011 49th Annual Allerton Conference on

Date of Conference:

28-30 Sept. 2011