首页> 外文会议>IEEE Symposium on Computational Intelligence and Games >Achievable rate regions for Dirty Tape Channels and #x201C;joint writing on Dirty paper and Dirty Tape#x201D;
【24h】

Achievable rate regions for Dirty Tape Channels and #x201C;joint writing on Dirty paper and Dirty Tape#x201D;

机译:可实现的磁带渠道的速率区域和“脏纸和脏磁带上的联合写作”

获取原文

摘要

We consider the Gaussian Dirty Tape Channel (DTC) Y = X + S + Z, where S is an additive Gaussian interference known causally to the transmitter. The general expression maxPU, f(·), X = f(U, S) I(U; Y) is proposed for the capacity of this channel. For linear assignment to f(·), i.e., X = U — βS, this expression leads to the compensation strategy proposed previously by Willems to obtain an achievable rate for the DTC. We show that linear assignment to f(·) is optimal under the condition that there exists a real number β∗ such that the pair (X + β S, U) is independent of the interference S. Furthermore, by applying a time-sharing technique to the achievable rate derived by linear assignment to f (·), an improved lower bound on the capacity of DTC is obtained. We also consider the Gaussian multiple access channel with additive interference, and study two different scenarios for this system. In the first case, both transmitters know interference causally while in the second, one transmitter has access to the interference noncausally and the other causally. Achievable rate regions for these two scenarios are then established.
机译:我们考虑高斯脏磁带通道(DTC)y = x + s + z,其中S是因变送器而已知的添加剂高斯干扰。普通表达式最大值 PU,F(·),X = F(U,S) I(U; Y)被提出了该频道的容量。对于F(·),即,X = U-βS的线性分配,该表达导致先前由WILLEM提出的补偿策略以获得DTC的可实现速率。我们表明在存在真实数字β * 使得这对(x +βs,u)与干扰S无关的条件下,线性分配是最佳的。此外,通过将时间共享技术应用于通过线性分配导出的可实现的速率,获得了DTC的容量的改进的下限。我们还考虑具有添加性干扰的高斯多访问通道,并研究该系统的两个不同场景。在第一种情况下,两个发射机都知道在第二种时发生干扰,而一个发射机可以在不可分配的情况下访问干扰。然后建立可实现这两种情况的速率区域。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号