Sequential Necessary and Sufficient Conditions for Capacity Achieving Distributions of Channels With Memory and Feedback

From MaRDI portal
Publication:4566546

DOI10.1109/TIT.2017.2724552zbMATH Open1390.94036arXiv1604.02742OpenAlexW2963117578WikidataQ58037974 ScholiaQ58037974MaRDI QIDQ4566546FDOQ4566546


Authors: Photios A. Stavrou, Christos K. Kourtellaris, Charalambos D. Charalambous Edit this on Wikidata


Publication date: 27 June 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: We derive sequential necessary and sufficient conditions for any channel input conditional distribution calP0,nriangleqPXt|Xt1,Yt1:t=0,ldots,n to maximize the finite-time horizon directed information defined by C^{FB}_{X^n ightarrow Y^n} riangleq sup_{{cal P}_{0,n}} I(X^n ightarrow{Y^n}),~~~ I(X^n ightarrow Y^n) =sum_{t=0}^n{I}(X^t;Y_t|Y^{t-1}) for channel distributions PYt|Yt1,Xt:t=0,ldots,n and PYt|YtMt1,Xt:t=0,ldots,n, where YtriangleqY0,ldots,Yt and XtriangleqX0,ldots,Xt are the channel input and output random processes, and M is a finite nonnegative integer. oi We apply the necessary and sufficient conditions to application examples of time-varying channels with memory and we derive recursive closed form expressions of the optimal distributions, which maximize the finite-time horizon directed information. Further, we derive the feedback capacity from the asymptotic properties of the optimal distributions by investigating the limit C_{X^infty ightarrow Y^infty}^{FB} riangleq lim_{n longrightarrow infty} frac{1}{n+1} C_{X^n ightarrow Y^n}^{FB} without any 'a priori assumptions, such as, stationarity, ergodicity or irreducibility of the channel distribution. The necessary and sufficient conditions can be easily extended to a variety of channels with memory, beyond the ones considered in this paper.


Full work available at URL: https://arxiv.org/abs/1604.02742







Cited In (2)





This page was built for publication: Sequential Necessary and Sufficient Conditions for Capacity Achieving Distributions of Channels With Memory and Feedback

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4566546)