首页> 外文会议>Conference on Swarm Intelligence and Evolutionary Computation >A family of Quasi-orthogonal space-time block codes with linear receivers
【24h】

A family of Quasi-orthogonal space-time block codes with linear receivers

机译:具有线性接收器的准正交空间间块代码的一系列族

获取原文

摘要

In this paper, we explored the potential of using linear receivers for one of the best existing space-time block codes (STBCs) namely Quasi-orthogonal STBCs (QOSTBCs). This family of QOSTBCs are known as one of the best, because of their good performance, systematic construction for any number of transmit and receive antennas and appropriate symbol rate. The only disadvantage of these codes could be the complexity of their maximum likelihood (ML) decoder. In this paper, we used linear receivers to reduce the complexity of the receiver. In both well-known linear receivers namely minimum mean square error (MMSE) decoder and Zero-forcing (ZF) decoder, the receiver needs to compute the inverse of the equivalent channel matrix which adds the burden of calculating the high computational complexity operation of matrix inverse. In this work, more importantly, we could formulate the general form of the inverse of the equivalent channel matrix which extremely decreases the computational complexity of the receiver.
机译:在本文中,我们探索了使用线性接收器的电势最好现有的空间 - 时间块码(空时分组码),即准正交空时分组码(QOSTBCs)中的一个。 QOSTBCs的这家被称为最好的之一,因其良好的性能,任何数量的发射系统的建设和接收天线和相应的符号率。唯一的这些码的缺点可能是它们的最大似然(ML)解码器的复杂性。在本文中,我们使用线性接收器,以减少接收器的复杂度。在这两种公知的线性接收器即最小均方误差(MMSE)解码器和迫零(ZF)解码器中,接收器需要计算等效信道矩阵的这增加了计算矩阵的高计算复杂度的操作的负担的逆逆。在这项工作中,更重要的是,我们可以制定其极其降低接收机的计算复杂度的等效信道矩阵的逆的一般形式。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号