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

物理层网络编码的代数方法

Algebraic Approach to Physical-Layer Network Coding

Chen Feng, Danilo Silva, Frank R. Kschischang

摘要:

研究了基于嵌套格的物理层网络编码方案的设计问题。建立在计算和转发(C&F)的中继策略的Nazer和Gastpar,谁证明了其渐近增益使用信息理论的工具,代数方法被用来显示其潜力,在实际中,非渐近,设置。通过将C&F与模理论直接联系起来,给出了一个研究基于嵌套格的PNC方案(简称LNC方案)的一般框架。特别是,一个通用的LNC计划,使基本的嵌套格码上没有任何假设。在此框架下重新解释了C&F,并给出了LNC格式的几种推广构造。通用LNC方案自然导致模块上的线性网络编码信道,基于该信道可以实现非相干网络编码。接下来,性能/复杂性权衡的LNC计划进行了研究,特别侧重于超立方体形状的LNC计划。这类LNC方案的错误概率在很大程度上取决于底层嵌套格码的最小陪集间距离。几个说明性的超立方体形状的LNC方案的基础上设计的构造A和D,示出了3至7.5 dB的标称编码增益可以获得合理的解码复杂度。最后,解码多个线性组合的可能性被认为是相关的最短独立向量的问题。主导解决方案的概念一起开发了一个合适的格减少为基础的算法。

英文摘要:

The problem of designing physical-layer network coding (PNC) schemes via nested lattices is considered. Building on the compute-and-forward (C&F) relaying strategy of Nazer and Gastpar, who demonstrated its asymptotic gain using information-theoretic tools, an algebraic approach is taken to show its potential in practical, non-asymptotic, settings. A general framework is developed for studying nested-lattice-based PNC schemes---called lattice network coding (LNC) schemes for short---by making a direct connection between C&F and module theory. In particular, a generic LNC scheme is presented that makes no assumptions on the underlying nested lattice code. C&F is re-interpreted in this framework, and several generalized constructions of LNC schemes are given. The generic LNC scheme naturally leads to a linear network coding channel over modules, based on which non-coherent network coding can be achieved. Next, performance/complexity tradeoffs of LNC schemes are studied, with a particular focus on hypercube-shaped LNC schemes. The error probability of this class of LNC schemes is largely determined by the minimum inter-coset distances of the underlying nested lattice code. Several illustrative hypercube-shaped LNC schemes are designed based on Construction A and D, showing that nominal coding gains of 3 to 7.5 dB can be obtained with reasonable decoding complexity. Finally, the possibility of decoding multiple linear combinations is considered and related to the shortest independent vectors problem. A notion of dominant solutions is developed together with a suitable lattice-reduction-based algorithm.

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

↑