• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Communications >Dual Capacity Upper Bounds for Binary-Input Single-Tap ISI Channels
【24h】

Dual Capacity Upper Bounds for Binary-Input Single-Tap ISI Channels

机译：二进制输入单抽头ISI通道的双倍容量上限

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

摘要

The capacity of noisy channels with memory and finite input has been difficult to characterize explicitly in many cases. In this paper, we consider single-tap binary-input Gaussian channels with inter-symbol interference (ISI). The dual capacity method is used to obtain upper bounds using Markov test distributions. The bound, expressed as a single-letter optimization problem, is solved numerically. For higher memory, the notion of cycle basis is used to provide an exponential reduction in the computational complexity of the optimization problem. Bounds were obtained for the important case of the dicode channel, and these are better than the previously known upper bounds and are close to achievable rates over a wide range of SNRs.
机译：在许多情况下，很难明确表征带有存储器和有限输入的嘈杂通道的容量。在本文中，我们考虑了具有符号间干扰（ISI）的单抽头二进制输入高斯信道。双容量方法用于使用马尔可夫检验分布来获得上限。表示为单字母优化问题的边界通过数值求解。对于更高的内存，使用循环基础的概念可最大程度地减少优化问题的计算复杂度。对于双码信道的重要情况，获得了边界，这些边界比以前已知的上限更好，并且在很大的SNR范围内接近可达到的速率。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号