首页> 外文会议>Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on >Convex-programming bounds on the capacity of flat-fading channels
【24h】

Convex-programming bounds on the capacity of flat-fading channels

机译:平坦衰落信道容量的凸编程界限

获取原文
获取外文期刊封面目录资料

摘要

We propose a technique to derive analytic upper bounds on channel capacity via its dual expression. This is demonstrated on single- and multi-antenna flat fading channels where the receiver has no side information regarding the pathwise realisation of the fading process. The results indicate that the capacity of such channels typically grows double-logarithmically in the SNR and not logarithmically as the piecewise constant fading models predict.
机译:我们提出了一种通过对偶表达式来得出信道容量的解析上限的技术。这在单天线和多天线平坦衰落信道上得到了证明,在该信道上,接收机没有关于衰落过程的路径实现的辅助信息。结果表明,此类信道的容量通常在SNR中呈双对数增长,而不是分段恒定衰落模型所预测的对数增长。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号