• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>2014 IEEE International Conference on Communications Workshops >Generalized channel coding theorems for random multiple access communication
【24h】

Generalized channel coding theorems for random multiple access communication

机译：随机多址通信的广义信道编码定理

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

摘要

This paper extends the channel coding theorems of [1][2] to time-slotted random multiple access communication systems with a generalized problem formulation. Assume that users choose their channel codes arbitrarily in each time slot. When the codeword length can be taken to infinity, fundamental performance limitation of the system is characterized using an achievable region defined in the space of channel code index vector each specifies the channel codes of all users. The receiver decodes the message if the code index vector happens to locate inside the achievable region and reports a collision if it falls outside the region. A generalized system error performance measure is defined as the maximum of weighted probabilities of different types of communication error events. Upper bounds on the generalized error performance measure are derived under the assumption of a finite codeword length. It is shown that “interfering users” can be introduced to model not only the impact of interference from remote transmitters, but also the impact of channel uncertainty in random access communication.
机译：本文将[1] [2]的信道编码定理扩展到具有广义问题公式的时隙随机多址通信系统。假设用户在每个时隙中任意选择其信道代码。当码字长度可以取无穷大时，使用在信道码索引向量的空间中定义的可实现区域来表征系统的基本性能限制，每个信道码索引向量指定所有用户的信道码。如果代码索引向量恰好位于可实现区域的内部，则接收器会对消息进行解码，如果代码索引向量位于该区域之外，则报告冲突。广义的系统错误性能度量被定义为不同类型的通信错误事件的加权概率的最大值。广义错误性能度量的上限是在有限码字长度的假设下得出的。结果表明，可以引入“干扰用户”来模拟远程发射机干扰的影响，还可以对随机接入通信中信道不确定性的影响进行建模。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号