Mutual information based resource allocation in relay networks

Mutual information based resource allocation in relay networks
复制标题

中继网络中基于互信息的资源分配

DOI:
--
复制
发表时间:
2010
期刊:
IEEE International Conference on Services Computing
影响因子:
--
通讯作者:
V. Kuhn
V. Kuhn
中科院分区:
--
文献类型:
--
作者:
Aimal Khan;V. Kuhn

文献摘要

被引文献

相似文献

本文提出了一种基于信息的软判决与硬判决相结合的译码转发资源分配新技术。将推导出串行信息串联的数学公式,并将其与并行信息组合一起使用,以分配功率和继电器。对于理想的码,功率增益和特定设置所需的最小中继数是近似值。与传统的最大化互信息的功率优化不同,在本工作中,分配的最小和功率足以允许目的地在单个中继功率限制下成功译码。最后,为了验证该技术的有效性,还将该技术应用于一个真实的代码。
In this paper, we present a novel technique of resource allocation based on information combining for decode-and-forward with soft decision and hard decision. The mathematical formulation for the serial information concatenation will be derived and used in conjunction with parallel information combining to allocate power and relays. For an ideal code power gain and the minimum number of required relays for specific setups are approximated. In contrast to conventional power optimization where the mutual information is maximized, in this work, the minimum sum power is allocated which suffice to allow the destination to successfully decode under individual relay power constraints. Finally, to confirm the validity of this technique, the technique is also applied to a real code.