• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Communications vol.1; 20040603-05; Bucharest(RO) >SUBOPTIMAL SPACE-TIME CODE FAMILY GENERATION METHOD
【24h】

SUBOPTIMAL SPACE-TIME CODE FAMILY GENERATION METHOD

机译：次优时空码族生成方法

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

摘要

The MIMO (Multiple Input Multiple Output) communication systems are of large interest nowadays. Multiple transmit and receive antennas may be used in a system in order to reduce the bit error rate. One way to do this is through space-time coding, an attractive technique that introduces redundancy in such a way as to combat channel fading. Several space-time codes have been developed through time, with various complexity levels and performances. It is shown that the space-time codes performances increase with the number of transmit antennas. However, it is proved that such block space-time codes cannot be obtained for a number of transmit antennas higher than 2, unless we accept a rate loss in our system. These codes are suboptimal from this point of view. The paper proposes a new recursive technique to generate a suboptimal space-time coding family.
机译：如今，MIMO（多输入多输出）通信系统备受关注。为了降低误码率，可以在系统中使用多个发射和接收天线。一种方法是通过空时编码，这是一种引人入胜的技术，以对抗信道衰落的方式引入了冗余。随着时间的流逝，已经开发了几种时空码，具有各种复杂度级别和性能。结果表明，时空编码性能随发射天线数量的增加而提高。然而，事实证明，除非我们在系统中接受速率损失，否则对于大于2个的多个发射天线无法获得此类块时空码。从这个角度来看，这些代码不是最佳的。本文提出了一种新的递归技术来生成次优的空时编码族。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号