...
首页> 外文期刊>Signal Processing Letters, IEEE >Novel Rotated Quasi-Orthogonal Space-Time Block Codes With the Fixed Nearest Neighbor Number
【24h】

Novel Rotated Quasi-Orthogonal Space-Time Block Codes With the Fixed Nearest Neighbor Number

机译:固定最近邻数的新型旋转拟正交时空分组码

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

In this letter, we consider a coherent communication system equipped with multiple transmitter antennas and a single receiver antenna, i.e., a MISO system. For such a system, quasi-orthogonal STBC designs with fast maximum likelihood (ML) decoding have been proposed. However, full diversity cannot be achieved by such codes. The rotated quasi-orthogonal STBC overcomes such shortcomings and enables full diversity and optimal coding gain. However, for large constellations, the performance of such codes deteriorates due to the increase of the number of the nearest neighbor per symbol. In this letter, we propose to add the number of nearest neighbor as a design criterion. We show that for the rotated quasi-orthogonal code proposed in, the number of nearest neighbor tends to infinity when the size of constellation becomes infinite. Furthermore, we propose to have a particular value of rotation and show that this value not only achieves full diversity and maximum coding gain, but also has only a small number of nearest neighbors even for very large constellations.
机译:在这封信中,我们考虑一个配备有多个发射器天线和单个接收器天线的相干通信系统,即MISO系统。对于这样的系统,已经提出了具有快速最大似然(ML)解码的准正交STBC设计。但是,这种代码不能实现完全的多样性。旋转的准正交STBC克服了这些缺点,并实现了全分集和最佳编码增益。然而,对于大的星座,由于每个符号的最近邻居数目的增加,这种代码的性能恶化。在这封信中,我们建议添加最近邻居的数量作为设计标准。我们表明,对于其中提出的旋转拟正交码,当星座图的大小变为无限大时,最近邻居的数量趋于无穷大。此外,我们建议具有特定的旋转值,并表明该值不仅可以实现完全分集和最大编码增益,而且即使对于非常大的星座,也仅具有少量的最近邻居。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号