Z干扰信道的容量问题

项目名称： Z干扰信道的容量问题

项目编号： No.61201170

项目类型： 青年科学基金项目

立项/批准年度： 2013

项目学科： 电子学与信息系统

项目作者： 刘楠

作者单位： 东南大学

项目金额： 25万元

中文摘要： 干扰信道是网络信息论中的重要模型。Z干扰信道作为干扰信道的特例，是对干扰现象的最简单建模。然而求解干扰信道或Z干扰信道的容量区域非常困难。容量区域难以求出的重要原因在于容量上界中辅助随机变量的设置。已有的设置方法多适用于集中式编码的网络，直接应用此方法在干扰信道（分布式编码）中会导致设置出的辅助变量不满足独立性，致使容量上下界不一致。为此，本项目研究如何将传统用于集中式编码网络辅助变量的设置方法灵活的运用到Z干扰信道中。前期工作已取得一定进展：当Z干扰信道满足移不变条件和最大熵条件时，申请人成功的设置了满足独立性的辅助变量，给出了第一个包含辅助随机变量的干扰信道容量区域。从已有的工作基础展望，我们拟对移不变条件和最大熵条件进行推敲，尝试将这两个条件进一步放松或者完全去掉，将结论拓宽到更广泛的Z干扰信道，增强我们对干扰的理解，向完全解决高斯Z干扰信道甚至最广泛Z干扰信道的容量问题迈进。

中文关键词： Z干扰信道；Z信道；信道容量；分布式编码网络；

英文摘要： Interference channel is an important multiuser channel model in network information theory. As a special case of the interference channel, Z-interference channel is the simplest model for interference in wireless communciations. However, the capacity region of most interference channels or Z-interference channels remain open. One of the main difficulties in characterizing the capacity region of the Z-interference channel stems from the difficulty in defining auxiliary random variables in the proof of converse. Traditional tools for defining auxiliary random variables work well in networks with one transmitter, i.e., centralized coding. Direct application of these tools to distributed-coding networks such as the interference channel will result in auxiliary random variables being correlated with all other variables in the network, causing a gap between the lower and upper bounds of the capacity region. In this proposal, we would like to investigate how to appropriate apply converse tools for defining auxiliary random variable traditionally used in centralized-coding networks to the Z-interference channel (distributed coding). Along this line, we have already made some progress: for Z-interference channels that satisfy the shift-invariant condition and the maximum entropy condition, we have successfully defined au

英文关键词： Z-interference channel；Z channel；channel capacity；networks with the element of distributed encoding；