脏带通道和“在脏纸和脏带上的联合写入”的可变速率区域
Achievable Rate Regions for Dirty Tape Channels and "Joint Writing on Dirty Paper and Dirty Tape"
摘要：
我们考虑高斯脏带信道（DTC）Y=X+S+Z，其中S是发射机因果已知的加性高斯干扰。一般表达式[max]\_top（P_U，f（.），X=f（U，S））I（U;Y）表示该信道的容量。对于f（.）的线性赋值，即X=U-βS，该表达式导致Willems先前提出的补偿策略，以获得DTC的可实现速率。我们证明了对f（.）是最优的，条件是存在一个实数β^* 使得对（X+β^* S，U）与干扰S无关。此外，通过将分时技术应用于通过对f（.）的线性分配导出的可实现速率，得到了DTC容量的改进下界。我们还考虑了高斯多址信道的加性干扰，并研究了两种不同的情况下，这个系统。在第一种情况下，两个发射机都知道干扰的因果关系，而在第二种情况下，一个发射机可以访问干扰的非因果关系和其他因果关系。然后建立这两种情况下的可比较的速率区域。
英文摘要：
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 [max]\_top(P_U,f(.),X=f(U,S))I(U;Y) is presented 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 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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
