首页> 外文会议>IEEE Conference on Industrial Electronics and Applications;ICIEA 2009 >Design and analysis of low complexity quasi-orthogonal space-time block code
【24h】

Design and analysis of low complexity quasi-orthogonal space-time block code

机译:低复杂度准正交空时分组码的设计与分析

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

摘要

Analyzing the structure and character of several issues of the quasi-orthogonal space-time block code (QOSTBC), this paper proposes two novel quasi-orthogonal space-time block codes for four antennas. The novel codes are enriched the family of QOSTBC. Experiment results indicate that these two codes have good performance as TBH and Jafarkhani schemes, while the decoding complexity is the same as other quasi-orthogonal codes. By using zero-forcing decoding algorithm for novel codes, simulation results show that zero-forcing algorithm has better bit error rate performance as compared to the existing typical codes and can reduce the computation complexity at receiver.
机译:通过分析准正交空时分组码(QOSTBC)若干问题的结构和特点,提出了两种新颖的四天线准正交空时分组码。新颖的密码丰富了QOSTBC的家族。实验结果表明,这两种编码与TBH和Jafarkhani方案相比具有良好的性能,而解码复杂度与其他准正​​交编码相同。仿真结果表明,通过对新码使用零迫解码算法,与现有的典型码相比,零迫算法具有更好的误码率性能,可以降低接收机的计算复杂度。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号