Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
129 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Information Structures for Feedback Capacity of Channels with Memory and Transmission Cost: Stochastic Optimal Control & Variational Equalities-Part I (1512.04514v2)

Published 14 Dec 2015 in cs.IT and math.IT

Abstract: The Finite Transmission Feedback Information (FTFI) capacity is characterized for any class of channel conditional distributions $\big{{\bf P}{B_i|B{i-1}, A_i} :i=0, 1, \ldots, n\big}$ and $\big{ {\bf P}{B_i|B_{i-M}{i-1}, A_i} :i=0, 1, \ldots, n\big}$, where $M$ is the memory of the channel, $Bn {\stackrel{\triangle}{=}} {B_j: j=\ldots, 0,1, \ldots, n}$ are the channel outputs and $An{\stackrel{\triangle}{=}} {A_j: j=\ldots, 0,1, \ldots, n}$ are the channel inputs. The characterizations of FTFI capacity, are obtained by first identifying the information structures of the optimal channel input conditional distributions ${\cal P}{[0,n]} {\stackrel{\triangle}{=}} \big{ {\bf P}{A_i|A{i-1}, B{i-1}}: i=0, \ldots, n\big}$, which maximize directed information. The main theorem states, for any channel with memory $M$, the optimal channel input conditional distributions occur in the subset satisfying conditional independence $\stackrel{\circ}{\cal P}{[0,n]}{\stackrel{\triangle}{=}} \big{ {\bf P}{A_i|A{i-1}, B{i-1}}= {\bf P}{A_i|B{i-M}{i-1}}: i=1, \ldots, n\big}$, and the characterization of FTFI capacity is given by $C_{An \rightarrow Bn}{FB, M} {\stackrel{\triangle}{=}} \sup_{ \stackrel{\circ}{\cal P}{[0,n]} } \sum{i=0}n I(A_i; B_i|B_{i-M}{i-1}) $. The methodology utilizes stochastic optimal control theory and a variational equality of directed information, to derive upper bounds on $I(An \rightarrow Bn)$, which are achievable over specific subsets of channel input conditional distributions ${\cal P}_{[0,n]}$, which are characterized by conditional independence. For any of the above classes of channel distributions and transmission cost functions, a direct analogy, in terms of conditional independence, of the characterizations of FTFI capacity and Shannon's capacity formulae of Memoryless Channels is identified.

Citations (8)

Summary

We haven't generated a summary for this paper yet.