论文部分内容阅读
摘 要：多用户信道是一种有着多个发送者和多个接收者的通信系统，它可以通过发送者和接收者的字母表以及信道转移概率来刻画。半个多世纪以来，人们对包括多接入信道，广播信道，中继信道以及干扰信道等多用户信道的容量區域问题进行了广泛的研究。只有少数的信道，例如多接入信道已经得到了较为满意的答案，其他信道只在特殊的情形下得到了解答。可以说对任何一种多用户信道的容量区域认知的推进都凝结了无数研究者们的心血。该文主要针对高斯干扰信道的容量区域问题进行了研究，其中衍生出来的计算容量界的方法也可以用做计算离散无记忆的组合信道、只有公共信息的广播信道的容量区域。主要的工作如下：（1）从主次用户的角度重新考虑高斯干扰信道，提出了可接入容量的概念，并给出了该容量的上下界。（2）利用信息谱的方法刻画了一般两用户干扰信道的容量区域的通用公式。证明了干扰信道的容量区域是由一簇矩形区域取并集得到的，每个矩形区域都是由一对独立的输入过程定义的。数值结果显示知道干扰结构可以给译码带来增益，且译码时知道的干扰的结构越多，获得的增益就越大。
关键词：多用户信道 高斯干扰信道 容量区域 信息谱
Abstract：A system with many senders and receivers forms a multi-users channel. Multi-users channel can be defined by the alphabets of the senders and receivers and the probability transition matrix. Over half a century， people spent many time on research the multi-users channel， including multiple access channel （MAC）， broadcast channel （BC）， relay channel （RC） and interference channel （IC）. Up to now， we only know the capacity region of general MAC. For the other channels， only in some special cases， the capacity regions can be known. It is very difficult to characterize the capacity region for multiple-users channel. This paper focus on the capacity region of Gaussian interference channel （GIFC）. In the process of seeking the bounds of the capacity of GIFC， we also find an algorithm to compute the capacity of compound channel or the maximum rate of broadcasting common messages to multiple receivers. The main contributions of our work are summarized as follows： （1）A new problem formulation is presented for the Gaussian interference channels （GIFC） with primary and secondary users. We also proposed a new concept， accessible capacity of secondary user. Meanwhile， the upper and lower bounds of the accessible capacity were given. （2）We present a general formula for the capacity region of the interference channel with two pairs of users. The formula shows that the capacity region is the union of a family of rectangles， where each rectangle is determined by a pair of spectral inf-mutual information rates. The results show that the decoding gain can be achieved by taking into account the structure of the interference.
Key Words：Multi-user Channel； Gaussian Interference Channel； Capacity Region； Information Spectrum
阅读全文链接（需实名注册）：http：//www.nstrs.cn/xiangxiBG.aspx？id=48966&flag=1
关键词：多用户信道 高斯干扰信道 容量区域 信息谱
Abstract：A system with many senders and receivers forms a multi-users channel. Multi-users channel can be defined by the alphabets of the senders and receivers and the probability transition matrix. Over half a century， people spent many time on research the multi-users channel， including multiple access channel （MAC）， broadcast channel （BC）， relay channel （RC） and interference channel （IC）. Up to now， we only know the capacity region of general MAC. For the other channels， only in some special cases， the capacity regions can be known. It is very difficult to characterize the capacity region for multiple-users channel. This paper focus on the capacity region of Gaussian interference channel （GIFC）. In the process of seeking the bounds of the capacity of GIFC， we also find an algorithm to compute the capacity of compound channel or the maximum rate of broadcasting common messages to multiple receivers. The main contributions of our work are summarized as follows： （1）A new problem formulation is presented for the Gaussian interference channels （GIFC） with primary and secondary users. We also proposed a new concept， accessible capacity of secondary user. Meanwhile， the upper and lower bounds of the accessible capacity were given. （2）We present a general formula for the capacity region of the interference channel with two pairs of users. The formula shows that the capacity region is the union of a family of rectangles， where each rectangle is determined by a pair of spectral inf-mutual information rates. The results show that the decoding gain can be achieved by taking into account the structure of the interference.
Key Words：Multi-user Channel； Gaussian Interference Channel； Capacity Region； Information Spectrum
阅读全文链接（需实名注册）：http：//www.nstrs.cn/xiangxiBG.aspx？id=48966&flag=1