.png){kind=icon}
返回
Efficient Decoding Algorithms for the Compute-and-Forward Strategy
.png){kind=icon}
OA
AI
DOI：10.1109/TCOMM.2015.2440361.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We address in this paper decoding aspects of the Compute-and-Forward (CF) physical-layer network coding strategy. Under the CF framework, encoders use a special class of nested lattice codes and decoders are based on suboptimal minimum distance decoding of unknown performance gap with respect to optimal decoders. In this work, we develop and assess the performance of novel decoding algorithms for CF operating in the multiple access channel. Starting with the Gaussian channel, we investigate the maximum a posteriori (MAP) decoder. We derive a novel MAP decoding metric and develop practical decoding algorithms shown numerically to outperform the original one. For the fading channel, we analyze the ML decoder for integer-valued lattices and develop a novel Diophantine approximation-based near-ML decoding algorithm shown numerically to outperform the original CF decoder in the 1-D case using Z lattices.
Keyword:
Physical-layer network coding
compute-and-forward
lattice decoding
maximum a posteriori decoding
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏Restorative mowing on an abandoned semi‐natural meadow: short‐term and predicted long‐term effects
PREAI
分享收藏
查看更多内容