Capacity of finite alphabet channels with noisy feedback

Chong Li, Nicola Elia

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

In [1], the authors characterized the noisy feedback 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.

Original languageEnglish (US)
Title of host publication2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011
Pages90-95
Number of pages6
DOIs
StatePublished - Dec 1 2011
Externally publishedYes
Event2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011 - Monticello, IL, United States
Duration: Sep 28 2011Sep 30 2011

Publication series

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

Other

Other2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011
CountryUnited States
CityMonticello, IL
Period9/28/119/30/11

Keywords

  • Capacity
  • directed information
  • noisy feedback
  • strong converse

Fingerprint Dive into the research topics of 'Capacity of finite alphabet channels with noisy feedback'. Together they form a unique fingerprint.

Cite this