摘要
计算转发是一种可以通过结构码来管理无线通信网络中的干扰信号的中继策略。它的核心思想是每个中继计算出多个信源的码字的一个整数线性组合,而不是解码单独的码字。在本文中,我们考虑基于计算转发的无线通信中继系统的压缩模块的设计。我们建立了一种广泛的压缩框架,叫做广义计算压缩转发。我们说明了广义计算压缩转发能够取得更大的可达压缩速率区域。此外,广义计算压缩转发在达到最小总压缩速率意义上是最优的。本文还考虑了将广义计算压缩转发策略应用到一个两跳的中继网络中。数值仿真结果表明了本文提出的广义计算压缩转发策略相比于其他策略的优异性。
In this paper,we consider the design of compression functions for compute-and-forward(CF)based relaying.We develop a general compressing framework,termed generalized compute-compressand-forward(GCCF),where the compression function involves multiple quantization-and-modulo lattice operations.We show that GCCF achieves a broader compression rate region than CCF.We show that GCCF is optimal in the sense of achieving the minimum total compression rate.In addition,we consider a two-hop relay network employing the GCCF scheme.Numerical results are presented to demonstrate the performance superiority of GCCF over other schemes.
作者
程海
袁晓军
CHENG Hai;YUAN Xiao-jun(Shanghai Institute of Microsystem and Information Technology,Chinese Academy of Science,Shanghai 200050,China;School of Information Science and Technology,ShanghaiTech University,Shanghai 201210,China;University of Chinese Academy of Sciences,Beijing 101408,China;National Key Lab.of Sci.and Tech.on Commun.,University of Electronic Science and Technology of China,Chengdu 611731,China)
出处
《电子设计工程》
2018年第24期144-149,共6页
Electronic Design Engineering
基金
四川省教育厅自然科学重点项目(18ZA0226)
