Show simple item record

dc.contributor.authorKourtellaris, C. K.en
dc.contributor.authorCharalambous, Charalambos D.en
dc.creatorKourtellaris, C. K.en
dc.creatorCharalambous, Charalambos D.en
dc.description.abstractThe Finite Transmission Feedback Information (FTFI) capacity is characterized for any class of channel conditional distributions PBi|Bi-1, Ai and P Bi|Bi-1 i-M, Ai, where M is the memory of the channel, Bi ? {B-1, B0,..., Bi} are the channel outputs and Ai ? {A0, A1,...,Ai}, for i=0,...,n. The characterizations of FTFI capacity, are obtained by first identifying the information structures of the optimal channel input conditional distributions P[0,n] ? {P Ai|Ai-1, Bi-1 : i=0,...,n}, which maximize directed information C FB An?Bn ? sup p[0,n] I(An ? Bn), I(An ? Bn) ? n?i=0 I(Ai;Bi|Bi-1).. The main theorem states that, for any channel with memory M, the optimal channel input conditional distributions occur in the subset satisfying conditional independence P[0,n] ? {P Ai|A i-1, Bi-1 = P Ai|Bi-1 i-M : i = 1,...,n}, and the characterization of FTFI capacity is given by C F B, M An?Bn ? sup p[0,n] n?i=0 I(Ai;Bi|Bi-1 i-M). Similar conclusions are derived for problems with average cost constraints of the form 1/n+1 E {c0,n(An, Bn-1)} = k, k > 0, for specific functions c0,n( a n, b n-1).The feedback capacity is addressed by investigating lim n?8 1/n+1 CF B, M An?Bn. The methodology utilizes stochastic optimal control theory, to identify the control process, the controlled process, and often a variational equality of directed information, to derive upper bounds on I(An ? Bn), which are achievable over specific subsets of channel input conditional distributions P[0,n], which are characterized by conditional independence. The main results illustrate a direct analogy, in terms of conditional independence, of the characterizations of FTFI capacity and Shannon’s capacity formulae of Memoryless Channels. An example is presented to illustrate the role of optimal channel input process in the derivations of the direct and converse coding theorems. IEEEen
dc.sourceIEEE Transactions on Information Theoryen
dc.subjectStochastic control systemsen
dc.subjectStochastic systemsen
dc.subjectInformation structuresen
dc.subjectDirected informationen
dc.subjectConditional distributionen
dc.subjectFeed back informationen
dc.subjectProcess controlen
dc.subjectChannel capacityen
dc.subjectStochastic optimal controlen
dc.subjectEncoding (symbols)en
dc.subjectConditional independencesen
dc.subjectSpace stationsen
dc.subjectStructural optimizationen
dc.subjectUpper bounden
dc.subjectVariational equalitiesen
dc.titleInformation Structures for Feedback Capacity of Channels with Memory and Transmission Cost: Stochastic Optimal Control & Variational Equalitiesen
dc.description.issueJournal ArticleenΠολυτεχνική Σχολή / Faculty of EngineeringΤμήμα Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών / Department of Electrical and Computer Engineering
dc.source.abbreviationIEEE Trans.Inf.Theoryen
dc.contributor.orcidCharalambous, Charalambos D. [0000-0002-2168-0231]

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record