• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Information Theory, IEEE Transactions on >Bits Through Deterministic Relay Cascades With Half-Duplex Constraint
【24h】

Bits Through Deterministic Relay Cascades With Half-Duplex Constraint

机译：具有半双工约束的确定性中继级联通过位

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Consider a relay cascade, i.e., a network where a source node, a sink node and a certain number of intermediate source/relay nodes are arranged on a line and where adjacent node pairs are connected by error-free $(q+1)$ -ary pipes. Suppose the source and a subset of the relays wish to communicate independent information to the sink under the condition that each relay in the cascade is half-duplex constrained. A coding scheme is developed which transfers information by an information-dependent allocation of the transmission and reception slots of the relays. The coding scheme requires synchronization on the symbol level through a shared clock. The coding strategy achieves capacity for a single source. Numerical values for the capacity of cascades of various lengths are provided, and the capacities are significantly higher than the rates which are achievable with a predetermined time-sharing approach. If the cascade includes a source and a certain number of relays with their own information, the strategy achieves the cut-set bound when the rates of the relay sources fall below certain thresholds. For cascades composed of an infinite number of half-duplex constrained relays and a single source, we derive an explicit capacity expression. Remarkably, the capacity in bits/use for $q=1$ is equal to the logarithm of the golden ratio, and the capacity for $q=2$ is 1 bit/use.
机译：考虑一个中继级联，即一个网络，其中源节点，宿节点和一定数量的中间源/中继节点排列在一条线上，并且相邻节点对之间通过无错$（q + 1）$连接-ary管。假设在级联中的每个中继都是半双工约束的情况下，源和中继的子集希望将独立的信息传达给接收器。开发了一种编码方案，该编码方案通过与继电器的发送和接收时隙有关的信息来分配信息。编码方案要求通过共享时钟在符号级别进行同步。编码策略可实现单个来源的容量。提供了各种长度的级联容量的数值，并且该容量明显高于预定分时方法所能达到的速率。如果级联包括一个源和具有其自身信息的一定数量的中继，则当中继源的速率降至某些阈值以下时，该策略将达到割线限制。对于由无限数量的半双工约束继电器和单个信号源组成的级联，我们导出了一个显式的容量表达式。值得注意的是，$ q = 1 $的位容量/使用量等于黄金比率的对数，而$ q = 2 $的容量为1位/使用量。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号