Computing sum of sources over an arbitrary multiple access channel
Computing sum of sources over an arbitrary multiple access channel
复制标题
计算任意多路访问信道上的源总和
DOI：
10.1109/isit.2013.6620605
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
Arun Padakandla
中科院分区：
文献类型：
--
作者：
Arun Padakandla
考虑了通过多个访问通道（MAC）计算源总和的问题。在Nazer和Gastpar [1]提出的线性计算编码（LCC）技术的基础上，我们采用了嵌套coset代码的合奏来得出一组新的足够条件，用于计算任意MAC的源总和。嵌套的coset代码的最佳性[2]使该技术的表现超过了LCC，即使是具有结构匹配的线性MAC。还提供了非加addive MAC的示例，在此提出的技术在此提出的技术优于分离和基于系统的计算。最后，通过结合基于分离的策略来增强该技术，从而导致一组新的计算MAC的条件。
The problem of computing sum of sources over a multiple access channel (MAC) is considered. Building on the technique of linear computation coding (LCC) proposed by Nazer and Gastpar [1], we employ the ensemble of nested coset codes to derive a new set of sufficient conditions for computing sum of sources over an arbitrary MAC. The optimality of nested coset codes [2] enables this technique outperform LCC even for linear MAC with a structural match. Examples of non-additive MAC for which the technique proposed herein outperforms separation and systematic based computation are also presented. Finally, this technique is enhanced by incorporating separation based strategy, leading to a new set of sufficient conditions for computing sum over a MAC.