具有因果敌手的二次约束信道
Quadratically Constrained Channels with Causal Adversaries
摘要:
我们考虑的问题,在一个信道上的因果干扰对手受到二次约束。发送方Alice希望通过经由通信信道发送实值长度- $n$码字$\mathbf{x}=x_1,...,x_n$来向接收方Bob传送消息。Alice和Bob并不具有共同的随机性。已知Alice的编码策略,对抗性干扰机James以因果方式选择实值长度n噪声序列$\mathbf{s}=s_1,..,s_n$,即,每个$s_t (1<=t<=n)$只能依赖于$x_1,...,x_t$。Bob接收$\mathbf{y}$,即Alice的传输$\mathbf{x}$和James的干扰向量$\mathbf{s}$之和,并且需要从该和可靠地估计Alice的消息。此外,Alice和James的传输功率受到二次约束$P>0$和$N>0$的限制。在这项工作中,我们的特点是这样一个通道的最佳值的一系列优化的极限优越的信道容量。最佳值的上限和下限提供了分析和数值。有趣的是,与许多通信问题不同,在该因果设置中,Alice的最优码本可能不具有均匀的功率分配-对于特定SNR,具有两级均匀功率分配的码本导致比具有均匀功率分配的码本严格更高的速率。
英文摘要:
We consider the problem of communication over a channel with a causal jamming adversary subject to quadratic constraints. A sender Alice wishes to communicate a message to a receiver Bob by transmitting a real-valued length-$n$ codeword $\mathbf{x}=x_1,...,x_n$ through a communication channel. Alice and Bob do not share common randomness. Knowing Alice's encoding strategy, an adversarial jammer James chooses a real-valued length-n noise sequence $\mathbf{s}=s_1,..,s_n$ in a causal manner, i.e., each $s_t (1<=t<=n)$ can only depend on $x_1,...,x_t$. Bob receives $\mathbf{y}$, the sum of Alice's transmission $\mathbf{x}$ and James' jamming vector $\mathbf{s}$, and is required to reliably estimate Alice's message from this sum. In addition, Alice and James's transmission powers are restricted by quadratic constraints $P>0$ and $N>0$. In this work, we characterize the channel capacity for such a channel as the limit superior of the optimal values of a series of optimizations. Upper and lower bounds on the optimal values are provided both analytically and numerically. Interestingly, unlike many communication problems, in this causal setting Alice's optimal codebook may not have a uniform power allocation - for certain SNR, a codebook with a two-level uniform power allocation results in a strictly higher rate than a codebook with a uniform power allocation would.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。