arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0902.2436cs.ITmath.IT
收藏

带干扰高斯中继网络的嵌套格码

Nested Lattice Codes for Gaussian Relay Networks with Interference

Wooseok Nam, Sae-Young Chung, Yong H. Lee

摘要:

本文研究了一类中继网络。我们假设,在一个节点上,其邻居的传出信道是正交的,而来自邻居的传入信号可能会相互干扰。我们感兴趣的是这些网络的组播容量。作为一个子类,我们首先专注于高斯中继网络的干扰,并找到一个可实现的速率使用格编码方案。它表明,有一个恒定的差距,我们的可达到的速率和信息论割集界。这与Avestimehr,Diggavi和Tse最近的结果相似,他们展示了一般高斯中继网络容量的近似特征。然而,我们的可验证性使用结构化代码而不是随机代码。使用高斯情况下使用的相同的想法,我们也考虑线性有限域对称网络的干扰和使用线性编码方案的容量的特征。

英文摘要:

In this paper, a class of relay networks is considered. We assume that, at a node, outgoing channels to its neighbors are orthogonal, while incoming signals from neighbors can interfere with each other. We are interested in the multicast capacity of these networks. As a subclass, we first focus on Gaussian relay networks with interference and find an achievable rate using a lattice coding scheme. It is shown that there is a constant gap between our achievable rate and the information theoretic cut-set bound. This is similar to the recent result by Avestimehr, Diggavi, and Tse, who showed such an approximate characterization of the capacity of general Gaussian relay networks. However, our achievability uses a structured code instead of a random one. Using the same idea used in the Gaussian case, we also consider linear finite-field symmetric networks with interference and characterize the capacity using a linear coding scheme.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑