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

基于解码转发的高斯多中继信道最优路由

Optimal Routing for the Gaussian Multiple-Relay Channel with Decode-and-Forward

Lawrence Ong, Mehul Motani

摘要:

在本文中,我们研究了高斯多中继信道上的路由问题,其中节点采用解码和转发编码策略。我们感兴趣的路由信息流通过继电器,实现最高的DF率。我们首先构建一个算法,证明找到最佳DF路由。由于该算法在最坏情况下运行在阶乘时间内,我们提出了一个多项式时间的启发式算法,找到一个最佳的路线与高概率。我们证明,最佳(和接近最佳)DF路由是很好的,在实践中通过模拟分布式DF编码方案,使用低密度奇偶检验码打孔和增量冗余。

英文摘要:

In this paper, we study a routing problem on the Gaussian multiple relay channel, in which nodes employ a decode-and-forward coding strategy. We are interested in routes for the information flow through the relays that achieve the highest DF rate. We first construct an algorithm that provably finds optimal DF routes. As the algorithm runs in factorial time in the worst case, we propose a polynomial time heuristic algorithm that finds an optimal route with high probability. We demonstrate that that the optimal (and near optimal) DF routes are good in practice by simulating a distributed DF coding scheme using low density parity check codes with puncturing and incremental redundancy.

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

↑