• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>2013 Information Theory and Applications Workshop >Cognitive access policies under a primary ARQ process via chain decoding
【24h】

Cognitive access policies under a primary ARQ process via chain decoding

机译：通过链解码的主要ARQ流程下的认知访问策略

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

摘要

This paper introduces a novel technique for access by a cognitive Secondary User (SU) to a spectrum with an incumbent Primary User (PU), which uses Type-I Hybrid ARQ. The technique allows the SU to perform selective retransmissions of previously corrupted SU data packets. The temporal redundancy introduced by the primary ARQ protocol and by the selective SU retransmission process can be exploited by the SU receiver to perform Interference Cancellation (IC) over the entire interference pattern, thus creating a "clean" channel for the decoding of the concurrent message. The chain decoding technique, initiated by a successful decoding operation of a SU or PU message, consists in the iterative application of IC, as previously corrupted messages become decodable. Based on this scheme, we design an optimal policy that maximizes the SU throughput under a constraint on the average long-term PU throughput degradation. We show that the optimal policy can be found by first optimizing the SU access policy using a Markov Decision Process formulation, and then applying a chain decoding protocol defined by five basic rules. Such an approach enables a compact state representation of the protocol, and its efficient numerical optimization. Finally, we show by numerical results the throughput benefit of the proposed technique.
机译：本文介绍了一种新的技术，该技术可用于由认知二级用户（SU）访问使用现有I型混合ARQ的现有主要用户（PU）的频谱。该技术允许SU执行先前损坏的SU数据包的选择性重传。由主要ARQ协议和选择性SU重传过程引入的时间冗余可以被SU接收器用来在整个干扰模式上执行干扰消除（IC），从而为解码并发消息创建“干净”的信道。由SU或PU消息的成功解码操作启动的链解码技术包括IC的迭代应用，因为先前损坏的消息变得可解码。基于此方案，我们设计了一种最佳策略，该策略在平均长期PU吞吐量下降的约束下最大化SU吞吐量。我们表明，可以通过首先使用马尔可夫决策过程公式优化SU访问策略，然后应用由五个基本规则定义的链解码协议来找到最佳策略。这种方法可以实现协议的紧凑状态表示及其有效的数值优化。最后，我们通过数值结果表明了所提出技术的吞吐率优势。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号